Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
Name
Cheng-2009-Orthogonal Rendezvou.pdf
Size
1.78 MB
Format
Adobe PDF
Checksum (MD5)
c3946f4cc3807a8f5f23d8e60c2f5a68
Author(s)
Cheng, Bow-Nan
Yuksel, Murat
Kalyanaraman, Shivkumar
Date Issued
April 2009
Journal
IEEE/ACM Transactions on Networking
Publisher
Institute of Electrical and Electronics Engineers and Association for Computing Machinery
Citation
Bow-Nan Cheng, M. Yuksel, and S. Kalyanaraman. “Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks.” Networking, IEEE/ACM Transactions on 17.2 (2009): 542-555. © 2009 Institute of Electrical and Electronics Engineers
Version
Final published version
Abstract
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.
Subjects
wireless routing protocol
free-space-optics
free-space-optics
directional antennas
MIT Department
Lincoln Laboratory
Terms of Use
Article is made available in accordance with the publisher’s policy and may be subject to US copyright law. Please refer to the publisher’s site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1109/TNET.2008.926511
