Document Open Access Logo

Erasure Correction for Noisy Radio Networks

Authors Keren Censor-Hillel , Bernhard Haeupler , D. Ellis Hershkowitz , Goran Zuzic

PDF
Thumbnail PDF

File

LIPIcs.DISC.2019.10.pdf
  • Filesize: 0.59 MB
  • 17 pages

Document Identifiers

Author Details

Keren Censor-Hillel
  • Technion, Haifa, Israel
Bernhard Haeupler
  • Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA
D. Ellis Hershkowitz
  • Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA
Goran Zuzic
  • Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA

Funding

Supported in part by NSF grants CCF-1527110, CCF-1618280, CCF-1814603, CCF-1910588, NSF CAREER award CCF-1750808 and a Sloan Research Fellowship.
  • Censor-Hillel, Keren: Supported in part by the Israel Science Foundation (grant 1696/14), the Binational Science Foundation (grant 2015803) and the European Union’s Horizon 2020 Research and Innovation Programme under grant agreement no. 755839.
  • Zuzic, Goran: Supported in part by DFINITY Scholarship Program.

Cite AsGet BibTex

Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, and Goran Zuzic. Erasure Correction for Noisy Radio Networks. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 10:1-10:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.DISC.2019.10

Abstract

The radio network model is a well-studied model of wireless, multi-hop networks. However, radio networks make the strong assumption that messages are delivered deterministically. The recently introduced noisy radio network model relaxes this assumption by dropping messages independently at random. In this work we quantify the relative computational power of noisy radio networks and classic radio networks. In particular, given a non-adaptive protocol for a fixed radio network we show how to reliably simulate this protocol if noise is introduced with a multiplicative cost of poly(log Delta, log log n) rounds where n is the number nodes in the network and Delta is the max degree. Moreover, we demonstrate that, even if the simulated protocol is not non-adaptive, it can be simulated with a multiplicative O(Delta log ^2 Delta) cost in the number of rounds. Lastly, we argue that simulations with a multiplicative overhead of o(log Delta) are unlikely to exist by proving that an Omega(log Delta) multiplicative round overhead is necessary under certain natural assumptions.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed computing models
  • Theory of computation → Distributed algorithms
  • Theory of computation → Graph algorithms analysis
Keywords
  • radio networks
  • erasure correction
  • noisy radio networks
  • protocol simulation
  • distributed computing models

Metrics

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

Related Versions

