Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing

被引:34
作者
Valera, AC [1 ]
Seah, WKG [1 ]
Rao, SV [1 ]
机构
[1] Inst Infocomm Res, Commun & Devices Div, Singapore 117674, Singapore
关键词
routing protocols; algorithm/protocol design and analysis;
D O I
10.1109/TMC.2005.67
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new routing protocol named CHAMP (CacHing And Multiple Path) routing protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic.
引用
收藏
页码:443 / 457
页数:15
相关论文
共 42 条
[21]  
*IEEE, 1997, 802111997 IEEE COMP
[22]  
Jacquet P., Optimized link state routing protocol for ad hoc networks
[23]  
Johnson D. B., 1996, Mobile Comput., P153
[24]  
KRISHNAN R, 1993, IEEE INFOCOM SER, P322, DOI 10.1109/INFCOM.1993.253345
[25]  
LEE S, 2000, P IEEE WIR COMM NETW
[26]  
LEE SJ, 1999, P IEEE PIMRC 99 SEPT, P297
[27]   On-demand multipath distance vector routing in ad hoc networks [J].
Marina, MK ;
Das, SR .
NETWORK PROTOCOLS, 2001, :14-23
[28]  
MILUTINOVIC V, 2000, IEEE CONCURRENCY, P2
[29]  
*MON PROJ, 2001, RIC MON PROJ MOB NET
[30]  
Murthy S., 1996, Journal of Special Topics in Mobile Networks and Applications (MONET), V1, P183, DOI 10.1007/BF01193336