A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual 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
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Randomized location service in mobile ad hoc networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
Interactive View-Dependent Rendering with Conservative Occlusion Culling in Complex Environments
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
SFG: smart flooding by gossiping
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
MLS: an efficient location service for mobile ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Locating mobile nodes with EASE: learning efficient routes from encounter histories alone
IEEE/ACM Transactions on Networking (TON)
Double rulings for information brokerage in sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
On the scalability of rendezvous-based location services for geographic wireless ad hoc routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Characteristics of common mobility models for opportunistic networks
Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
Hash-Based Virtual Hierarchies for Scalable Location Service in Mobile Ad-hoc Networks
Mobile Networks and Applications
Phero-trail: a bio-inspired location service for mobile underwater sensor networks
IEEE Journal on Selected Areas in Communications
DFLS: a new distributed and fault tolerant location service method for mobile ad hoc networks
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Understanding node localizability of wireless ad-hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A Beacon-Less Geographic Multipath Routing Protocol for Ad Hoc Networks
Mobile Networks and Applications
Hi-index | 0.00 |
In mobile ad hoc networks, a location service (LS) provides the fundamental service for geographical routing. However, most existing schemes for location service incur a high overhead because of the periodic updates of location information. To address this issue, we propose a novel History information based Light Location Service (HLLS), using the temporal relationship among historical locations of mobile nodes in the network. In HLLS, location information of mobile nodes is propagated by Hello beacons locally, and the location query is performed with the aid of historical locations. In this way, HLLS can eliminate the tremendous periodical location updates and significantly reduce the overhead for location service. Using a combination of analytical modeling and extensive simulations, we show the effectiveness of HLLS in comparison with other approaches.