Abstract
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. © IFIP International Federation for Information Processing 2005.
Cite
CITATION STYLE
Kshemkalyani, A. D. (2005). Predicate detection using event streams in ubiquitous environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3823 LNCS, pp. 807–816). https://doi.org/10.1007/11596042_83
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.