Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Data structures for mobile data
Journal of Algorithms
Kinetic collision detection between two simple polygons
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic connectivity for unit disks
Proceedings of the sixteenth annual symposium on Computational geometry
Collision detection for deforming necklaces
Proceedings of the eighteenth annual symposium on Computational geometry
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Deformable spanners and applications
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Proceedings of the 10th annual international conference on Mobile computing and networking
Load-Balanced Short-Path Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Deformable spanners and applications
Computational Geometry: Theory and Applications
Proximity detection in distributed simulation of wireless mobile systems
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Clustering-based control of discrimination power in target tracking applications
ICAI'06 Proceedings of the 7th WSEAS International Conference on Automation & Information
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Asynchronous contact mechanics
ACM SIGGRAPH 2009 papers
Deformable spanners and applications
Computational Geometry: Theory and Applications
Localized spanner construction for ad hoc networks with variable transmission range
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
We present an efficient distributed data structure, called the d-Spanner, for maintaining proximity information among communicating mobile nodes. The d-Spanner is a kinetic sparse graph spanner on the nodes that allows each node to quickly determine which other nodes are within a given distance of itself, to estimate an approximate nearest neighbor, and to perform a variety of other proximity related tasks. A lightweight and fully distributed implementation is possible, in that maintenance of the proximity information only requires each node to exchange a modest number of messages with a small number of mostly neighboring nodes. The structure is based on distance information between communicating nodes that can be derived using ranging or localization methods and requires no additional shared infrastructure other than an underlying communication network. Its modest requirements make it scalable to networks with large numbers of nodes.