Adapting distributed hash tables for mobile ad hoc networks

While unstructured P2P systems have been embraced widely in mobile ad-hoc networks (MANETs), the applicability of structured approaches like distributed hash tables (DHTs) to such settings remains controversial. Existing research delivers promising empirical results addressing the concerns about performance, complexity, and reliability, but does not analyze the principles of combining DHTs and MANETs. This paper identifies and discusses the fundamental implications of non-infrastructural networks for DHTs and analyzes solutions to these challenges

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

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

[3]  Thomas Kunz,et al.  On-demand multicasting in ad-hoc networks:comparing AODV and ODMRP , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[4]  Himabindu Pucha,et al.  How to Implement DHTs in Mobile Ad Hoc Networks , 2004 .

[5]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[6]  Klaus Wehrle,et al.  Peer-to-Peer Systems and Applications , 2005, Peer-to-Peer Systems and Applications.

[7]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

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

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