loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
27th International Conference on Distributed Computing Systems (ICDCS '07)
A Virtual Node-Based Tracking Algorithm for Mobile Networks
Toronto, Canada
June 25-June 27
ISBN: 0-7695-2837-3
ASCII Text
x 
 
Tina Nolte, Nancy Lynch, "A Virtual Node-Based Tracking Algorithm for Mobile Networks," Distributed Computing Systems, International Conference on, pp. 1, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ICDCS.2007.82,
author = {Tina Nolte and Nancy Lynch},
title = {A Virtual Node-Based Tracking Algorithm for Mobile Networks},
journal ={Distributed Computing Systems, International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2837-3},
pages = {1},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.2007.82},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Distributed Computing Systems, International Conference on
TI - A Virtual Node-Based Tracking Algorithm for Mobile Networks
SN - 0-7695-2837-3
SP
EP
A1 - Tina Nolte,
A1 - Nancy Lynch,
PY - 2007
KW - Virtual nodes
KW - sensor networks
KW - hierarchical partitioning
KW - tracking
KW - distributed data structures. Technical areas: Algorithms and theory
KW - Wireless and mobile computing
KW - Sensor networks and ubiquitous computing
VL - 0
JA - Distributed Computing Systems, International Conference on
ER -
 
Tina Nolte, MIT CSAIL
Nancy Lynch, MIT CSAIL

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.

Index Terms:
Virtual nodes, sensor networks, hierarchical partitioning, tracking, distributed data structures. Technical areas: Algorithms and theory, Wireless and mobile computing, Sensor networks and ubiquitous computing
Citation:
Tina Nolte, Nancy Lynch, "A Virtual Node-Based Tracking Algorithm for Mobile Networks," icdcs, pp.1, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.