The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (2007)
Toronto, Canada
June 25, 2007 to June 27, 2007
ISBN: 0-7695-2837-3
pp: 1
Nancy Lynch , MIT CSAIL
Tina Nolte , MIT CSAIL
<p>We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, consisting of mobile clients, virtual timed machines distributed at known locations in the plane, called virtual stationary automata (VSAs), and a communication service connecting VSAs and mobile clients.</p> <p>VINESTALK maintains a data structure on top of an underlying hierarchical partitioning of the network. In a grid partitioning, operations to find a mobile object distance d away take O(d) time and communication to complete. Updates to the tracking structure after the object has moved a total of d distance take O(d . log network diameter) amortized time and communication to complete. The tracked object may relocate without waiting for VINESTALK to complete updates for prior moves, and while a find is in progress.</p>
Virtual nodes, sensor networks, hierarchical partitioning, tracking, distributed data structures. Technical areas: Algorithms and theory, Wireless and mobile computing, Sensor networks and ubiquitous computing
Nancy Lynch, Tina Nolte, "A Virtual Node-Based Tracking Algorithm for Mobile Networks", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 1, 2007, doi:10.1109/ICDCS.2007.82
87 ms
(Ver 3.3 (11022016))