Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Local Computation in Unstructured Radio Networks

  • Thomas Moscibroda
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_210

Years and Authors of Summarized Original Work

  • 2005; Moscibroda, Wattenhofer

Problem Definition

In many ways, familiar distributed computing communication models such as the message passing model do not describe the harsh conditions faced in wireless ad hoc and sensor networks closely enough. Ad hoc and sensor networks are multi-hop radio networks and hence, messages being transmitted may interfere with concurrent transmissions leading to collisions and packet losses. Furthermore, the fact that all nodes share the same wireless communication medium leads to an inherent broadcast nature of communication. A message sent by a node can be received by all nodes in its transmission range. These aspects of communication are modeled by the radio network model, e.g., [2].

Definition 1 (Radio Network Model)

In the radio network model, the wireless network is modeled as a graph \( { G=(V,E) } \)

Keywords

Coloring unstructured radio networks Maximal independent sets in radio networks 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Alon N, Bar-Noy A, Linial N, Peleg D (1991) A Lower Bound for Radio Broadcast. J Comput Syst Sci 43:290–298MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Bar-Yehuda R, Goldreich O, Itai A (1987) On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization. In: Proceedings of the 6th symposium on principles of distributed computing (PODC), pp 98–108Google Scholar
  3. 3.
    Busch R, Magdon-Ismail M, Sivrikaya F, Yener B (2004) Contention-free MAC protocols for wireless sensor networks. In: Proceedings of the 18th annual conference on distributed computing (DISC)Google Scholar
  4. 4.
    Chrobak M, Gąsieniec L, Kowalski, D (2004) The wake-up problem in multi-hop radio networks. In: Proceedings of the 15th ACM-SIAM symposium on discrete algorithms (SODA), pp 992–1000Google Scholar
  5. 5.
    Farach-Colton M, Fernandes RJ, Mosteiro MA (2005) Bootstrapping a hop-optimal network in the weak sensor model. In: Proceedings of the 13th European symposium on algorithms (ESA), pp 827–838Google Scholar
  6. 6.
    Farach-Colton M, Fernandes RJ, Mosteiro MA (2006) Lower bounds for clear transmissions in radio networks. In: Proceedings of the 7th Latin American symposium on theoretical informatics (LATIN), pp 447–454Google Scholar
  7. 7.
    Gandhi R, Parthasarathy S (2004) Distributed algorithms for coloring and connected domination in wireless ad hoc networks. In: Foundations of software technology and theoretical computer science (FSTTCS), pp 447–459Google Scholar
  8. 8.
    Gąsieniec L, Pelc A, Peleg D (2000) The wakeup problem in synchronous broadcast systems (extended abstract). In: Proceedings of the 19th ACM symposium on principles of distributed computing (PODC), pp 113–121Google Scholar
  9. 9.
    Jurdziński T, Stachowiak G (2002) Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC), pp 535–549Google Scholar
  10. 10.
    Kuhn F, Moscibroda T, Wattenhofer R (2004) Initializing newly deployed ad hoc and sensor networks. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MOBICOM), pp 260–274Google Scholar
  11. 11.
    Kuhn F, Moscibroda T, Wattenhofer R (2004) What cannot be computed locally! In: Proceedings of 23rd annual symposium on principles of distributed computing (PODC), pp 300–309Google Scholar
  12. 12.
    Linial N (1992) Locality in distributed graph algorithms. SIAM J Comput 21(1):193–201MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Luby M (1986) A simple parallel algorithm for the maximal independent set problem. SIAM J Comput 15:1036–1053MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    McGlynn MJ, Borbash SA (2001) Birthday protocols for low energy deployment and flexible neighborhood discovery in ad hoc wireless networks. In: Proceedings of the 2nd ACM international symposium on mobile ad hoc networking & computing (MOBIHOC)Google Scholar
  15. 15.
    Moscibroda T (2006) Locality, scheduling, and selfishness: algorithmic foundations of highly decentralized networks. Doctoral thesis Nr. 16740, ETH ZurichGoogle Scholar
  16. 16.
    Moscibroda T, von Rickenbach P, Wattenhofer R (2006) Analyzing the energy-latency trade-off during the deployment of sensor networks. In: Proceedings of the 25th joint conference of the IEEE computer and communications societies (INFOCOM)Google Scholar
  17. 17.
    Moscibroda T, Wattenhofer R (2005) Coloring unstructured radio networks. In: Proceedings of the 17th ACM symposium on parallel algorithms and architectures (SPAA), pp 39–48Google Scholar
  18. 18.
    Moscibroda T, Wattenhofer R (2005) Maximal independent sets in radio networks. In: Proceedings of the 23rd ACM symposium on principles of distributed computing (PODC), pp 148–157Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Thomas Moscibroda
    • 1
  1. 1.Systems and Networking Research GroupMicrosoft ResearchRedmondUSA