Distributed Lookup in Structured Peer-to-Peer Ad-Hoc Networks [chapter]

Raphaël Kummer, Peter Kropf, Pascal Felber
2006 Lecture Notes in Computer Science  
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
more » ... ity of peers when establishing and maintaining the DHT based routing tables. The efficiency of our method is demonstrated by simulation of large networks. Related Work Peer-to-peer overlays have emerged from file sharing applications on top of the Internet, leveraging from its routing infrastructure and the intrinsic peer-to-peer property of the IP protocol. As already discussed in Section 1, the situation is different in the case an ad-hoc networks. In particular, the DHT paradigm with
doi:10.1007/11914952_37 fatcat:xqim5qxq6rhhddkhwzh4lq3sy4