Performance Comparison of ACO Algorithms for MANETs

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

Implementation of Pitch Control Of wind Turbine Using Simulink (Matlab)  

In this paper, it is shown that how the variable speed wind turbine can be used to generate a fixed value of voltage at the output with the help of a pi controller and it is done by varying the pitch angle of the b...

Face Recognition Using Principal Component Analysis Method 

This paper mainly addresses the building of face recognition system by using Principal Component Analysis (PCA). PCA is a statistical approach used for reducing the number of variables in face recognition. In PCA...

Topology ascendancy in mobile ad hoc networks with accommodating connections 

Supportive communication has conventional tremendous attention for wireless networks. Most existing works on supportive infrastructure are focused on link-level corporeal layer issues. Consequently, the impacts of suppor...

Optimization of Searches on Social Networks using Graph theory and Formal Concepts Analysis 

Social networking system is an online service, platform that focuses on facilitating the building of social relations among people who, for example, share interests, activities, backgrounds, or real-life connection...

Low Power And Area Efficiency of SHA-1 and SHA-2 Hash Algorithm

This paper summarizes about the design of a Low Power and Efficiency of SHA-1 and SHA-2 Hash Functions capable of performing all members of the Secure Hash Algorithm (SHA) group of Hash Functions. The need for high-s...

Download PDF file
  • EP ID EP156987
  • DOI -
  • Views 112
  • Downloads 0

How To Cite

Jubin Sebastian E (2013). Performance Comparison of ACO Algorithms for MANETs. International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 2(1), 27-32. https://europub.co.uk/articles/-A-156987