By Topic

Ant-Based Stable Disjoint Path Routing Algorithm in Wireless Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhengyu Wu ; Beijing Institute of Technology, China ; Lin Cui ; Xiangjun Dong

A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. Earlier research has proposed several unipath routing protocols specifically on MANET. However, the single path is easily broken and needs to perform a route discovery process again due to the dynamic topology of ad hoc networks. To alleviate these problems, a new routing algorithm called ant-based stable disjoint path routing algorithm (ABSDPRA) is proposed. ABSDPRA is based on swarm intelligence and especially on the ant colony based meta heuristic. The proposed algorithm can consider link stability. The introduced routing algorithm is highly adaptive, efficient and scalable. ABSDPRA exploits the concept of a routing protocol called GRID and discover multiple disjoint routing paths with a low routing overhead. Simulation results indicate that ABSDPRA has a higher packet delivery ratio, lower end- to-end delay and lower routing load than AODV.

Published in:

Third International Conference on Natural Computation (ICNC 2007)  (Volume:4 )

Date of Conference:

24-27 Aug. 2007