References

  1. R. Ahlswede, Ning Cai, S. Y.R. Li, and R. W. Yeung. Network Information Flow. IEEE Transactions on Information Theory, 46(4):1204-1216, September 2006. Google Scholar
  2. Noga Alon, Amotz Bar-Noy, Nathan Linial, and David Peleg. A lower bound for radio broadcast. Journal of Computer and System Sciences, 43(2):290-298, 1991. Google Scholar
  3. Hagit Attiya and Jennifer Welch. Distributed Computing. Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, 1998. Google Scholar
  4. Baruch Awerbuch. Complexity of network synchronization. Journal of the ACM (JACM), 32(4):804-823, October 1985. Google Scholar
  5. Baruch Awerbuch and David Peleg. Network synchronization with polylogarithmic overhead. In Annual ACM Symposium on Theory of Computing (STOC), 1990. Google Scholar
  6. 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
  7. Ziv Bar-Yossef, Yitzhak Birk, TS Jayram, and Tomer Kol. Index coding with side information. IEEE Transactions on Information Theory, 57(3):1479-1494, 2011. Google Scholar
  8. Mark Braverman, Klim Efremenko, Ran Gelles, and Bernhard Haeupler. Constant-rate coding for multiparty interactive communication is impossible. Journal of the ACM (JACM), 65(1):4, 2017. Google Scholar
  9. Keren Censor-Hillel, Ran Gelles, and Bernhard Haeupler. Making Asynchronous Distributed Computations Robust to Channel Noise. In Innovations in Theoretical Computer Science Conference (ITCS), pages 50:1-50:20, 2018. Google Scholar
  10. Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, and Calvin C. Newport. Structuring unreliable radio networks. Distributed Computing, 27(1):1-19, 2014. Google Scholar
  11. Keren Censor-Hillel, Bernhard Haeupler, D Ellis Hershkowitz, and Goran Zuzic. Broadcasting in Noisy Radio Networks. In ACM Symposium on Principles of Distributed Computing (PODC), 2017. Google Scholar
  12. Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, and Petar Maymounkov. Rumor Spreading with No Dependence on Conductance. SIAM Journal on Computing (SICOMP), 46(1):58-79, 2017. Google Scholar
  13. I. Chlamtac and S. Kutten. On Broadcasting in Radio Networks - Problem Analysis and Protocol Design. IEEE Transactions on Communications, 33(12):1240-1246, December 1985. Google Scholar
  14. Artur Czumaj and Wojciech Rytter. Broadcasting algorithms in radio networks with unknown topology. Journal of Algorithms, 60(2):115-143, 2006. Google Scholar
  15. Klim Efremenko, Gillat Kol, and Raghuvansh Saxena. Interactive coding over the noisy broadcast channel. In Annual ACM Symposium on Theory of Computing (STOC), pages 507-520. ACM, 2018. Google Scholar
  16. Abbas El-Gamal. Open problems presented at the 1984 workshop on specific problems in communication and computation. Sponsored by bell communication research, 1984. Google Scholar
  17. Moncef Elaoud and Parameswaran Ramanathan. Adaptive use of error-correcting codes for real-time communication in wireless networks. In INFOCOM, volume 2, pages 548-555, 1998. Google Scholar
  18. Robert G. Gallager. Finding parity in a simple broadcast network. IEEE Transactions on Information Theory, 34(2):176-180, 1988. Google Scholar
  19. Ran Gelles et al. Coding for interactive communication: A survey. Foundations and Trends in Theoretical Computer Science, 13(1-2):1-157, 2017. Google Scholar
  20. Mohsen Ghaffari, Bernhard Haeupler, and Majid Khabbazian. Randomized broadcast in radio networks with collision detection. Distributed Computing, 28(6):407-422, 2015. Google Scholar
  21. Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, and Calvin C. Newport. Bounds on Contention Management in Radio Networks. In Distributed Computing (DISC), pages 223-237, 2012. Google Scholar
  22. Mohsen Ghaffari, Erez Kantor, Nancy Lynch, and Calvin Newport. Multi-message broadcast with abstract mac layers and unreliable links. In ACM Symposium on Principles of Distributed Computing (PODC), pages 56-65, 2014. Google Scholar
  23. Mohsen Ghaffari, Nancy A. Lynch, and Calvin C. Newport. The cost of radio network broadcast for different models of unreliable links. In ACM Symposium on Principles of Distributed Computing (PODC), pages 345-354, 2013. Google Scholar
  24. Seth Gilbert, Rachid Guerraoui, Dariusz R Kowalski, and Calvin Newport. Interference-resilient information exchange. In INFOCOM, 2009. Google Scholar
  25. Leszek Gąsieniec, David Peleg, and Qin Xin. Faster communication in known topology radio networks. Distributed Computing, 19(4):289-300, 2007. Google Scholar
  26. Navin Goyal, Guy Kindler, and Michael E. Saks. Lower Bounds for the Noisy Broadcast Problem. SIAM Journal on Computing (SICOMP), 37(6):1806-1841, 2008. Google Scholar
  27. Bernhard Haeupler. Interactive channel capacity revisited. In Symposium on Foundations of Computer Science (FOCS), pages 226-235, 2014. Google Scholar
  28. Bernhard Haeupler and David Wajc. A faster distributed radio broadcast primitive. In ACM Symposium on Principles of Distributed Computing (PODC), pages 361-370, 2016. Google Scholar
  29. Magnus M Halldorsson and Tigran Tonoyan. Plain SINR is Enough! In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 127-136. ACM, 2019. Google Scholar
  30. Majid Khabbazian, Dariusz R Kowalski, Fabian Kuhn, and Nancy Lynch. Decomposing broadcast algorithms using abstract MAC layers. Ad Hoc Networks, 12:219-242, 2014. Google Scholar
  31. Dariusz R Kowalski and Andrzej Pelc. Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science, 333(3):355-371, 2005. Google Scholar
  32. Dariusz R. Kowalski and Andrzej Pelc. Optimal Deterministic Broadcasting in Known Topology Radio Networks. Distributed Computing, 19(3):185-195, 2007. Google Scholar
  33. Evangelos Kranakis, Danny Krizanc, and Andrzej Pelc. Fault-tolerant broadcasting in radio networks. In Annual European Symposium on Algorithms (ESA), pages 283-294, 1998. Google Scholar
  34. Evangelos Kranakis, Michel Paquette, and Andrzej Pelc. Communication in random geometric radio networks with positively correlated random faults. In International Conference on Ad-Hoc Networks and Wireless, pages 108-121. Springer, 2008. Google Scholar
  35. Fabian Kuhn, Nancy Lynch, and Calvin Newport. The abstract MAC layer. In Distributed Computing (DISC), pages 48-62, 2009. Google Scholar
  36. Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Rotem Oshman, and Andréa W. Richa. Broadcasting in unreliable radio networks. In ACM Symposium on Principles of Distributed Computing (PODC), pages 336-345, 2010. Google Scholar
  37. Eyal Kushilevitz and Yishay Mansour. An Omega(D Log(N/D)) Lower Bound for Broadcast in Radio Networks. In ACM Symposium on Principles of Distributed Computing (PODC), 1993. Google Scholar
  38. Eyal Kushilevitz and Yishay Mansour. Computation in Noisy Radio Networks. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), volume 98, pages 236-243, 1998. Google Scholar
  39. Krijn Leentvaar and Jan Flint. The capture effect in FM receivers. IEEE Transactions on Communications, 24(5):531-539, 1976. Google Scholar
  40. Ilan Newman. Computing in Fault Tolerance Broadcast Networks. In IEEE Conference on Computational Complexity (CCC), pages 113-122, 2004. Google Scholar
  41. David Peleg. Time-Efficient Broadcasting in Radio Networks: A Review, pages 1-18. Springer Berlin Heidelberg, 2007. Google Scholar
  42. Sridhar Rajagopalan and Leonard Schulman. A coding theorem for distributed computation. In Annual ACM Symposium on Theory of Computing (STOC), pages 790-799, 1994. Google Scholar
  43. Andréa W Richa and Christian cheideler. Jamming-Resistant MAC Protocols for Wireless Networks. Encyclopedia of Algorithms, pages 1-5, 2008. Google Scholar
  44. Leonard J Schulman. Coding for interactive communication. IEEE Transactions on Information Theory, 42(6):1745-1756, 1996. Google Scholar
  45. Stephen B. Wicker. Reed-Solomon Codes and Their Applications. IEEE Press, Piscataway, NJ, USA, 1994. 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