Paper Info
Title
Ant-based Energy-aware Disjoint Multipath Routing Algorithm for MANETs
Abstract
Ant-based routing protocols for mobile ad hoc networks (MANETs) have been widely explored, but most of them are essentially single-path routing methods that tend to impose a heavy burden on the hosts along the shortest path from source to destination. In this paper, we combine swarm intelligence and node-disjoint multipath routing to alleviate these problems. A novel approach called ant-based energy-aware disjoint multipath routing algorithm (AEADMRA) is proposed. AEADMRA is based on swarm intelligence and especially on the ant colony-based meta heuristic. AEADMRA can discover multiple energy-aware node-disjoint routing paths with a low routing overhead. Simulation results indicate that the performance of AEADMRA outperforms other pertinent algorithms.
Year
DOI
Venue
2010
10.1093/comjnl/bxn007
Comput. J.
Keywords
Field
DocType
routing algorithm,novel approach,node-disjoint multipath,single-path routing method,swarm intelligence,low routing overhead,ant colony-based meta heuristic,ant-based energy-aware disjoint multipath,multiple energy-aware node-disjoint,heavy burden,energy-aware disjoint multipath,ant-based routing protocol,multipath routing
Multipath routing,Link-state routing protocol,Equal-cost multi-path routing,Dynamic Source Routing,Computer science,Static routing,Policy-based routing,Computer network,Destination-Sequenced Distance Vector routing,Algorithm,Wireless Routing Protocol,Distributed computing
Journal
Volume
Issue
ISSN
53
2
0010-4620
Citations 
PageRank 
References 
4
0.46
0
Authors
2
Name
Order
Citations
PageRank
Zhengyu Wu1244.11
Han-Tao Song2406.18