skip to main content
10.1145/1890784.1890788acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmiddlewareConference Proceedingsconference-collections
research-article

Middleware clocks for sensing the physical world

Published:30 November 2010Publication History

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.

References

  1. P. Chandra, A. D. Kshemkalyani, Causality-based predicate detection across space and time. IEEE Transactions on Computers, 54(11): 1438--1453, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Cooper, K. Marzullo, Consistent detection of global predicates. In Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, 163--173, May 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Fidge, Timestamps in message-passing systems that preserve partial ordering. Australian Computer Science Communications, 10(1): 56--66, 1988.Google ScholarGoogle Scholar
  4. V. K. Garg, B. Waldecker, Detection of strong unstable predicates in distributed programs. IEEE Trans. Parallel & Distributed Systems, 7(12):1323--1333, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. L. Kaveti, S. Pulluri, G. Singh, Event ordering in pervasive sensor networks. In IEEE Int. Conf. on Pervasive Computing and Comm. Workshops, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. D. Kshemkalyani, Temporal interactions of intervals in distributed systems. Journal of Computer and System Sciences, 52(2): 287--298, April 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. D. Kshemkalyani, A fine-grained modality classification for global predicates. IEEE Trans. Parallel and Distributed Systems, 14(8): 807--816, August 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. D. Kshemkalyani, Temporal predicate detection using synchronized clocks. IEEE Transactions on Computers, 56(11): 1578--1584, November 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. D. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. D. Kshemkalyani, Repeated detection of conjunctive predicates in distributed executions, manuscript, 2010.Google ScholarGoogle Scholar
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. L. Lamport, Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7): 558--565, July 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. F. Mattern, Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms, North-Holland, pp 215--226, 1989.Google ScholarGoogle Scholar
  15. J. Mayo, P. Kearns, Global predicates in rough real time. In IEEE Symp. on Parallel and Distributed Processing, 17--24, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. L. Mottola, G. P. Picco, Programming wireless sensor networks: fundamental concepts and state of the art. ACM Computing Surveys, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. P. Pietzuch, B. Shand, J. Bacon, Composite event detection as a generic middleware extension. IEEE Network, 18(1): 44--55, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 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 ScholarGoogle ScholarCross RefCross Ref
  19. 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 ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Middleware clocks for sensing the physical world

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      MidSens '10: Proceedings of the 5th International Workshop on Middleware Tools, Services and Run-Time Support for Sensor Networks
      November 2010
      40 pages
      ISBN:9781450304542
      DOI:10.1145/1890784

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 30 November 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader