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 ...

• Type: Conference
• Year: 2006
• Where: ICNP
• Authors: Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanaraman
• Keywords: Coordinate Space Embedding, ICNP 2006, Network Protocols, Route Discovery, Routing Protocol