Advertisement
Published in:
2006 | OriginalPaper | Chapter
Distributed Lookup in Structured Peer-to-Peer Ad-Hoc Networks
Authors : Raphaël Kummer, Peter Kropf, Pascal Felber
Published in: On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.