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

Authors:
Raphaël Kummer;Peter Kropf;Pascal Felber
Affiliations:
Computer Science Department, University of Neuchâtel, Neuchâtel, CH, Switzerland;Computer Science Department, University of Neuchâtel, Neuchâtel, CH, Switzerland;Computer Science Department, University of Neuchâtel, Neuchâtel, CH, Switzerland
Venue:
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Year:
2006

Citing 13
Cited 7

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks

Wireless Networks
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
P-Grid: a self-organizing structured P2P system

ACM SIGMOD Record
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks

WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
CHR: A Distributed Hash Table for Wireless Ad Hoc Networks

ICDCSW '05 Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS) (ICDCSW'05) - Volume 04
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks

P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
GRACE: Enabling collaborations in wide-area distributed systems

WETICE '05 Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise
DHT-based Unicast for Mobile Ad Hoc Networks

PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks

IEEE Journal on Selected Areas in Communications

Building multicast trees in ad-hoc networks

Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
Freemote emulator: a lightweight and visual Java emulator for WSN

WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications
An overlay maintenance protocol for overlay routing on top of ad hoc networks

NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
An efficient structured P2P overlay over MANET

Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
A new cross-layer unstructured P2P file sharing protocol over mobile ad hoc network

AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
A cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network

Ad Hoc Networks
Cloud service: automatic construction and evolution of software process problem-solving resource space

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.