Online tracking of mobile users
Journal of the ACM (JACM)
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Crash failures can drive protocols to arbitrary states
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
An efficient mobility management strategy for personal communication systems
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Locating Objects in Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Self Stabilizing Distributed Queuing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Modified tree structure for location management in mobile environments
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A line in the sand: a wireless sensor network for target detection, classification, and tracking
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Military communications systems and technologies
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A pursuer-evader game for sensor networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Glance: A lightweight querying service for wireless sensor networks
Theoretical Computer Science
Trail: A distance-sensitive sensor network service for distributed object tracking
ACM Transactions on Sensor Networks (TOSN)
Predictive QoS routing to mobile sinks in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Barricade: defending systems against operator mistakes
Proceedings of the 5th European conference on Computer systems
Trail: a distance sensitive WSN service for distributed object tracking
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Secure and self-stabilizing clock synchronization in sensor networks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
ACM Transactions on Algorithms (TALG)
A lightweight soft-state tracking framework for dense mobile ad hoc networks
Pervasive and Mobile Computing
Secure and self-stabilizing clock synchronization in sensor networks
Theoretical Computer Science
GLANCE: a lightweight querying service for wireless sensor networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing mobile node location management and message routing
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Distributed transactional memory for metric-space networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
A state-based model of sensor protocols
Theoretical Computer Science
Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In this paper, we introduce the concept of hierarchy-based fault-local stabilization and a novel self-healing/fault-containment technique and apply them in Stalk. Stalk is an algorithm for tracking in sensor networks that maintains a data structure on top of an underlying hierarchical partitioning of the network. Starting from an arbitrarily corrupted state, Stalk satisfies its specification within time and communication cost proportional to the size of the faulty region, defined in terms of levels of the hierarchy where faults have occurred. This local stabilization is achieved by slowing propagation of information as the levels of the hierarchy underlying Stalk increase, enabling more recent information propagated by lower levels to override misinformation at higher levels before the misinformation is propagated more than a constant number of levels. In addition, this stabilization is achieved without reducing the efficiency or availability of the data structure when faults don't occur: 1) Operations to find the mobile object distance d away take O(d) time and communication to complete, 2) 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, 3) The tracked object may relocate without waiting for Stalk to complete updates resulting from prior moves, and 4) The mobile object can move while a find is in progress.