GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Dynamic Queries over Mobile Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
GeoPeer: A Location-Aware Peer-to-Peer System
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries
IEEE Transactions on Mobile Computing
GeoGrid: A Scalable Location Service Network
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Managing cohort movement of mobile sensors via GPS-free and compass-free node localization
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
As the proliferation of mobile devices and positioning systems continues unabated, the need to provide more robust location-based services becomes more pressing. In this context, we examine the problem of efficiently handling queries over moving objects and propose a location-aware overlay network that helps monitoring such objects while traversing contained geographic extends. We use a triangulation structure to divide a geographic area using fixed service nodes as anchors based on their geographic position. Triangulation inherently contains each moving object within an area designated by three service nodes. We introduce a method for monitoring moving objects and we present an algorithm for processing nearest-neighbor queries while restricting the amount of resources and, subsequently, the volume of transmitted messages. Through simulation, we evaluate the suggested approach and show that our nearest-neighbor query processing method provides always accurate results while it uses invariantly a constant number of service nodes. We finally show that the average physical distance between service and roaming nodes remains limited; this yields a significant number of physical connections that avoid conventional Internet routing altogether.