A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
Energy-Aware Web Caching for Mobile Terminals
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Consistency mechanisms for a distributed lookup service supporting mobile applications
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Locating cache proxies in manets
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
LLS: a locality aware location service for mobile ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
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
Service Discovery in Mobile Ad Hoc Networks: A Field Theoretic Approach
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Efficient lookup on unstructured topologies
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Ad Hoc Networking
RINGS: lookup service for peer-to-peer systems in mobile ad-hoc networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Hi-index | 0.00 |
Finding data items is one of the most basic services of any distributed system. It is particular challenging in ad-hoc networks, due to their inherent decentralized nature and lack of infrastructure. A data location service (DLS) provides this capability. This paper presents 3DLS, a novel density driven data location service. 3DLS is based on performing biased walks over a density based virtual topography. 3DLS also includes an autonomic dynamic configuration mechanism for adapting the lengths of the walks, in order to ensure good performance in varying circumstances and loads. This is without any explicit knowledge of the network characteristics, such as size, mobility speed, etc. Moreover, 3DLS does not rely on geographical knowledge, its decisions are based only on local information, it does not invoke multi-hop routing, and it avoids flooding the network. The paper includes a detailed performance study of 3DLS, carried by simulations, which compares 3DLS to other known approaches. The simulations results validate the viability of 3DLS.