Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Temporal interactions of intervals in distributed systems
Journal of Computer and System Sciences
Maintaining knowledge about temporal intervals
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Time synchronization in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Detection of Orthogonal Interval Relations
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
A Fine-Grained Modality Classification for Global Predicates
IEEE Transactions on Parallel and Distributed Systems
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Causality-Based Predicate Detection across Space and Time
IEEE Transactions on Computers
Global state detection based on peer-to-peer interactions
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Temporal Predicate Detection Using Synchronized Clocks
IEEE Transactions on Computers
| Hi-index | 0.00 |
Advances in clock synchronization techniques for sensor networks as well as wireless ad-hoc networks allow an approximated global time for an increasing number of configurations in ubiquitous and pervasive computing environments. This paper presents an event stream based on-line algorithm that fuses the data reported from the heterogenous processors in the network to detect predicates of interest. The algorithm detects properties that can be specified using predicates under a rich palette of time modalities. The algorithm has low space, time, and message complexities. The main idea used to design the algorithm is that the predicate is decomposed as a collection of predicates between pairs of system devices. The algorithm leverages the pairwise interaction between processes so as to incur a low overhead and hence be highly scalable.