Login
Distributed lookup in structured peer-to-peer ad-hoc networks

Raphael Kummer, Peter Kropf & Pascal Felber

Résumé Various peer-to-peer (P2P) architectures for ad-hoc networks have been proposed over the last few years. Most of them are unstructured and use some form of flooding to locate content, because the physical constraints of the underlying network make the construction of arbitrary application-layer overlays impractical. In this paper, we study the problem of applying distributed hash tables (DHT) to ad-hoc networks. Our approach to efficiently lookup content in such networks exploits physical proximity of peers when establishing and maintaining the DHT based routing tables. The efficiency of our method is demonstrated by simulation of large networks.
   
Mots-clés
   
Citation R. Kummer, et al., "Distributed lookup in structured peer-to-peer ad-hoc networks," in On the Move Confederated International Conference on CoopIS/DOA/GADA, and ODBASE, Montpellier, FRANCE, 2006, p. 1541-1554.
   
Type Actes de congrès (Anglais)
Editeur Robert Meersman, Zahir Tari
Nom de la conférence On the Move Confederated International Conference on CoopIS/DOA/GADA, and ODBASE (Montpellier, FRANCE)
Date de la conférence 2006
Editeur commercial Springer-Verlag Berlin
Pages 1541-1554
URL http://dx.doi.org/10.1007/11914952_37