MADPastry: A DHT Substrate for Practicably Sized MANETs

As mobile ad hoc networks (MANETs) become ever more popular, it also becomes more and more interesting to build distributed network applications that one is accustomed to from the Internet on top of MANETs. In the Internet, Distributed Hash Tables (DHTs) have recently proven themselves an efficient building block for such distributed applications. However, DHTs are ill-suited for direct deployment in MANETs as they are largely oblivious of the physical routing. Therefore, we propose MADPastry, a DHT substrate explicitly designed for the use in MANETs. MADPastry considers physical locality and integrates the functionality of a DHT and an ad hoc routing protocol at the network layer to provide an efficient indirect routing primitive in MANETs. To answer the fundamental question whether the extra overhead of maintaining a DHT in MANETs is really worth the effort or, instead, one would be better off broadcasting the actual lookups in the first place, we compare MADPastry's performance against an unstructured Gnutella-style broadcast agent and a DHT substrate without locality awareness.

[1]  Joseph P. Macker,et al.  Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations , 1999, RFC.

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

[3]  Jochen H. Schiller,et al.  DHT-based unicast for mobile ad hoc networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[4]  Franca Delmastro.  From Pastry to CrossROAD: CROSS-layer ring overlay for ad hoc networks , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[5]  T. Znati,et al.  PeerNet: a peer-to-peer framework for service and application deployment in MANETs , 2006, 2006 1st International Symposium on Wireless Pervasive Computing.

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

[7]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

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

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

[10]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[11]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

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

[13]  Himabindu Pucha,et al.  Ekta: an efficient DHT substrate for distributed applications in mobile ad hoc networks , 2004, Sixth IEEE Workshop on Mobile Computing Systems and Applications.

[14]  Rolf Winter,et al.  Random landmarking in mobile, topology-aware peer-to-peer networks , 2004, Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004..

[15]  Himabindu Pucha,et al.  Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks , 2003, HotOS.

[16]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[17]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[18]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

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

[20]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[21]  Miguel Castro,et al.  SCRIBE: The Design of a Large-Scale Event Notification Infrastructure , 2001, Networked Group Communication.

[22]  Alan E. Mislove,et al.  POST: A decentralized platform for reliable collaborative applications , 2005 .

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

[24]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[25]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[26]  P. Kumar,et al.  Capacity of Ad Hoc Wireless Networks , 2002 .

[27]  Antony I. T. Rowstron,et al.  PAST: a large-scale, persistent peer-to-peer storage utility , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[28]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[29]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[30]  Christian Schindelhauer,et al.  Peer-to-Peer- Netzwerke , 2006 .

[31]  Marcel Waldvogel,et al.  Efficient topology-aware overlay network , 2003, CCRV.

[32]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[33]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[34]  Peter Druschel,et al.  Exploiting network proximity in peer-to-peer overlay networks , 2002 .