Skip to main content

Collision-Free Communication in Sensor Networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2704))

Abstract

In this paper, we provide a stabilizing solution for collision-free diffusion in sensor networks. Such diffusions are often necessary in sensor networks when information from one sensor needs to be communicated to other sensors that satisfy certain geographic properties. Our solution deals with several difficulties, e.g., unidirectional links, unreliable links, long links, failed sensors, and sensors that are sleeping in order to save energy, that occur in sensor networks. It also ensures that there are no collisions during the diffusion and that the time required for the diffusion is O(D) where D is the diameter of the network. Moreover, while the solution can be applied to an arbitrary topology, it is more suitable for a commonly occurring topology, a two-dimensional grid.

We show how our solution for collision-free diffusion can be used for time-division multiplexing (TDM) in sensor networks. TDM ensures that the message communication (other than the messages sent by diffusion) among sensors is also collision-free. While collision-free diffusion and time-division multiplexing are interdependent, we show how both these properties can be achieved simultaneously. Our algorithms are stabilizing fault-tolerant, i.e., collision-free diffusion and time-division multiplexing are restored even if the system reaches an arbitrary state where the sensors are corrupted or improperly initialized.

This work was partially sponsored by NSF CAREER CCR-0092724, DARPA Grant OSURS01-C-1901, ONR Grant N00014-01-1-0744, and a grant from Michigan State University.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11), 1974. 18, 30

    Google Scholar 

  2. Sandeep S. Kulkarni and Umamaheswaran Arumugam. Collision-free communication in sensor networks. Technical Report MSU-CSE-03-3, Department of Computer Science, Michigan State University, February 2003. 28, 30

    Google Scholar 

  3. J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, MD, 1984. 28

    MATH  Google Scholar 

  4. Evangelos Kranakis, Danny Krizanc, and Andrzej Pelc. Fault-tolerant broadcasting in radio networks. Journal of Algorithms, 39(1):47–67, April 2001. 28, 29

    Article  MATH  MathSciNet  Google Scholar 

  5. Ted Herman. NestArch: Prototype time synchronization service. NEST Challenge Architecture. Available at: http://www.ai.mit.edu/people/sombrero/nestwiki/index/ComponentTimeSync, January 2003. 28, 29

  6. Jeremy Elson and Deborah Estrin. Time synchronization for wireless sensor networks. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), Workshop on Parallel and Distributed Computing Issues in Wireless and Mobile Computing, April 2001. 28, 29

    Google Scholar 

  7. David E. Culler, Jason Hill, Philip Buonadonna, Robert Szewczyk, and Alec Woo. A network-centric approach to embedded software for tiny devices. In EMSOFT, volume 2211 of Lecture Notes in Computer Science, pages 97–113. Springer, 2001. 29

    Google Scholar 

  8. Leszek Gasieniec, Andrzej Pelc, and David Peleg. The wakeup problem in synchronous broadcast systems. SIAM Journal of Discrete Mathematics, 14(2):207–222, 2001. 29, 30

    Article  MATH  MathSciNet  Google Scholar 

  9. Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, and Wojciech Rytter. Deterministic broadcasting in ad hoc radio networks. Distributed Computing, 15(1):27–38, 2002. 29, 30

    Article  Google Scholar 

  10. Andrew J. Viterbi. CDMA: Principles of Spread Spectrum Communication. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1995. 29

    MATH  Google Scholar 

  11. Vilgot Claesson, Henrik Lonn, and Neeraj Suri. Efficient TDMA synchronization for distributed embedded systems. In Proceedings of the 20th IEEE Symposium on Reliable Distributed Systems (SRDS), pages 198–201, October 2001. 29

    Google Scholar 

  12. Y. Choi, M. Gouda, M. C. Kim, and A. Arora. The mote connectivity protocol. Technical Report TR03-08, Department of Computer Sciences, The University of Texas at Austin, 2003. 30

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kulkarni, S.S., Arumugam, U. (2003). Collision-Free Communication in Sensor Networks. In: Huang, ST., Herman, T. (eds) Self-Stabilizing Systems. SSS 2003. Lecture Notes in Computer Science, vol 2704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45032-7_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45032-7_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40453-8

  • Online ISBN: 978-3-540-45032-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics