PROSE: Scalable Routing in MANETs Using Prefix Labels and Distributed Hashing

We introduce the Prefix Routing Over Set Elements (PROSE) protocol for scalable routing in MANETs based on the combined use of prefix labels and distributed hashing. In PROSE, nodes use neighbor-to-neighbor signaling to label themselves with prefix labels that provide implicit routing from any node to any network destination. Nodes implement a distributed hash table to store the mappings between node identifiers (e.g., a MAC or IP address) and their prefix labels. Destinations publish their existence and sources subscribe to their intended destinations. We show that PROSE provides correct routing based on prefix labels and that its signaling overhead grows sub-linearly with the network size. We present simulation and testbed results that illustrate the benefits of PROSE compared to traditional MANET routing protocols.

[1]  Tarek F. Abdelzaher,et al.  A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks , 2004, RTSS.

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

[3]  Mario Gerla,et al.  Fisheye state routing: a routing scheme for ad hoc wireless networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[4]  P. R. Kumar,et al.  Critical power for asymptotic connectivity , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[5]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[6]  S.V. Krishnamurthy,et al.  DART: Dynamic Address RouTing for Scalable Ad Hoc and Mesh Networks , 2007, IEEE/ACM Transactions on Networking.

[7]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

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

[9]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[10]  Hao Jiang,et al.  Why is the internet traffic bursty in short time scales? , 2005, SIGMETRICS '05.

[11]  Serge Fdida,et al.  An Underlay Strategy for Indirect Routing , 2004, Wirel. Networks.

[12]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[13]  David Hutchison,et al.  Scalable Bloom Filters , 2007, Inf. Process. Lett..

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

[15]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[16]  Ram Ramanathan,et al.  Making link-state routing scale for ad hoc networks , 2001, MobiHoc '01.

[17]  Xingde Jia,et al.  Wireless networks and random geometric graphs , 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..

[18]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[19]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[20]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

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

[22]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

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