Document Open Access Logo

Weighted Beeping Networks

Authors Dariusz R. Kowalski , Miguel A. Mosteiro

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2026.54.pdf
  • Filesize: 1.2 MB
  • 24 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
  • Theory of computation → Distributed algorithms
Keywords
  • Local Broadcast
  • Multiagent Systems
  • Weighted Beeping Networks

Metrics

Abstract

Beeping Networks (BN) have become an established model of wireless communication and computation. They assume, however, that the communication interference caused by beeping nodes is binary (OR channel), while both artificial and nature-driven networks are based on varied signal strength and receiving thresholds. This work naturally extends the classic beeping networks to weighted beeping networks (WBN), by modeling signal strengths by weights on graph edges and receiving a beep if the accumulative signal strengths of transmitting neighbors are above receiving threshold. Under this generalized model, we study the fundamental Local Broadcast (LB) problem. Since edges with low weights may not even accumulate to a received beep, we only require that messages are delivered along sufficiently heavy edges, with weights above some given threshold σ. We design an LB algorithm that completes its task in O(I_σ log n ⋅ (ℳ+log n)) beeping rounds, whp, where n is the number of nodes, I_σ is the maximum local interference on heavy edges, and ℳ is the maximum length of messages sent locally. This result is nearly optimal, as, with probability 1, Ω(I_σ) beeping rounds are necessary to solve LB. Finally, we show that any algorithm designed for the classic beeping networks and terminating in polynomial number of beeping rounds, can be emulated on any WBN with a logarithmic overhead, that is, it returns the same output as working on the classic beeping network isomorphic to the sub-graph of heavy edges.

Cite As Get BibTex

Dariusz R. Kowalski and Miguel A. Mosteiro. Weighted Beeping Networks. In 40th International Symposium on Distributed Computing (DISC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 397, pp. 54:1-54:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.DISC.2026.54

Author Details

Dariusz R. Kowalski
  • Augusta University, GA, USA
Miguel A. Mosteiro
  • Pace University, New York, NY, USA

Funding

This work has been partially funded by Pace University Kenan Fund and SRC Award.
  • Mosteiro, Miguel A.: Pace U. SRC Award and Kenan Funds.

References

  1. Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, and Fabian Kuhn. Beeping a maximal independent set. Distributed computing, 26(4):195-208, 2013. URL: https://doi.org/10.1007/S00446-012-0175-7.
  2. Yehuda Afek, Noga Alon, Omer Barad, Eran Hornstein, Naama Barkai, and Ziv Bar-Joseph. A biological solution to a fundamental distributed computing problem. Science, 331(6014):183-185, 2011. Google Scholar
  3. Eyjólfur I. Ásgeirsson, Magnús M. Halldórsson, and Tigran Tonoyan. Universal Framework for Wireless Scheduling Problems. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), pages 129:1-129:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.129.
  4. Yagel Ashkenazi, Ran Gelles, and Amir Leshem. Noisy beeping networks. Information and Computation, 289:104925, 2022. URL: https://doi.org/10.1016/j.ic.2022.104925.
  5. Weizhe Chen, Sven Koenig, and Bistra Dilkina. Marl-lns: Cooperative multi-agent reinforcement learning via large neighborhoods search. arXiv preprint arXiv:2404.03101, 2024. URL: https://doi.org/10.48550/arXiv.2404.03101.
  6. Alejandro Cornejo and Fabian Kuhn. Deploying wireless networks with beeps. In Distributed Computing: 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings 24, pages 148-162. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-15763-9_15.
  7. Peter Davies. Optimal message-passing with noisy beeps. In Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, pages 300-309, 2023. URL: https://doi.org/10.1145/3583668.3594594.
  8. Gianluca De Marco and Dariusz R. Kowalski. Ultra-resilient superimposed codes: Near-optimal construction and applications. In 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, July 8-11, 2025, Aarhus, Denmark, volume 334 of LIPIcs, pages 65:1-65:20, 2025. URL: https://doi.org/10.4230/LIPIcs.ICALP.2025.65.
  9. Shihao Dong, Tao Lin, James C Nieh, and Ken Tan. Social signal learning of the waggle dance in honey bees. Science, 379(6636):1015-1018, 2023. Google Scholar
  10. Fabien Dufoulon, Janna Burman, and Joffroy Beauquier. Beeping a Deterministic Time-Optimal Leader Election. In 32nd International Symposium on Distributed Computing (DISC 2018), volume 121 of Leibniz International Proceedings in Informatics (LIPIcs), pages 20:1-20:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.DISC.2018.20.
  11. Fabien Dufoulon, Janna Burman, and Joffroy Beauquier. Can uncoordinated beeps tell stories? In Proceedings of the 39th Symposium on Principles of Distributed Computing, pages 408-417, 2020. URL: https://doi.org/10.1145/3382734.3405699.
  12. Klim Efremenko, Gillat Kol, and Raghuvansh R Saxena. Noisy beeps. In Proceedings of the 39th Symposium on Principles of Distributed Computing, pages 418-427, 2020. URL: https://doi.org/10.1145/3382734.3404501.
  13. Alexander Fanghänel, Thomas Kesselheim, and Berthold Vöcking. Improved algorithms for latency minimization in wireless networks. In 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 447-458. Springer Berlin Heidelberg, 2009. Google Scholar
  14. Alexander Fanghänel, Thomas Kesselheim, and Berthold Vöcking. Improved algorithms for latency minimization in wireless networks. Theoretical Computer Science, 412(24):2657-2667, 2011. URL: https://doi.org/10.1016/J.TCS.2010.05.004.
  15. Michael Feldmann, Ardalan Khazraei, and Christian Scheideler. Time-and space-optimal discrete clock synchronization in the beeping model. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, pages 223-233, 2020. URL: https://doi.org/10.1145/3350755.3400246.
  16. Klaus-Tycho Förster, Jochen Seidel, and Roger Wattenhofer. Deterministic leader election in multi-hop beeping networks. In Distributed Computing: 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings 28, pages 212-226. Springer, 2014. Google Scholar
  17. W Claiborne Fuqua, Stephen C Winans, and E Peter Greenberg. Quorum sensing in bacteria: the luxr-luxi family of cell density-responsive transcriptional regulators. Journal of bacteriology, 176(2):269-275, 1994. Google Scholar
  18. Michael Y Galperin. Bacterial signal transduction network in a genomic perspective. Environmental microbiology, 6(6):552-567, 2004. Google Scholar
  19. Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Shay Kutten, and Miguel A. Mosteiro. Deterministic local problems in radio networks: On the impact of local domination and a bit of advice. In 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2025.34.
  20. Pawel Garncarek, Dariusz R. Kowalski, Shay Kutten, and Miguel A. Mosteiro. Beeping deterministic CONGEST algorithms in graphs. In Anne Benoit, Haim Kaplan, Sebastian Wild, and Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms, ESA 2025, Warsaw, Poland, September 15-17, 2025, LIPIcs, pages 20:1-20:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.ESA.2025.20.
  21. Seth Gilbert and Calvin Newport. Symmetry breaking with noisy processes. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 273-282, 2017. URL: https://doi.org/10.1145/3087801.3087814.
  22. Magnús M Halldórsson and Pradipta Mitra. Towards tight bounds for local broadcasting. In Proceedings of the 8th International Workshop on Foundations of Mobile Computing, pages 1-9, 2012. Google Scholar
  23. Magnús M. Halldórsson and Roger Wattenhofer. Wireless communication is in apx. In Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 525-536, 2009. URL: https://doi.org/10.1007/978-3-642-02927-1_44.
  24. Magnús M. Halldórsson and Roger Wattenhofer. Wireless Network Algorithmics. Springer International Publishing, Cham, 2019. URL: https://doi.org/10.1007/978-3-319-91908-9_9.
  25. J.F. Hayes. An adaptive technique for local distribution. IEEE Communications Magazine, 19(2), 1981. Google Scholar
  26. Kokouvi Hounkanli, Avery Miller, and Andrzej Pelc. Global synchronization and consensus using beeps in a fault-prone multiple access channel. Theoretical Computer Science, 806:567-576, 2020. URL: https://doi.org/10.1016/J.TCS.2019.09.020.
  27. Thomas Kesselheim. Dynamic packet scheduling in wireless networks. In Proc. of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 281-290, 2012. URL: https://doi.org/10.1145/2332432.2332487.
  28. Thomas Kesselheim and Berthold Vöcking. Distributed contention resolution in wireless networks. In Proc. of the 24th International Symposium on Distributed Computing (DISC), volume 6343 of Lecture Notes in Computer Science, pages 163-178. Springer-Verlag, Berlin, 2010. URL: https://doi.org/10.1007/978-3-642-15763-9_16.
  29. Jon Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 163-170, 2000. URL: https://doi.org/10.1145/335305.335325.
  30. Dariusz R. Kowalski, Miguel A. Mosteiro, and Tevin Rouse. Dynamic multiple-message broadcast: bounding throughput in the affectance model. In 10th ACM International Workshop on Foundations of Mobile Computing, FOMC 2014, Philadelphia, PA, USA, August 11, 2014, pages 39-46, 2014. URL: https://doi.org/10.1145/2634274.2634279.
  31. Dariusz R. Kowalski, Miguel A. Mosteiro, and Kevin Zaki. Dynamic multiple-message broadcast: Bounding throughput in the affectance model. Theory Comput. Syst., 67(4):825-854, 2023. URL: https://doi.org/10.1007/S00224-023-10131-1.
  32. Zewen Liu, Guancheng Wan, B Aditya Prakash, Max SY Lau, and Wei Jin. A review of graph neural networks in epidemic modeling. arXiv preprint, 2024. URL: https://arxiv.org/abs/2403.19852.
  33. Nancy Lynch and Calvin Newport. A (truly) local broadcast layer for unreliable radio networks. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC'15), pages 109-118, 2015. URL: https://doi.org/10.1145/2767386.2767411.
  34. Nicolò Malucelli. Neighboring-based strategies for multi-agent reinforcement learning. Master’s thesis, Universita di Bologna, 2024. Google Scholar
  35. Hangyu Mao, Wulong Liu, Jianye Hao, Jun Luo, Dong Li, Zhengchao Zhang, Jun Wang, and Zhen Xiao. Neighborhood cognition consistent multi-agent reinforcement learning. In Proceedings of the AAAI conference on artificial intelligence, volume 34(5), pages 7219-7226, 2020. URL: https://doi.org/10.1609/AAAI.V34I05.6212.
  36. Melissa B Miller and Bonnie L Bassler. Quorum sensing in bacteria. Annual Reviews in Microbiology, 55(1):165-199, 2001. Google Scholar
  37. Michael Mitzenmacher and Eli Upfal. Probability and Computing. Cambridge University Press, 2005. Google Scholar
  38. Stefany Moreno-Gámez, Michael E Hochberg, and GS Van Doorn. Quorum sensing as a mechanism to harness the wisdom of the crowds. Nature communications, 14(1):3415, 2023. Google Scholar
  39. Afshin Oroojlooy and Davood Hajinezhad. A review of cooperative multi-agent deep reinforcement learning. Applied Intelligence, 53(11):13677-13722, 2023. URL: https://doi.org/10.1007/S10489-022-04105-Y.
  40. Christopher M Waters and Bonnie L Bassler. Quorum sensing: cell-to-cell communication in bacteria. Annu. Rev. Cell Dev. Biol., 21(1):319-346, 2005. Google Scholar
  41. Shike Yang, Ziming He, Jingchen Li, Haobin Shi, Qingbing Ji, Kao-Shing Hwang, and Xianshan Li. Neighborhood curiosity-based exploration in multi-agent reinforcement learning. IEEE Transactions on Cognitive and Developmental Systems, 2024. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact