Using Ant-Like Agents for Fault-Tolerant Routing in Mobile Ad-Hoc Networks

被引:0
作者
Misra, Sudip [1 ]
Dhurandher, Sanjay K. [2 ]
Obaidat, Mohammad S. [3 ]
Verma, Karan [4 ]
Gupta, Pushkar [4 ]
机构
[1] Indian Inst Technol Kharagpur, Sch Informat Technol, Kharagpur, W Bengal, India
[2] Univ Delhi, Netaji Subhas Inst Technol, Div Informat Technol, CAITFS, New Delhi, India
[3] Monmouth Univ, Dept Comp Sci, West Long, NJ USA
[4] Univ Delhi, Netaji Subhas Inst Technol, Div Informat Technol, New Delhi, India
来源
2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8 | 2009年
关键词
fault-tolerant routing; ant colony optimization; ad-hoc networks;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The fault-prone nodes in mobile ad-hoc networks (MANETs) degrade the performance of any routing protocol. Using greedy routing mechanisms that tend to choose a single path every time, may cause major data losses, if there is a breakdown of such a path in a fault-prone environment. On the other hand, using all the available paths causes an undesirable amount of overhead on the system. Designing an effective and efficient fault-tolerant routing protocol is inherently hard, since the problem is NP-complete, due to the unavailability of precise path information in adversarial environments [1]. To address the challenges of effective fault-tolerant routing, we present a fault-tolerant routing algorithm (FTAR), based on the ideas of how swarms of natural ants operate[2]. The algorithm is divided into various stages namely initialization, path selection, pheromone deposition, confidence calculation, evaporation and negative reinforcement. Simulation results show that FTAR achieves high packet delivery ratio and throughput as compared to some of the key protocols which do not do fault-tolerance at all. Most importantly, FTAR beats the best fault-tolerant MANET routing algorithm [1] known currently, with respect to the amount of routing overhead incurred, which is an important consideration.
引用
收藏
页码:4767 / +
页数:2
相关论文
共 10 条
[1]  
[Anonymous], GLOMOSIM SIMULATOR
[2]  
[Anonymous], LNCS
[3]   AntNet: Distributed stigmergetic control for communications networks [J].
Di Caro, G ;
Dorigo, M .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1998, 9 :317-365
[4]   Ant algorithms for discrete optimization [J].
Dorigo, M ;
Di Caro, G ;
Gambardella, LM .
ARTIFICIAL LIFE, 1999, 5 (02) :137-172
[5]  
DUCATELLE F, 2004, IDSIA27042004
[6]  
GUNES M, 2002, P INT WORKSH AD HOC
[7]  
GUNTSCH M, 2003, HDB BIOINSPIRED ALGO, P41
[8]  
Johnson DB., 1996, MOBILE COMPUTING, P153, DOI [DOI 10.1007/978-0-585-29603-65, 10.1007/978-0-585-29603-6_5, DOI 10.1007/978-0-585-29603-6_5]
[9]  
Oommen BJ, 2006, WIMOB 2006: 2ND IEEE INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS, PROCEEDINGS, P31
[10]  
Xue Y, 2003, IEEE WCNC, P1174