This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Imposed Route Reuse in Ad Hoc Network Routing Protocols Using Structured Peer-to-Peer Overlay Routing
December 2006 (vol. 17 no. 12)
pp. 1452-1467

Abstract—One of the most effective approaches to reducing the routing overhead in mobile ad hoc network routing protocols is to reuse routes discovered for one packet to deliver as many other packets as possible. Numerous techniques have been developed to facilitate route reuse, including caching, overhearing, using partial routes, and replying to route discovery with cached routes. We term such reuses natural reuse, as they are passive techniques and do not cause any detour in routing data packets. In this paper, we propose the Dynamic P2P Source Routing (DPSR) protocol which imposes additional reuse of routes by exploiting the synergy between mobile ad hoc networks and peer-to-peer overlay networks. By imposing reuse of a route to a faraway common destination node among a set of nearby source nodes using localized communication, DPSR limits the number of the source routes that each node has to discover to O(log N), in contrast to the maximum of N source routes per node in DSR, where N is the number of nodes in the network. Our detailed simulations show that DPSR reduces the routing overhead significantly from imposed route reuse when many nodes communicate with one or a few other nodes. Obtaining the maximum benefit from imposed route reuse, however, requires sustaining traffic patterns beyond the capacity of current ad hoc networks. We conjecture that the full potential of DPSR will manifest as the capacity of ad hoc networks increases in the future from advances in physical layer technologies.

[1] A.D. Amis, R. Prakash, T.H. Vuong, and D.T. Huynh, “Max-Min D-Cluster Formation in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, Mar. 2000.
[2] S. Banerjee and S. Khuller, “A Clustering Scheme for Hierarchical Control in Multi-Hop Wireless Networks.” Proc. IEEE INFOCOM, Apr. 2001.
[3] S. Basagni, “Distributed and Mobility-Adaptive Clustering for Multimedia Support in Multi-Hop Wireless Networks,” Proc. IEEE Vehicular Technology Conf., Fall 1999.
[4] L. Breslau et al., “Advances in Network Simulation” Computer, vol. 33, no. 5, pp. 59-67, May 2000.
[5] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols.” Proc. ACM MobiCom, Oct. 1998.
[6] M. Castro, P. Druschel, C. Hu, and A. Rowstron, “Exploiting Network Proximity in Distributed Hash Tables,” Proc. Int'l Workshop Future Directions in Distributed Computing (FuDiCo), June 2002.
[7] M. Castro, P. Druschel, Y.C. Hu, and A. Rowstron, “Exploiting Network Proximity in Peer-to-Peer Overlay Networks,” Technical Report MSR-TR-2002-82, 2002.
[8] F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, “Wide-Area Cooperative Storage with CFS,” Proc. ACM Symp. Operating Systems Principles (SOSP), Oct. 2001.
[9] S.R. Das, C.E. Perkins, and E.M. Royer, “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks,” Proc. IEEE INFOCOM, Mar. 2000.
[10] FIPS 180-1 Secure Hash Standard, Technical Report Publication 180-1, Federal Information Processing Standard (FIPS), NIST, US Dept. of Commerce, Washington D.C., Apr. 1995.
[11] V. Gambiroza, B. Sadeghi, and E.W. Knightly, “End-to-End Performance and Fairness in Multihop Wireless Backhaul Networks,” Proc. ACM MobiCom, 2004.
[12] M. Gerla and J.T.-C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” Wireless Networks, vol. 1, no. 3, pp. 255-265, 1995.
[13] K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, “The Impact of DHT Routing Geometry on Resilience and Proximity.” Proc. ACM SIGCOMM, Aug. 2003.
[14] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[15] S. Gwalani, E.M. Belding-Royer, and C.E. Perkins, “AODV-PA: AODV with Path Accumulation,” Proc. Next Generation Internet Symp., May 2003.
[16] Z.J. Haas and M.R. Pearlman, “The Performance of Query Control Schemes for the Zone Routing Protocol,” Proc. ACM SIGCOMM, Aug. 1998.
[17] Y.C. Hu, S.M. Das, and H. Pucha, “Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks,” Proc. Workshop Hot Topics in Operating Systems (HotOS-IX), May 2003.
[18] Y.-C. Hu and D.B. Johnson, “Caching Strategies in On-Demand Routing Protocols for Wireless Ad Hoc Networks,” Proc. ACM MobiCom, Aug. 2000.
[19] D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks. Kluwer Academic, 1996.
[20] S.-J. Lee and M. Gerla, “AODV-BR: Backup Routing in Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), Sept. 2000.
[21] J. Li, C. Blake, D.S.D. Couto, H.I. Lee, and R. Morris, “Capacity of Ad Hoc Wireless Networks.” Proc. ACM MobiCom, Mar. 2001.
[22] D. Marco, E. Duarte-Melo, M. Liu, and D.L. Neuhoff, “On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of its Data,” Proc. Int'l Workshop Information Processing in Sensor Networks (IPSN), Apr. 2003.
[23] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM, Apr. 1997.
[24] G. Pei, M. Gerla, and X. Hong, “LANMAR: Landmark Routing for Large Scale Wireless Ad Hoc Networks with Group Mobility,” Proc. IEEE/ACM MobiHoc, Aug. 2000.
[25] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM, Aug. 1994.
[26] C.E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. IEEE Workshop Mobile Computing Systems and Applications (WMCSA), Feb. 1999.
[27] J. Raju and J. Garcia-Luna-Aceves, “Scenario-Based Comparison of Source-Tracing and Dynamic Source Routing Protocols for Ad Hoc Networks,” ACM Computer Comm. Rev., Oct. 2001.
[28] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM, Aug. 2001.
[29] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. Middleware Conf., Nov. 2001.
[30] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications.” Proc. ACM SIGCOMM, Aug. 2001.
[31] P.F. Tsuchiya, “The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks,” Proc. ACM SIGCOMM, Aug. 1988.
[32] J. Yoon, M. Liu, and B. Noble, “Random Waypoint Considered Harmful,” Proc. IEEE INFOCOM, Apr. 2003.
[33] J. Yoon, M. Liu, and B. Noble, “Sound Mobility Models.” Proc. ACM MobiCom, Sept. 2003.
[34] X. Zeng, R. Bagrodia, and M. Gerla, “Glomosim: A Library for Parallel Simulation of Large-Scale Wireless Networks,” Proc. Parallel and Distributed Simulations Workshop (PADS), May 1998.
[35] B.Y. Zhao, J.D. Kubiatowicz, and A.D. Joseph, “Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing,” Technical Report UCB//CSD-01-1141, Univ. of California Berkeley, Apr. 2001.
[36] IEEE 802.15 WPAN High Rate Alternative PHY Task Group 3a, http://www.ieee802.org/15/pubTG3a.html, 2006.

Index Terms:
Wireless communication, network protocols, routing protocols, wireless.
Citation:
Himabindu Pucha, Saumitra M. Das, Y. Charlie Hu, "Imposed Route Reuse in Ad Hoc Network Routing Protocols Using Structured Peer-to-Peer Overlay Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 12, pp. 1452-1467, Dec. 2006, doi:10.1109/TPDS.2006.174
Usage of this product signifies your acceptance of the Terms of Use.