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

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.

[1]  Satish K. Tripathi,et al.  Signal stability-based adaptive routing (SSA) for ad hoc mobile networks , 1997, IEEE Wirel. Commun..

[2]  Peter E. Sholander,et al.  On the impact of alternate path routing for load balancing in mobile ad hoc networks , 2000, MobiHoc.

[3]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[4]  Samir R. Das,et al.  On-demand multipath routing for mobile ad hoc networks , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[5]  Samir Ranjan Das,et al.  Comparative performance evaluation of routing protocols for mobile, ad hoc networks , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[6]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile radio networks , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.

[7]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[8]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[9]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[10]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[11]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[12]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.

[14]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[15]  A. Boukerche,et al.  Performance comparison and analysis of ad hoc routing algorithms , 2001, Conference Proceedings of the 2001 IEEE International Performance, Computing, and Communications Conference (Cat. No.01CH37210).

[16]  Sung-Ju Lee,et al.  AODV-BR: backup routing in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[17]  N. Gogate,et al.  Supporting applications in a mobile multihop radio environment using route diversity. I. Non-real time data , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[18]  Samir R. Das,et al.  Comparative Performance Evaluation of Routing Protocols for Mobile, Ad hoc. , 1998 .

[19]  Shivendra S. Panwar,et al.  Assigning customers to two parallel servers with resequencing , 1999, IEEE Communications Letters.

[20]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[21]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[22]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[23]  Bruce Tuch,et al.  Development of WaveLAN®, an ISM band wireless LAN , 1993, AT&T Technical Journal.

[24]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[25]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[26]  Ram Krishnan,et al.  Choice of allocation granularity in multipath source routing schemes , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[27]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[28]  Rajendra V. Boppana,et al.  An adaptive distance vector routing algorithm for mobile, ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[29]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[30]  Mario Gerla,et al.  Fisheye state routing: a routing scheme for ad hoc wireless networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[31]  Winston Khoon Guan Seah,et al.  Cooperative packet caching and shortest multipath routing in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[32]  David A. Patterson,et al.  Computer architecture (2nd ed.): a quantitative approach , 1996 .

[33]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[34]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[35]  Maurice V. Wilkes,et al.  Slave Memories and Dynamic Storage Allocation , 1965, IEEE Trans. Electron. Comput..

[36]  Veljko M. Milutinovic.  Caching in distributed systems , 2000, IEEE Concurr..

[37]  João P. Hespanha,et al.  TCP-PR: TCP for persistent packet reordering , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[38]  Nitin H. Vaidya,et al.  Analysis of TCP Performance over Mobile Ad Hoc Networks , 1999, Wirel. Networks.

[39]  Samir Ranjan Das,et al.  Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks , 1999, Wirel. Networks.

[40]  Mark Allman,et al.  On making TCP more robust to packet reordering , 2002, CCRV.

[41]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[42]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..