Document Open Access Logo

Protecting Single-Hop Radio Networks from Message Drops

Authors Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2023.53.pdf
  • Filesize: 0.78 MB
  • 20 pages

Document Identifiers

Author Details

Klim Efremenko
  • Ben-Gurion University, Beer Sheva, Israel
Gillat Kol
  • Princeton University, NJ, USA
Dmitry Paramonov
  • Princeton University, NJ, USA
Raghuvansh R. Saxena
  • Microsoft Research, Cambridge, MA, USA

Funding

  • Efremenko, Klim: Supported by the Israel Science Foundation (ISF) through grant No. 1456/18 and European Research Council Grant number: 949707.
  • Kol, Gillat: Supported by a National Science Foundation CAREER award CCF-1750443 and by a BSF grant No. 2018325.

Cite AsGet BibTex

Klim Efremenko, Gillat Kol, Dmitry Paramonov, and Raghuvansh R. Saxena. Protecting Single-Hop Radio Networks from Message Drops. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 53:1-53:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ICALP.2023.53

Abstract

Single-hop radio networks (SHRN) are a well studied abstraction of communication over a wireless channel. In this model, in every round, each of the n participating parties may decide to broadcast a message to all the others, potentially causing collisions. We consider the SHRN model in the presence of stochastic message drops (i.e., erasures), where in every round, the message received by each party is erased (replaced by ⊥) with some small constant probability, independently. Our main result is a constant rate coding scheme, allowing one to run protocols designed to work over the (noiseless) SHRN model over the SHRN model with erasures. Our scheme converts any protocol Π of length at most exponential in n over the SHRN model to a protocol Π' that is resilient to constant fraction of erasures and has length linear in the length of Π. We mention that for the special case where the protocol Π is non-adaptive, i.e., the order of communication is fixed in advance, such a scheme was known. Nevertheless, adaptivity is widely used and is known to hugely boost the power of wireless channels, which makes handling the general case of adaptive protocols Π both important and more challenging. Indeed, to the best of our knowledge, our result is the first constant rate scheme that converts adaptive protocols to noise resilient ones in any multi-party model.

Subject Classification

ACM Subject Classification
  • Theory of computation → Communication complexity
