Location independent compact routing for wireless networks

While reactive routing protocols such as AODV operate efficiently for small ad hoc wireless networks, their O(N) perflow control overhead limits deployment on larger-scale networks. Deployment of compact routing protocols such as geographic routing have met with challenges. In this paper, we present Table Attenuation Routing Protocol (TARP), a protocol that combines compact per-node routing state with scalability to large networks. Preliminary evaluation shows that TARP performs similar to AODV in smaller networks and better in larger networks.

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

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

[3]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[4]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

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

[6]  Robert Tappan Morris,et al.  Geographic Routing Without Planarization , 2006, NSDI.

[7]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[8]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[9]  Evaggelia Pitoura,et al.  Speeding-up Cache Lookups in Wireless Ad-Hoc Routing using Bloom Filters , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

[10]  David E. Culler,et al.  Beacon vector routing: Scalable point-to-point in wireless sensornets , 2004 .

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

[12]  Xiaoyan Hong,et al.  LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[13]  John Kubiatowicz,et al.  Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  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.

[15]  Ben Y. Zhao,et al.  Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.

[16]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[17]  Xiaoyan Hong,et al.  LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility , 1988, MobiHoc.

[18]  Antony I. T. Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM.

[19]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[20]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[21]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .