Skip to main content
SpringerLink
Log in

Distributed bare-bones communication in wireless networks

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We consider wireless networks operating under the SINR model of interference. Nodes have limited individual knowledge and capabilities: they do not know their positions in a coordinate system in the plane, further they do not know their neighborhoods, nor do they know the size of the network n, and finally they cannot sense collisions resulting from simultaneous transmissions by at least two neighbors. Each node is equipped with a unique integer name, where N as an upper bound on the a range of names. We refer as a backbone to a subnetwork induced by a diameter-preserving dominating set of nodes. Let \(\Delta \) denote a maximum number of nodes that can successfully receive a message transmitted by a node when no other nodes transmit concurrently. We study distributed algorithms for communication problems in three settings. In the single-node-start case, when one node starts an execution and other nodes are awoken by receiving messages from already awoken nodes, we present a randomized broadcast algorithm that wakes up all nodes in \(\mathcal {O}(n \log ^2 N)\) rounds with high probability. For the synchronized-start case, when all nodes start an execution simultaneously, we give a randomized algorithm computing a backbone in \(\mathcal {O}(\Delta \log ^{7} N)\) rounds with high probability. In the partly-coordinated-start case, when a number of nodes start an execution together and other nodes are awoken by receiving messages from the already awoken nodes, we develop an algorithm that creates a backbone in time \(\mathcal {O}(n\log ^2 N +\Delta \log ^{7} N)\) with high probability

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: SINR diagrams: convexity and its applications in wireless networks. J. ACM 59(4), 18 (2012)

    Article  MathSciNet  Google Scholar 

  2. Barenboim L., Peleg D.: Nearly optimal local broadcasting in the SINR model with feedback. In: Post-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science vol. 9439, pages 164–178. Springer, 2015

  3. Bodlaender, M.H.L., Halldórsson, M.M.: Beyond geometry: towards fully realistic wireless models. In: Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing (PODC), pages 347–356, 2014

  4. Chlebus, B.S., Kowalski, D.R.: Almost optimal explicit selectors. In: Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT), Lecture Notes in Computer Science vol. 3623, pages 270–280. Springer, 2005

  5. Chlebus, B.S., Kowalski, D.R., Pelc, A., Rokicki, M.A.: Efficient distributed communication in ad-hoc radio networks. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), Part II, volume 6756 of Lecture Notes in Computer Science, pages 613–624. Springer, 2011

  6. Chlebus, B.S., Vaya, S.: Distributed communication in bare-bones wireless networks. In: Proceedings of the 17th International Conference on Distributed Computing and Networking (ICDCN), pages 1:1–1:10. ACM, 2016

  7. Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theor. Comp. Sci. 302(1–3), 337–364 (2003)

    Article  MathSciNet  Google Scholar 

  8. Czumaj, Artur, Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2), 115–143 (2006)

    Article  MathSciNet  Google Scholar 

  9. Daum, S., Gilbert, S., Kuhn, F., Newport, C.C.: Broadcast in the ad hoc SINR model. In: Proceedings of the 27th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science vol. 8205, pages 358–372. Springer, 2013

  10. De Bonis, A., Gąsieniec, L.: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34(5), 1253–1270 (2005)

    Article  MathSciNet  Google Scholar 

  11. Derbel, B., Talbi, E.G.: Radio network distributed algorithms in the unknown neighborhood model. In: Proceedings of the 11th International Conference on Distributed Computing and Networking (ICDCN), volume 5935 of Lecture Notes in Computer Science, pages 155–166. Springer, 2010

  12. Fuchs, F., Wagner, D.: On local broadcasting schedules and CONGEST algorithms in the SINR model. In: Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), volume 8243 of Lecture Notes in Computer Science, pages 170–184. Springer, 2013

  13. Goldsmith, Andrea J., Wicker, Stephen B.: Design challenges for energy-constrained ad hoc wireless networks. IEEE Wireless Commun. 9(4), 8–27 (2002)

    Article  Google Scholar 

  14. Goussevskaia, O., Moscibroda, T., Wattenhofer, R.: Local broadcasting in the physical interference model. In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, pages 35–44, 2008

  15. Goussevskaia, O., Pignolet, Y.A., Wattenhofer, R.: Efficiency of wireless networks: approximation algorithms for the physical interference model. Found. Trends Network. 4(3), 313–420 (2010)

    Article  Google Scholar 

  16. Halldórsson, M.M., Holzer, S., Lynch, N.A.: A local broadcast layer for the SINR network model. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), pages 129–138, 2015

  17. Halldórsson, M.M., Mitra, P.: Towards tight bounds for local broadcasting. In: Proceedings of the 8th ACM International Workshop on Foundations of Mobile Computing (FOMC), page 2, 2012

  18. Halldórsson M.M., Tonoyan, T.: Sparse backbone and optimal distributed SINR algorithms. ACM Transactions on Algorithms, 17(2):article 17, 2021

  19. Halldórsson, M.M., Tonoyan, T., Wang, Y., Yu, D.: Brief announcement: Data dissemination in unified dynamic wireless networks. In: George Giakkoupis, editor, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC), pages 199–201. ACM, 2016

  20. Jurdziński, T., Kowalski, D.R.: Distributed backbone structure for algorithms in the SINR model of wireless networks. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science vol. 7611, pages 106–120. Springer, 2012

  21. Jurdziński, T., Kowalski, D.R.: Distributed randomized broadcasting in wireless networks under the SINR model. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms. Springer, US (2014)

    Google Scholar 

  22. Jurdziński, T., Kowalski, D.R., Różański, M., Stachowiak, G.: Distributed randomized broadcasting in wireless networks under the SINR model. In: Proceedings of the 27th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science vol. 8205, pages 373–387. Springer, 2013

  23. Jurdziński, T., Kowalski, D.R., Różański, M., Stachowiak G.: On the impact of geometry on ad hoc communication in wireless networks. In: Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing (PODC), pages 357–366, 2014

  24. Jurdziński, T., Kowalski, D.R., Różański M., Stachowiak, G.: On setting-up asynchronous ad hoc wireless networks. In: Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM), pages 2191–2199, 2015

  25. Jurdziński, T., Kowalski, D.R., Stachowiak, G.: Distributed deterministic broadcasting in uniform-power ad hoc wireless networks. In: Proceedings of the 19th International Symposium on Fundamentals of Computation Theory (FCT), Lecture Notes in Computer Science vol. 8070, pages 195–209. Springer, 2013

  26. Jurdziński, T., Kowalski, D.R., Stachowiak, G.: Distributed deterministic broadcasting in wireless networks of weak devices. In: Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science vol. 7966, pages 632–644. Springer, 2013

  27. Kesselheim T., Vöcking, B.: Distributed contention resolution in wireless networks. In: Proceedings of the 24th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science vol. 6343, pages 163–178. Springer, 2010

  28. Kowalski, Dariusz R.: Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18(1), 43–57 (2005)

    Article  Google Scholar 

  29. Kushilevitz, E., Mansour, Y.: An \({\Omega }({D} \log ({N}/{D}))\) lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702–712 (1998)

    Article  MathSciNet  Google Scholar 

  30. Moses, W.K., Jr., Vaya, S.: Deterministic protocols in the SINR model without knowledge of coordinates. J. Comput. Syst. Sci. 115, 121–145 (2021)

    Article  MathSciNet  Google Scholar 

  31. Reddy S.P., Kowalski D.R., Vaya S.: Multi-broadcasting under the SINR model. CoRR, abs/1504.01352, 2015

  32. Reddy S.P., and Vaya S.: Brief announcement: Multi-broadcasting under the SINR model. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC), pages 479–481. ACM, 2016

  33. Scheideler C., Richa A., Santi P.: An \({O}(\log n)\) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: Proceedings of the 9th ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pages 91–100, 2008

  34. Schmid S., Wattenhofer R.: Algorithmic models for sensor networks. In: Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2006

  35. D. Yu, Q.S. Hua, Y. Wang, H. Tan, and F. C. Lau.: Distributed multiple-message broadcast in wireless ad-hoc networks under the SINR model. In: Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science vol. 7355, pages 111–122. Springer, 2012

  36. D. Yu, Q. S. Hua, Y. Wang, J. Yu, and F. C. Lau.: Efficient distributed multiple-message broadcasting in unstructured wireless networks. In: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), pages 2427–2435, 2013

  37. D. Yu, Y. Wang, Q.S. Hua, and F. C. Lau.: Distributed local broadcasting algorithms in the physical interference model. In: Proceedings of the 7th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS), pages 1–8, 2011

  38. D. Yu, Y. Zou, Y. Zhang, F. Li, J. Yu, Y. Wu, X. Cheng, and F.C. Lau.: Distributed dominating set and connected dominating set construction under the dynamic SINR model. In: Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 835–844. IEEE, 2019

  39. Yu, J., Wang, N., Wang, G., Yu, D.: Connected dominating sets in wireless ad hoc and sensor networks–A comprehensive survey. Comput. Commun. 36(2), 121–134 (2013)

    Article  Google Scholar 

  40. Y. Zou, D. Yu, L Wu, J Yu, Y Wu, QS Hua, and F.C. Lau.: Fast distributed backbone construction despite strong adversarial jamming. In: Proceedings of the 2019 IEEE Conference on Computer Communications (INFOCOM), pages 1027–1035. IEEE, 2019

Download references

Funding

The work of the first author was partly supported by the National Science Foundation Grant No. 1016847. The work of the second author was partly supported by the National Science Foundation Grant No. 2131538 and the Polish National Science Center NCN grant UMO-2017/25/B/ST6/02553

Author information

Authors and Affiliations

  1. School of Computer and Cyber Sciences, Augusta University, Augusta, Georgia, USA

    Bogdan S. Chlebus & Dariusz R. Kowalski

  2. Xerox Research Centre India, Bangalore, India

    Shailesh Vaya

Authors
  1. Bogdan S. Chlebus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dariusz R. Kowalski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shailesh Vaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bogdan S. Chlebus.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chlebus, B.S., Kowalski, D.R. & Vaya, S. Distributed bare-bones communication in wireless networks. Distrib. Comput. 35, 59–80 (2022). https://doi.org/10.1007/s00446-021-00413-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-021-00413-7

Keywords

Search

Navigation