Options
On the Feasibility of DHT Lookup in Ad-Hoc Networks
Auteur(s)
Kummer Raphaël
Date de parution
2006
Résumé
Various peer-to-peer (PIP) 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) for mobile 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. Tire efficiency of our method is demonstrated by simulation of large networks.
Type de publication
Resource Types::text::journal
Dossier(s) à télécharger
