Paper Info
Title
Ant-Based Stable Disjoint Path Routing Algorithm in Wireless Ad Hoc Networks
Abstract
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.
Year
DOI
Venue
2007
10.1109/ICNC.2007.243
ICNC
Keywords
Field
DocType
routing algorithm,mobile ad,ant colony,lower end-to,low routing overhead,ant-based stable disjoint path,new routing algorithm,wireless ad hoc networks,earlier research,proposed algorithm,lower routing load,routing protocol,stable disjoint path routing,wireless ad hoc network,mobile ad hoc network,base station,swarm intelligence,routing protocols,end to end delay,ad hoc networks,ad hoc network,manet
Link-state routing protocol,Equal-cost multi-path routing,Dynamic Source Routing,Static routing,Computer science,Computer network,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Optimized Link State Routing Protocol,Zone Routing Protocol,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2875-9
0
0.34
References 
Authors
4
3
Name
Order
Citations
PageRank
Zhengyu Wu1244.11
Lin Cui272.55
Xiangjun Dong35912.26