This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improving Protocol Robustness in Ad Hoc Networks through Cooperative Packet Caching and Shortest Multipath Routing
September/October 2005 (vol. 4 no. 5)
pp. 443-457
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] C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (dsdv) for Mobile Computers,” Proc. ACM SIGCOMM Conf., pp. 234-244, Aug. 1994.
[2] M.S. Corson and A. Ephremides, “A Distributed Routing Algorithm for Mobile Wireless Networks,” ACM/Baltzer Wireless Networks J., vol. 1, no. 1, pp. 61-82, Feb. 1995.
[3] S. Murthy and J.J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” Mobile Networks and Applications, vol. 1, no. 2, pp. 183-197, 1996.
[4] R. Dube, C. Rais, K.Y. Wang, and S.K. Tripathi, “Signal Stability-Based Adaptive Routing (ssa) for Ad Hoc Mobile Networks,” IEEE Personal Comm., vol. 4, no. 1, pp. 36-45, Feb. 1997.
[5] D. Johnson and D. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, T. Imielinski and H. Korth, eds., pp. 153-181, 1996.
[6] Z. Haas, “A New Routing Protocol for the Recongurable Wireless Networks,” Proc. IEEE Int'l Conf. Universal Personal Comm. Conf., Oct. 1997.
[7] C. Perkins and E. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. IEEE Workshop Mobile Computing Systems and Applications Conf., pp. 90-100, Feb. 1999.
[8] G. Pei, M. Gerla, and T. Chen, “Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks,” Proc. IEEE Int'l Workshop Implicit Computational Complexity, pp. 70-74, June 2000.
[9] P. Jacquet, P. Muhlethaler, A. Qayyum, A. Laouiti, L. Viennot, and T. Clausen, “Optimized Link State Routing Protocol,” draft-ietf-manet-olsr-04.txt, Work in Progress.
[10] J. Broch, D. Maltz, D. Johnson, Y.C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM/IEEE MOBICOM Conf., pp. 85-97, Oct. 1998.
[11] S.J. Lee, C.K. Toh, and M. Gerla, “Performance Evaluation of Table-Driven and On-Demand Ad Hoc Routing Protocols,” Proc. IEEE Symp. Personal, Indoor and Mobile Radio Comm., pp. 297-301, Sept. 1999.
[12] P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark, “Scenario-Based Performance Analysis of Routing Protocols for Mobile Ad-Hoc Networks,” Proc. ACM/IEEE MOBICOM Conf., p. 195-206, 1999.
[13] IEEE std. 802.11-1997, “Wireless Lan Medium Access Protocol (Mac) and Physical Layer (Phy) Specification,” IEEE Computer Soc. LAN MAN Standards Committee, New York, NY, 1997.
[14] M.V. Wilkes, “Slave Memories and Dynamic Storage Allocation,” IEEE Trans. Electronic Computers, vol. 14, pp. 270-271, Apr. 1965.
[15] D. Patterson and J. Hennessy, Computer Architecture, A Quantitative Approach. Morgan Kaufmann, 1996.
[16] R. Castaneda and S. Das, “Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks,” Proc. ACM/IEEE MOBICOM Conf., pp. 186-194, 1999.
[17] S. Das, C. Perkins, and E. Royer, “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks,” Proc. IEEE INFOCOM Conf., pp. 3-12, 2000.
[18] The VINT Project, “The Network Simulator-ns-2,” http://www. isi.edu/nsnamns/, 2001.
[19] The Monarch Project, “Rice Monarch Project: Mobile Networking Architectures,” http:/www.monarch.cs.rice.edu/, 2001.
[20] A. Boukerche, “Performance Comparison and Analysis of Ad Hoc Routing Algorithms,” IEEE Int'l Congress on Pastoral Care and Counselling, pp. 171-178, 2001.
[21] R. Boppana and S. Konduru, “An Adaptive Distance Vector Routing Algorithm for Mobile, Ad Hoc Networks,” Proc. IEEE INFOCOM Conf., Mar. 2001.
[22] B. Tuch, “Development of Wavelan, an ISM Band Wireless Lan,” AT&T Technical J., vol. 72, no. 4, pp. 27-33, 1993.
[23] M. Pearlman, Z. Haas, P. Sholander, and S. Tabrizi, “On the Impact of Alternate Path Routing for Load Balancing in Mobile Ad Hoc Networks,” Proc. ACM MOBIHOC Conf., pp. 3-10, 2000.
[24] S. Das, R. Castaneda, J.T. Yan, and R. Sengupta, “Comparative Performance Evaluation of Routing Protocols for Mobile, Ad Hoc Networks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks, Oct. 1998.
[25] C. Perkins, E. Belding-Royer, and S. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing,” draft-ietf-manet-aodv-12.txt, Work in Progress, 2002.
[26] V. Milutinovic, “Caching in Distributed Systems,” IEEE Concurrency, pp. 2-3, July-Sept. 2000.
[27] A. Valera, K.G. Seah, and S.V. Rao, “Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad Hoc Networks,” Proc. INFOCOM Conf., 2003.
[28] E. Gafni and D. Bertsekas, “Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology,” IEEE Trans. Comm., vol. 29, no. 1, pp. 11-15, Jan. 1981.
[29] M.S. Corson and A. Ephremides, “A Distributed Routing Algorithm for Mobile Radio Networks,” Proc. IEEE Military Comm. Conf. (MILCOM), Oct. 1989.
[30] S. Vutukury and J.J. Garcia-Luna-Aceves, “Mdva: A Distance-Vector Multipath Routing Protocol,” Proc. IEEE INFOCOM Conf., vol. 1, pp. 557-564, 2001.
[31] S. Lee and M. Gerla, “Aodv-br: Backup Routing in Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf., Sept. 2000.
[32] M. Marina and S. Das, “On-Demand Multipath Distance Vector Routing in Ad Hoc Networks,” Proc. IEEE Int'l Conf. Network Protocols, pp. 14-23, 2001.
[33] D. Ganesan, R. Govindan, S. Shenker, and D. Estrin, “Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks,” Proc. ACM MOBIHOC Conf., pp. 251-253, Oct. 2001.
[34] A. Nasipuri and S. Das, “On-Demand Multipath Routing for Mobile Ad Hoc Networks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks, pp. 64-70, Oct. 1999.
[35] G. Holland and N. Vaidya, “Analysis of TCP Performance over Mobile Ad Hoc Networks,” Proc. ACM/IEEE MOBICOM Conf., pp. 219-230, Aug. 1999.
[36] R. Gallager, “A Minimum Delay Routing Algorithm Using Distributed Computation,” IEEE Trans. Comm., vol. 25, pp. 73-84, Jan. 1977.
[37] S. Vutukury and J.J. Garcia-Luna-Aceves, “A Simple Approximation to Minimum-Delay Routing,” Proc. ACM SIGCOMM Conf., pp. 227-238, 1999.
[38] R. Krishnan and J. Silvester, “Choice of Allocation Granularity in Multipath Source Routing Schemes,” Proc. IEEE INFOCOM Conf., pp. 322-329, Mar. 1993.
[39] N. Gogate and S. Panwar, “Assigning Customers to Two Parallel Servers with Resequencing,” IEEE Trans. Comm. Letters, vol. 3, no. 4, p. 119, Apr. 1999.
[40] N. Gogate and S. Panwar, “Supporting Applications in a Mobile Multihop Radio Environment Using Route Diversity,” Proc. IEEE Int'l Workshop Implicit Computational Complexity, June 1998.
[41] E. Blanton and M. Allman, “On Making TCP More Robust to Packet Reordering,” ACM SIGCOMM CCR Conf., vol. 32, pp. 20-30, Jan. 2002.
[42] S. Bohacek, J. Hespanha, J. Lee, C. Lim, and K. Obraczka, “Tcp-pr: Tcp for Persistent Packet Reordering,” Proc. IEEE Int'l Conf. Distributed Computing Systems, p. 222, May 2003.

Index Terms:
Index Terms- Routing protocols, algorithm/protocol design and analysis.
Citation:
Alvin C. Valera, Winston K.G. Seah, S.V. Rao, "Improving Protocol Robustness in Ad Hoc Networks through Cooperative Packet Caching and Shortest Multipath Routing," IEEE Transactions on Mobile Computing, vol. 4, no. 5, pp. 443-457, Sept.-Oct. 2005, doi:10.1109/TMC.2005.67
Usage of this product signifies your acceptance of the Terms of Use.