324 research outputs found
A bio-inspired scheduling scheme for wireless sensor networks
Author name used in this publication: Chi K. TseAuthor name used in this publication: Francis C. M. LauRefereed conference paper2007-2008 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe
Impact of Number of Artificial Ants in ACO on Network Convergence Time: A Survey
Due to the dynamic nature of computer networks today, there is need to make the networks self-organized. Selforganization can be achieved by applying intelligent systems in the networks to improve convergence time. Bio-inspired algorithms that imitate real ant foraging behaviour of natural ants have been seen to be more successful when applied to computer networks to make the networks self-organized. In this paper, we studied how Ant Colony Optimization (ACO) has been applied in the networks as a bio-inspired algorithm and its challenges. We identified the number of ants as a drawback to guide this research. We retrieved a number of studies carried out on the influence of ant density on optimum deviation, number of iterations and optimization time. We found that even though some researches pointed out that the numbers of ants had no effect on algorithm performance, many others showed that indeed the number of ants which is a parameter to be set on the algorithm significantly affect its performance. To help bridge the gap on whether or not the number of ants were significant, we gave our recommendations based on the results from various studies in the conclusion section of this pape
Recommended from our members
QoS - Aware content oriented flow routing in optical computer network
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis, one of the most important issues in the field of networks communication is tackled and addressed. This issue is represented by QoS, where the increasing demand on highquality
applications together with the fast increase in the rates of Internet users have led to
massive traffic being transmitted on the Internet. This thesis proposes new ideas to manage the flow of this huge traffic in a manner that contributes in improving the communication QoS. This can be achieved by replacing the conventional application-insensitive routing schemes by others
which take into account the type of applications when making the routing decision. As a first contribution, the effect on the potential development in the quality of experience on the loading of
Basra optical network has been investigated. Furthermore, the traffic due to each application was dealt with in different ways according to their delay and loss sensitivities. Load rate distributions
over the various links due to the different applications were deployed to investigate the places of possible congestions in the network and the dominant applications that cause such congestions. In addition, OpenFlow and Optica Burst Switching (OBS) techniques were used to provide a wider range of network controllability and management. A centralised routing protocol
that takes into account the available bandwidth, delay, and security as three important QoS parameters, when forwarding traffics of different types, was proposed and implemented using OMNeT++ networks simulator. As a novel idea, security has been incorporated in our QoS requirements by incorporating Oyster Optics Technology (OOT) to secure some of the optical links aiming to supply the network with some secure paths for those applications that have high
privacy requirements. A particular type of traffic is to be routed according to the importance of these three QoS parameters for such a traffic type. The link utilisation, end to end delays and securities due to the different applications were recorded to prove the feasibility of our proposed
system. In order to decrease the amount of traffic overhead, the same QoS constraints were implemented on a distributed Ant colony based routing. The traditional Ant routing protocol was improved by adopting the idea of Red-Green-Blue (RGB) pheromones routing to incorporate these QoS constraints. Improvements of 11% load balancing, and 9% security for private data was achieved compared to the conventional Ant routing techniques. In addition, this Ant based
routing was utilised to propose an improved solution for the routing and wavelength assignment problem in the WDM optical computer networks
Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead
Mobile ad-hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. Ant colony optimization (ACO) is a population based meta-heuristic for combinatorial optimization problems such as communication network routing problem. In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way, back they choose the path with the highest pheromones which becomes the shortest path. But Ant net Algorithms may cause the network congestion and stagnation. Here, multiple optimal paths are proposed with negligible overhead in spite of single optimal path in Ant net routing algorithm, so that the problem of stagnation can be rectified. This paper proposes an improved Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead
- …