A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Scalable routing protocol for ad hoc networks
Wireless Networks
LLS: a locality aware location service for mobile ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Multi-Home Region Location Service for Wireless Ad Hoc Networks: An Adaptive Demand-Driven Approach
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
MLS: an efficient location service for mobile ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Hierarchical adaptive location service protocol for mobile ad hoc network
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Cost-effective multiperiod spraying for routing in delay-tolerant networks
IEEE/ACM Transactions on Networking (TON)
Model and Protocol for Energy-Efficient Routing over Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Hi-index | 0.00 |
Location-based routing protocols are stateless since they rely on position information in forwarding decisions. However, their efficiency depends on performance of location services which provide the position information of the desired destination node. Several location service schemes have been proposed, but the most promising among them, hierarchical hashing-based protocols, rely on intuitive design in the published solutions. In this paper, we provide full analysis of the efficiency of routing in hierarchical hashing-based protocols as a function of the placement of the routers. Based on the theoretical analysis of the gain and costs of the query and reply routing, we propose a novel location service protocol that optimizes the distance traveled by the location update and query packets and, thus, reduces the overall energy cost. These gains are further increased in the second presented protocol by the optimal location of servers that we established through analysis of geometrical relationships between nodes and location servers. Simulation results demonstrate that the proposed protocols achieve around 30-35% energy efficiency while improving or maintaining the query success rate in comparison to the previously proposed algorithms.