Keywords
  • Radio Networks
  • Interactive Coding
  • Error Correcting Codes

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, and Bernhard Haeupler. Reliable communication over highly connected noisy networks. In Symposium on Principles of Distributed Computing (DISC), pages 165-173. ACM, 2016. Google Scholar
  2. Yagel Ashkenazi, Ran Gelles, and Amir Leshem. Brief announcement: Noisy beeping networks. In Symposium on Principles of Distributed Computing (PODC), pages 458-460, 2020. Google Scholar
  3. Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences, 45(1):104-126, 1992. Google Scholar
  4. Mark Braverman, Klim Efremenko, Ran Gelles, and Bernhard Haeupler. Constant-rate coding for multiparty interactive communication is impossible. In Symposium on Theory of Computing (STOC), pages 999-1010. ACM, 2016. Google Scholar
  5. Keren Censor-Hillel, Bernhard Haeupler, D Ellis Hershkowitz, and Goran Zuzic. Broadcasting in noisy radio networks. In Symposium on Principles of Distributed Computing (PODC), pages 33-42, 2017. Google Scholar
  6. Keren Censor-Hillel, Bernhard Haeupler, D Ellis Hershkowitz, and Goran Zuzic. Erasure correction for noisy radio networks. In International Symposium on Distributed Computing (DISC), 2019. Google Scholar
  7. Imrich Chlamtac and Shay Kutten. On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Communications, 33(12):1240-1246, 1985. Google Scholar
  8. Klim Efremenko, Gillat Kol, Dmitry Paramonov, and Raghuvansh R. Saxena. Computation over the noisy broadcast channel with malicious parties. In Innovations in Theoretical Computer Science Conference, (ITCS), volume 185, pages 82:1-82:19, 2021. Google Scholar
  9. Klim Efremenko, Gillat Kol, Dmitry Paramonov, and Raghuvansh R. Saxena. Tight bounds for general computation in noisy broadcast networks. In Symposium on Foundations of Computer Science (FOCS), pages 634-645, 2021. Google Scholar
  10. Klim Efremenko, Gillat Kol, and Raghuvansh Saxena. Interactive coding over the noisy broadcast channel. In Symposium on Theory of Computing (STOC), pages 507-520. ACM, 2018. Google Scholar
  11. Klim Efremenko, Gillat Kol, and Raghuvansh Saxena. Radio network coding requires logarithmic overhead. In Foundations of Computer Science (FOCS), pages 348-369, 2019. Google Scholar
  12. Klim Efremenko, Gillat Kol, and Raghuvansh R. Saxena. Noisy beeps. In Yuval Emek and Christian Cachin, editors, Symposium on Principles of Distributed Computing (PODC), pages 418-427, 2020. Google Scholar
  13. Uriel Feige and Joe Kilian. Finding OR in a noisy broadcast network. Information Processing Letters, 73(1-2):69-75, 2000. Google Scholar
  14. Robert G. Gallager. Finding parity in a simple broadcast network. IEEE Transactions on Information Theory, 34(2):176-180, 1988. Google Scholar
  15. Abbas El Gamal. Open problems presented at the 1984 workshop on specific problems in communication and computation sponsored by bell communication research. "Open Problems in Communication and Computation", by Thomas M. Cover and B. Gopinath (editors). Springer-Verlag, 1987. Google Scholar
  16. Ran Gelles and Yael T Kalai. Constant-rate interactive coding is impossible, even in constant-degree networks. IEEE Transactions on Information Theory, 65(6):3812-3829, 2019. Google Scholar
  17. Ran Gelles, Yael Tauman Kalai, and Govind Ramnarayan. Efficient multiparty interactive coding for insertions, deletions, and substitutions. In Symposium on Principles of Distributed Computing (PODC), pages 137-146, 2019. Google Scholar
  18. Navin Goyal, Guy Kindler, and Michael Saks. Lower bounds for the noisy broadcast problem. SIAM Journal on Computing, 37(6):1806-1841, 2008. Google Scholar
  19. Ofer Grossman, Bernhard Haeupler, and Sidhanth Mohanty. Algorithms for noisy broadcast with erasures. In Colloquium on Automata, Languages, and Programming (ICALP), volume 107 of LIPIcs, pages 153:1-153:12, 2018. Google Scholar
  20. William M. Hoza and Leonard J. Schulman. The adversarial noise threshold for distributed protocols. In Symposium on Discrete Algorithms (SODA), pages 240-258, 2016. Google Scholar
  21. Abhishek Jain, Yael Tauman Kalai, and Allison Bishop Lewko. Interactive coding for multiparty protocols. In Symposium on Theory of computing (STOC), pages 1-10, 2015. Google Scholar
  22. Eyal Kushilevitz and Yishay Mansour. Computation in noisy radio networks. SIAM Journal on Discrete Mathematics (SIDMA), 19(1):96-108, 2005. Google Scholar
  23. Ilan Newman. Computing in fault tolerance broadcast networks. In Computational Complexity Conference (CCC), pages 113-122, 2004. Google Scholar
  24. Sridhar Rajagopalan and Leonard J. Schulman. A coding theorem for distributed computation. In Symposium on the Theory of Computing (STOC), pages 790-799, 1994. Google Scholar
  25. Leonard J Schulman. Communication on noisy channels: A coding theorem for computation. In Foundations of Computer Science (FOCS), pages 724-733. IEEE, 1992. Google Scholar
  26. Leonard J Schulman. Deterministic coding for interactive communication. In Symposium on Theory of computing (STOC), pages 747-756. ACM, 1993. Google Scholar
  27. Andrew Chi-Chih Yao. On the complexity of communication under noise. invited talk in the 5th ISTCS Conference, 1997. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

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