Performance Comparison of ACO Algorithms for MANETs
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2013, Vol 2, Issue 1
Abstract
Mobile Ad Hoc Network (MANET) is a dynamic multichip wireless network which is established by a set of mobile nodes on a shared wireless channel. One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across a network from a source to a destination. The challenging task in MANET is to find most efficient routing due to the changing topology and the dynamic behavior of the nodes in MANET. It has been found that Ant Colony Optimization (ACO) is a special kind of optimization technique having characterization of Swarm Intelligence (SI) which is highly suitable for finding the adaptive routing for such type of volatile network.ACO algorithms are inspired by a foraging behavior of group of ants which are able to find optimal connection of the ant’s nest with the source of food. ACO routing algorithms use simple agents called artificial ants which establish optimum paths between source and destination that communicate indirectly with each other by means of stigmerg . Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since they do not involve extra message exchanges to maintain paths when network topology changes, they are suitable for mobile ad-hoc networks where nodes move dynamically and topology changes frequently .In this paper comparison and simulation of different ACO based routing algorithms is presented.
Authors and Affiliations
Jubin Sebastian E
Keywords
Related Articles
- EP ID EP156987
- DOI -
- Views 116
- Downloads 0
IMAGE SEGMENTATION TECHNIQUES AND GENETIC ALGORITHM
Image Segmentation is a decomposition of scene into its components. It is a key step in analysis. Edge, point, line, boundary texture and region detection are the various forms of image segmentation. Various technolog...
An efficient unobservable routing scheme resistant against DoS attacks
Privacy protection for ad hoc networks with low-power wireless devices and lowbandwidth network connection is a very challenging task. A number of anonymous routing schemes have been proposed for ad hoc networks to...
Optimization of Throughput Using Multicast Routing in Wireless Mesh Networks
In the recent years the multicast routing in wireless mesh network has given attention on metrics to improve link quality and to increase the high-throughput.Nodes must have always contact with their neighbouring nodes t...
EFFORT ESTIMATION OF SOFTWARE PROJECT
The effort invested in a software project is probably one of the most important and most analyzed variables in recent years in the process of project management. The limitation of algorithmic effort prediction models...
Grid Density Based Clustering Algorithm
Clustering is the one of the most important task of the data mining. Clustering is the unsupervised method to find the relations between points of dataset into several groups. It can be done by using various types...