Sciweavers

Share
ITCC
2005
IEEE

Simulation of Mobility and Routing in Ad Hoc Networks using Ant Colony Algorithms

9 years 5 months ago
Simulation of Mobility and Routing in Ad Hoc Networks using Ant Colony Algorithms
Mobile Ad-hoc Networks (MANET’s) have recently attracted a lot of attention in the research community as well as the industry. This technology has become increasingly important in communication and networking. Routing is one of the most important and difficult aspects in ad hoc network since ad hoc network topology frequently changes. Conventional routing algorithms are difficult to be applied to a dynamic network topology, therefore modeling and design an efficient routing protocol in such dynamic networks is an important issue. One of the meta-heuristic algorithms which is inspired by the behavior of real ants is called Ant Colony Optimization (ACO) algorithm, it can definitely be used as a tool to tackle the mercurial scenarios present in this dynamic environment. In this paper, I have designed a model which combines ant colony behavior and queuing network analysis to evaluate End-to-End packet delay in MANET.
Tarek H. Ahmed
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where ITCC
Authors Tarek H. Ahmed
Comments (0)
books