skip to main content
10.1145/941350.941352acmconferencesArticle/Chapter ViewAbstractPublication PageswsnaConference Proceedingsconference-collections
Article

Asymptotically optimal time synchronization in dense sensor networks

Published:19 September 2003Publication History

ABSTRACT

We consider the problem of synchronization of all clocks in a sensor network, in the regime of asymptotically high node densities. We formulate this problem as one in which all clocks must line up with the clock of an arbitrary node in the network (of course without assuming that this clock can be observed everywhere in the network, nor assuming that this node has any special hardware--this node could be any). We give a state-space description for the generation of observable data as a function of the ideal clock, and we derive an optimal estimator for determining the state of the ideal clock. A salient feature of our approach is that nodes collaborate to generate an aggregate waveform that can be observed simultaneously by all nodes, and that contains enough information to synchronize all clocks. This aggregate waveform effectively simulates the presence of a "super-node" capable of generating a high-power, network-wide time reference signal.

References

  1. J. Barros and S. D. Servetto. Coding Theorems for the Sensor Reachback Problem with Partially Cooperating Nodes. In Discrete Mathematics and Theoretical Computer Science (DIMACS) series on Network Information Theory, Piscataway, NJ, 2003.Google ScholarGoogle Scholar
  2. J. Elson, L. Girod, and D. Estrin. Fine-Grained Network Time Syncrhonization using Reference Broadcasts. In Proc. 5th Symp. Op. Syst. Design Implementation (OSDI), Boston, MA, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Elson and K. Römer. Wireless Sensor Networks: A New Regime for Time Synchronization. In Proc. First Workshop on Hot Topics In Networks (HotNets-I), Princeton, NJ, 2002.Google ScholarGoogle Scholar
  4. P. Gupta and P. R. Kumar. Critical Power for Asymptotic Connectivity in Wireless Networks. In W. M. McEneany, G. Yin, and Q. Zhang, editors, Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming. Birkhauser, 1998.Google ScholarGoogle Scholar
  5. P. Gupta and P. R. Kumar. The Capacity of Wireless Networks. IEEE Trans. Inform. Theory, 46(2):388--404, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. B. Hofmann-Wellenhof, H. Lichtenegger, and J. Collins. GPS: Theory and Practice. Springer-Verlag/Wien, 1997.Google ScholarGoogle Scholar
  7. A. Hu and S. D. Servetto. Optimal Detection for a Distributed Transmission Array. In Proc. IEEE Int. Symp. Inform. Theory (ISIT), Yokohama, Japan, 2003.Google ScholarGoogle Scholar
  8. C. Kelly IV, V. Ekanayake, and R. Manohar. SNAP: A Sensor Network Asynchronous Processor. In Proc. 9th Int. Symp. Async. Circ. Syst., Vancouver, BC, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Karp, J. Elson, D. Estrin, and S. Shenker. Optimal and Global Time Synchronization in Sensornets. Technical Report~9, Center for Embedded Network Sensing, UCLA, 2003. Available from http://lecs.cs.ucla.edu/.Google ScholarGoogle Scholar
  10. S. M. Kay. Fundamentals of Statistical Signal Processing: Estimation Theory. PTR Prentice Hall, Inc., 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. H. Li, A. Lal, J. Blanchard, and D. Henderson. Self-Reciprocating Radioisotope-Powered Cantilever. J. Applied Phys., 92(2):1122--1127, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  12. H. V. Poor. An Introduction to Signal Detection and Estimation. Springer-Verlag, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. I. Resnick. A Probability Path. Birkhäuser, 2001.Google ScholarGoogle Scholar
  14. A. Scaglione and Y. W. Hong. Opportunistic Large Arrays. In IEEE Int. Symp. Adv. Wireless Comm. (ISWC02), Victoria, BC, 2002.Google ScholarGoogle Scholar
  15. A. Scaglione and S. D. Servetto. On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks. In Proc. ACM MobiCom, Atlanta, GA, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. D. Servetto. Quantization with Side Information: Lattice Codes, Asymptotics, and Applications in Wireless Networks. Submitted to the IEEE Trans. Inform. Theory, March 2002. Available from http://cn.ece.cornell.edu/.Google ScholarGoogle Scholar
  17. S. D. Servetto. Distributed Signal Processing Algorithms for the Sensor Broadcast Problem. In Proc. 37th Annual Conf. Inform. Sciences Syst. (CISS), Baltimore, MD, 2003.Google ScholarGoogle Scholar
  18. S. D. Servetto. Sensing Lena---Massively Distributed Compression of Sensor Images. In Proc. IEEE Int. Conf. Image Proc. (ICIP), 2003. Invited paper.Google ScholarGoogle ScholarCross RefCross Ref
  19. H. Stark and J. Woods. Probability, Random Processes, and Estimation Theory for Engineers. Prentice Hall, Inc., 2nd edition, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. H. Wang, L. Yip, D. Maniezzo, J. C. Chen, R. E. Hudson, J. Elson, and K. Yao. A Wireless Time-Synchronized COTS Sensor Platform: Applications to Beamforming. In Proc. IEEE CAS Workshop Wireless Comm. Networking, Pasadena, CA, 2002.Google ScholarGoogle Scholar
  21. B. Warneke, M. Last, B. Liebowitz, and K. S. J. Pister. Smart Dust: Communicating with a Cubic-Millimeter Computer. IEEE Computer Mag., 34(1):44--51, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Asymptotically optimal time synchronization in dense sensor networks

      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 Conferences
        WSNA '03: Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
        September 2003
        178 pages
        ISBN:1581137648
        DOI:10.1145/941350

        Copyright © 2003 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: 19 September 2003

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate15of60submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader