ACM Home Page
Please provide us with feedback. Feedback
Orthogonal rendezvous routing protocol for wireless mesh networks
Full text PdfPdf (1.87 MB)
Source IEEE/ACM Transactions on Networking (TON) archive
Volume 17 ,  Issue 2  (April 2009) table of contents
Pages 542-555  
Year of Publication: 2009
ISSN:1063-6692
Authors
Bow-Nan Cheng  MIT Lincoln Laboratory, Lexington, MA and Rensselaer Polytechnic Institute, Troy, NY
Murat Yuksel  Computer Science and Engineering Department, University of Nevada at Reno, Reno, NV and Rensselaer Polytechnic Institute, Troy, NY
Shivkumar Kalyanaraman  IBM India Research Laboratory, Bangalore and Rensselaer Polytechnic Institute, Troy, NY
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 42,   Downloads (12 Months): 111,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: 10.1109/TNET.2008.926511

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
4
5
6
7
 
8
 
9
 
10
 
11
R. R. Choudhury and N. Vaidya, "Impact of directional antennas on ad hoc routing," presented at the 8th Int. Conf. Personal Wireless Communication (PWC), Venice, Italy, Sep. 2003.
12
13
 
14
M. Yuksel, J. Akella, S. Kalyanaraman, and P. Dutta, "Free-space-optical mobile ad hoc networks: auto-configurable building blocks," ACM/Springer Wireless Networks, 2008, to be published.
15
16
 
17
D. Niculescu and B. Nath, "Ad hoc positioning system (APS) using AoA," presented at the IEEE INFOCOM, San Francisco, CA, 2003.
 
18
M. Gerla, X. Hong, and G. Pei, "Landmark routing for large ad hoc wireless networks," in Proc. IEEE GLOBECOM, Nov. 2000, pp. 1702-1706.
 
19
ns-2--The Network Simulator. [Online]. Available: http://www.isi. edu/nsnam/ns
 
20
MuniWireless. [Online]. Available: http://www.muniwireless.com/
21
 
22
S. M. Das, H. Pucha, and Y. C. Hu, "Performance comparison of scalable location services for geographic ad hoc routing," presented at the IEEE INFOCOM, Miami, FL, 2005.
 
23
T. Clausen and P. Jacquet, "OLSR," RFC 3626, Oct. 2003 [Online]. Available: http://ietf.org/rfc/rfc3626.txt
 
24
B. Chen and R. Morris, "L+: scalable landmark routing and address lookup for multi-hop wireless networks," MIT LCS, Cambridge, MA, Tech. Rep. 837, Mar. 2002.
 
25
 
26
Z. Haas, J. Pearlman, and P. Samar, "The zone routing protocol (ZRP) for ad hoc networks," IETF Internet Draft, Jul. 2002.
27
 
28
29
 
30
R. R. Choudhury and N. Vaidya, "Performance of ad hoc routing using directional antennas," Ad Hoc Networks, vol. 3, no. 2, pp. 157-173, Mar. 2005.
 
31
32
33
 
34

Collaborative Colleagues:
Bow-Nan Cheng: colleagues
Murat Yuksel: colleagues
Shivkumar Kalyanaraman: colleagues