A Virtual Node-Based Tracking Algorithm for Mobile Networks

Authors:
Tina Nolte;Nancy Lynch
Affiliations:
MIT CSAIL;MIT CSAIL
Venue:
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Year:
2007

Citing 0
Cited 4

Virtual infrastructure for collision-prone wireless networks

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Self-stabilizing Mobile Robot Formations with Virtual Nodes

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing robot formations over unreliable networks

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A lightweight soft-state tracking framework for dense mobile ad hoc networks

Pervasive and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. 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.