Skip to main content

Sensor Networks: Distributed Algorithms Reloaded – or Revolutions?

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4056))

Abstract

This paper wants to motivate the distributed algorithms community to study sensor networks. We discuss why sensor networks are distributed algorithms, and why they are not.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramson, N.: The ALOHA System. In: Computer-Communication Networks, Prentice-Hall, Englewood Cliffs (1973)

    Google Scholar 

  2. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A Lower Bound for Radio Broadcast. Journal of Computer and System Sciences (1991)

    Google Scholar 

  3. Awerbuch, B., Varghese, G.: Distributed Program Checking: A Paradigm for Building Self-stabilizing Distributed Protocols. In: 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (1991)

    Google Scholar 

  4. Dijkstra, E.W.: Self-stabilizing Systems in Spite of Distributed Control. Communications of the ACM (1974)

    Google Scholar 

  5. Estrin, D., Govindan, R., Heidemann, J.S., Kumar, S.: Next Century Challenges: Scalable Coordination in Sensor Networks. In: Fifth Annual International Conference on Mobile Computing and Networking (MobiCom) (1999)

    Google Scholar 

  6. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Initializing Newly Depoloyed Ad-hoc and Sensor Networks. In: 10th Annual Intl. Conf. on Mobile Computing and Networking (MobiCom) (2004)

    Google Scholar 

  7. Kuhn, F., Moscibroda, T., Wattenhofer, R.: The Price of Being Near-Sighted. In: ACM-SIAM Symp. on Discrete Algorithms (SODA) (2006)

    Google Scholar 

  8. Linial, N.: Distributive Graph Algorithms – Global Solutions from Local Data. In: 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (1987)

    Google Scholar 

  9. Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing (1986)

    Google Scholar 

  10. Peleg, D.: Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)

    Book  MATH  Google Scholar 

  11. Roberts, L.G.: Aloha packet system with and without slots and capture. Computer Communication Review (1975)

    Google Scholar 

  12. Schmid, S., Wattenhofer, R.: Algorithmic Models for Sensor Networks. In: 14th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS), Island of Rhodes, Greece (April 2006)

    Google Scholar 

  13. Wang, Y., Li, X.-Y., Wan, P.-J., Frieder, O.: Sparse Power Efficient Topology for Wireless Networks. Journal of Parallel and Distributed Computing (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wattenhofer, R. (2006). Sensor Networks: Distributed Algorithms Reloaded – or Revolutions?. In: Flocchini, P., Gąsieniec, L. (eds) Structural Information and Communication Complexity. SIROCCO 2006. Lecture Notes in Computer Science, vol 4056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780823_3

Download citation

  • DOI: https://doi.org/10.1007/11780823_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35474-1

  • Online ISBN: 978-3-540-35475-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics