ABSTRACT
An important task in sensor networks is to sense locally to detect global properties that hold at some instant in physical time. We propose software logical clocks, called strobe clocks, that can be implemented by the middleware when synchronized physical clocks are not available or are too expensive in resource-constrained environments. Strobe clocks come in two flavors -- scalar and vector. Let n be the number of sensors and p be the upper bound on the number of relevant events sensed at a sensor. We propose an algorithm using vector strobes that can detect all occurrences of a conjunctive predicate in time O(n3p). The algorithm has some false negatives but this is the best achievable accuracy in the face of race conditions. We also present a variant algorithm using scalar strobes; it needs time O(n2p) but may also suffer from some false positives. We provide a characterization of the errors. Both algorithms can also detect relational predicates but with a greater chance of error. The message complexity of strobe clocks (scalar and vector) and both algorithms is O(np), which is the same as that of reporting each sensed event for detection of the predicate even with synchronized physical clocks.
- P. Chandra, A. D. Kshemkalyani, Causality-based predicate detection across space and time. IEEE Transactions on Computers, 54(11): 1438--1453, 2005. Google ScholarDigital Library
- R. Cooper, K. Marzullo, Consistent detection of global predicates. In Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, 163--173, May 1991. Google ScholarDigital Library
- C. Fidge, Timestamps in message-passing systems that preserve partial ordering. Australian Computer Science Communications, 10(1): 56--66, 1988.Google Scholar
- V. K. Garg, B. Waldecker, Detection of strong unstable predicates in distributed programs. IEEE Trans. Parallel & Distributed Systems, 7(12):1323--1333, 1996. Google ScholarDigital Library
- Y. Huang, X. Ma, J. Cao, X. Tao, J. Lu, Concurrent event detection for asynchronous consistency checking of pervasive context. In IEEE International Conference on Pervasive Computing and Communications, 2009. Google ScholarDigital Library
- L. Kaveti, S. Pulluri, G. Singh, Event ordering in pervasive sensor networks. In IEEE Int. Conf. on Pervasive Computing and Comm. Workshops, 2009. Google ScholarDigital Library
- A. D. Kshemkalyani, Temporal interactions of intervals in distributed systems. Journal of Computer and System Sciences, 52(2): 287--298, April 1996. Google ScholarDigital Library
- A. D. Kshemkalyani, A fine-grained modality classification for global predicates. IEEE Trans. Parallel and Distributed Systems, 14(8): 807--816, August 2003. Google ScholarDigital Library
- A. D. Kshemkalyani, Temporal predicate detection using synchronized clocks. IEEE Transactions on Computers, 56(11): 1578--1584, November 2007. Google ScholarDigital Library
- A. D. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, 2008. Google ScholarDigital Library
- A. D. Kshemkalyani, Repeated detection of conjunctive predicates in distributed executions, manuscript, 2010.Google Scholar
- A. D. Kshemkalyani, Immediate detection of predicates in pervasive environments. In 9th International Workshop on Adaptive and Reflective Middleware (ARM'10), ACM Press, 2010. Google ScholarDigital Library
- L. Lamport, Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7): 558--565, July 1978. Google ScholarDigital Library
- F. Mattern, Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms, North-Holland, pp 215--226, 1989.Google Scholar
- J. Mayo, P. Kearns, Global predicates in rough real time. In IEEE Symp. on Parallel and Distributed Processing, 17--24, 1995. Google ScholarDigital Library
- L. Mottola, G. P. Picco, Programming wireless sensor networks: fundamental concepts and state of the art. ACM Computing Surveys, 2010. Google ScholarDigital Library
- P. Pietzuch, B. Shand, J. Bacon, Composite event detection as a generic middleware extension. IEEE Network, 18(1): 44--55, 2004. Google ScholarDigital Library
- K. Romer, F. Mattern, Event-based systems for detecting real-world states with sensor networks: a critical analysis. In DEST Workshop on Signal Processing in Wireless Sensor Networks at ISSNIP, pp. 389--395, 2004.Google ScholarCross Ref
- B. Sundararaman, U. Buy, A. D. Kshemkalyani, Clock synchronization for wireless sensor networks: a survey. Ad-Hoc Networks, 3(3): 281--323, May 2005.Google ScholarCross Ref
Index Terms
- Middleware clocks for sensing the physical world
Recommendations
Predicate Detection in Asynchronous Pervasive Environments
An important task in sensor networks is to sense locally to detect global properties that hold at some instant in physical time, namely, Instantaneously. We propose software logical clocks, called strobe clocks, that can be implemented by the middleware ...
Achieving Causality with Physical Clocks
ICDCN '22: Proceedings of the 23rd International Conference on Distributed Computing and NetworkingPhysical clocks provide more precision than applications can use. For example, a 64 bit NTP clock allows a precision of 233 picoseconds. In this paper, we focus on whether the least significant bits that are not useful to the applications could be used ...
Immediate detection of predicates in pervasive environments
An important problem in pervasive environments is detecting predicates on sensed variables in an asynchronous distributed setting to determine context and to respond. We do not assume the availability of synchronized physical clocks because they may not ...
Comments