A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Analysis of a Location Service for Position-Based Routing in Mobile Ad Hoc Networks
Mobile Ad-Hoc Netzwerke, 1. deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002
Geographic routing for wireless networks
Geographic routing for wireless networks
LLS: a locality aware location service for mobile ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Analysis of GHT in mobile ad hoc networks
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Many location services have been proposed, but some challenges remain. In this paper, we present a new location service, named HTL (Hash Table Localized) to solve the locality problem, that in a location service, the location information can be stored potentially far away from both the source and destination nodes, even when the source and destination nodes are close. As a result, it causes high overhead in update and query. HTL uses a double index hash function to map a node to a location in the network area called the virtual coordination of that node. Then, a novel method is employed to divide the physical space into lattices. The publish and query algorithms are designed based on this division. In HTL, when the distance between the source and destination nodes is l, the cost of query is O(l2). We define this property as n2-locality bounded. HTL is the location service that achieves this property with the least storage and network overhead. Both analysis and experiment results are presented in this paper concerned with the cost, the locality bounded property and the scalability.