Orthogonal rendezvous routing protocol for wireless mesh networks

Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number and dynamism complexity of bindings and state needed for this indirection. Routing protocols which do not use such concepts often tend to flood packets during route discovery or dissemination, and hence have limited scalability. In this paper, we introduce Orthogonal Rendezvous Routing Protocol (ORRP) for meshed wireless networks. ORRP is a lightweight-but-scalable routing protocol utilizing directional communications (such as directional antennas or free-space-optical transceivers) to relax information requirements such as coordinate space embedding and node localization. The ORRP source and ORRP destination send route discovery and route dissemination packets respectively in locally-chosen orthogonal directions. Connectivity happens when these paths intersect (i.e., rendezvous). We show that ORRP achieves connectivity with high probability even in sparse networks with voids. ORRP scales well without imposing DHT-like graph structures (eg: trees, rings, torus etc). The total state information required is O(N3/2 for N-node networks, and the state is uniformly distributed. ORRP does not resort to flooding either in route discovery or dissemination. The price paid by ORRP is suboptimality in terms of path stretch compared to the shortest path; however we characterize the average penalty and find that it is not severe.

[1]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[2]  Deborah Estrin,et al.  Rumor routing algorthim for sensor networks , 2002, WSNA '02.

[3]  Takashi Watanabe,et al.  Directional NAV indicators and orthogonal routing for smart antenna based ad hoc networks , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

[4]  Jon Crowcroft,et al.  Landmark guided forwarding , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[5]  Ben Leong,et al.  Path vector face routing: geographic routing with local face information , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[6]  Himabindu Pucha,et al.  Performance comparison of scalable location services for geographic ad hoc routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Xiaoyan Hong,et al.  Landmark routing for large ad hoc wireless networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[8]  Deborah Estrin,et al.  Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table , 2003, Mob. Networks Appl..

[9]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[10]  Murat Yuksel,et al.  An implementation framework for trajectory-based routing in ad-hoc networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[11]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[12]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[13]  B. R. Badrinath,et al.  Trajectory based forwarding and its applications , 2003, MobiCom '03.

[14]  Nitin H. Vaidya,et al.  Impact of Directional Antennas on Ad Hoc Routing , 2003, PWC.

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

[16]  Nitin H. Vaidya,et al.  Performance of ad hoc routing using directional antennas , 2005, Ad Hoc Networks.

[17]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Ram Ramanathan,et al.  On the performance of ad hoc networks with beamforming antennas , 2001, MobiHoc '01.

[19]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[20]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[21]  C. V. Ramamoorthy,et al.  An Adaptive Hierarchical Routing Protocol , 1989, IEEE Trans. Computers.

[22]  Chang Liu,et al.  Building blocks for mobile free-space-optical networks , 2005, Second IFIP International Conference on Wireless and Optical Communications Networks, 2005. WOCN 2005..

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

[24]  Yong Pei,et al.  On the capacity improvement of ad hoc wireless networks using directional antennas , 2003, MobiHoc '03.

[25]  Murat Yuksel,et al.  Free-space-optical mobile ad hoc networks: Auto-configurable building blocks , 2009, Wirel. Networks.

[26]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[27]  B. S. Manoj,et al.  Imposed Route Reuse in Ad Hoc Network Routing Protocols Using Structured Peer-to-Peer Overlay Routing , 2006, IEEE Transactions on Parallel and Distributed Systems.

[28]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[29]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[30]  Robert Tappan Morris,et al.  Architecture and evaluation of an unplanned 802.11b mesh network , 2005, MobiCom '05.

[31]  Nitin H. Vaidya,et al.  Using directional antennas for medium access control in ad hoc networks , 2002, MobiCom '02.

[32]  Murat Yuksel,et al.  Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks , 2009, IEEE/ACM Transactions on Networking.

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