Document Open Access Logo

Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks

Authors Haimin Chen, Chaodong Zheng



PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2020.22.pdf
  • Filesize: 0.57 MB
  • 16 pages

Document Identifiers

Author Details

Haimin Chen
  • State Key Laboratory for Novel Software Technology, Nanjing University, China
Chaodong Zheng
  • State Key Laboratory for Novel Software Technology, Nanjing University, China

Acknowledgements

We would like to thank Weiming Feng and Guangxu Yang for the discussions.

Cite AsGet BibTex

Haimin Chen and Chaodong Zheng. Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks. In 24th International Conference on Principles of Distributed Systems (OPODIS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 184, pp. 22:1-22:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.OPODIS.2020.22

Abstract

Broadcasting in wireless networks is vulnerable to adversarial jamming. To thwart such behavior, resource competitive analysis is proposed. In this framework, sending, listening, or jamming on one channel for one time slot costs one unit of energy. The adversary can employ arbitrary strategy to disrupt communication, but has a limited energy budget T. The honest nodes, on the other hand, aim to accomplish broadcast while spending only o(T). Previous work has shown, in a C-channels network containing n nodes, for large T values, each node can receive the message in Õ(T/C) time, while spending only Õ(√{T/n}) energy. However, these multi-channel algorithms only work for certain values of n and C, and can only tolerate an oblivious adversary. In this work, we provide new upper and lower bounds for broadcasting in multi-channel radio networks, from the perspective of resource competitiveness. Our algorithms work for arbitrary n,C values, require minimal prior knowledge, and can tolerate a powerful adaptive adversary. More specifically, in our algorithms, for large T values, each node’s runtime is O(T/C), and each node’s energy cost is Õ(√{T/n}). We also complement algorithmic results with lower bounds, proving both the time complexity and the energy complexity of our algorithms are optimal or near-optimal (within a poly-log factor). Our technical contributions lie in using "epidemic broadcast" to achieve time efficiency and resource competitiveness, and employing coupling techniques in the analysis to handle the adaptivity of the adversary. At the lower bound side, we first derive a new energy complexity lower bound for 1-to-1 communication in the multi-channel setting, and then apply simulation and reduction arguments to obtain the desired result.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Broadcast
  • radio networks
  • resource competitive algorithms

Metrics

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

References

  1. John Augustine, Valerie King, Anisur Molla, Gopal Pandurangan, and Jared Saia. Scalable and secure computation among strangers: Message-competitive byzantine protocols. In International Symposium on Distributed Computing, DISC '20. Springer, 2020. Google Scholar
  2. Baruch Awerbuch, Andrea Richa, and Christian Scheideler. A jamming-resistant mac protocol for single-hop wireless networks. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, PODC '08, pages 45-54. ACM, 2008. 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. M. Bender, J. Fineman, M. Movahedi, J. Saia, V. Dani, S. Gilbert, S. Pettie, and M. Young. Resource-competitive algorithms. SIGACT News, 46(3):57-71, 2015. Google Scholar
  5. Yi-Jun Chang, Varsha Dani, Thomas Hayes, Qizheng He, Wenzheng Li, and Seth Pettie. The energy complexity of broadcast. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC '18, pages 95-104. ACM, 2018. Google Scholar
  6. Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, and Seth Pettie. The energy complexity of bfs in radio networks. In Proceedings of the 39th Symposium on Principles of Distributed Computing, PODC '20, pages 27-282. ACM, 2020. Google Scholar
  7. Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, and Wei Zhan. Exponential separations in the energy complexity of leader election. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC '17, pages 771-783. ACM, 2017. Google Scholar
  8. Haimin Chen and Chaodong Zheng. Fast and resource competitive broadcast in multi-channel radio networks. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '19, pages 179-189. ACM, 2019. Google Scholar
  9. Haimin Chen and Chaodong Zheng. Broadcasting competitively against adaptive adversary in multi-channel radio networks. arXiv, 2020. URL: https://arxiv.org/abs/2001.03936.
  10. Artur Czumaj and Peter Davies. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC '17, pages 3-12. ACM, 2017. Google Scholar
  11. Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, and Calvin Newport. Gossiping in a multi-channel radio network. In International Symposium on Distributed Computing, DISC '07, pages 208-222. Springer Berlin Heidelberg, 2007. Google Scholar
  12. Devdatt Dubhashi and Alessandro Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 2009. Google Scholar
  13. Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, and Chang Su. Energy and time efficient broadcasting in known topology radio networks. In International Symposium on Distributed Computing, DISC '07, pages 253-267. Springer Berlin Heidelberg, 2007. Google Scholar
  14. Mohsen Ghaffari, Bernhard Haeupler, and Majid Khabbazian. Randomized broadcast in radio networks with collision detection. Distributed Computing, 28(6):407-422, 2015. Google Scholar
  15. Seth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia, and Maxwell Young. (near) optimal resource-competitive broadcast with jamming. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, pages 257-266. ACM, 2014. Google Scholar
  16. Ramakrishna Gummadi, David Wetherall, Ben Greenstein, and Srinivasan Seshan. Understanding and mitigating the impact of rf interference on 802.11 networks. In Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM '07, pages 385-396. ACM, 2007. Google Scholar
  17. Marcin Kardas, Marek Klonowski, and Dominik Pajak. Energy-efficient leader election protocols for single-hop radio networks. In 2013 42nd International Conference on Parallel Processing, ICPP '13, pages 399-408. IEEE, 2013. Google Scholar
  18. Valerie King, Seth Pettie, Jared Saia, and Maxwell Young. A resource-competitive jamming defense. Distributed Computing, 31(6):419-439, 2018. Google Scholar
  19. Valerie King, Jared Saia, and Maxwell Young. Conflict on a communication channel. In Proceedings of the 30th ACM Symposium on Principles of Distributed Computing, PODC '11, pages 277-286. ACM, 2011. Google Scholar
  20. Dominic Meier, Yvonne Anne Pignolet, Stefan Schmid, and Roger Wattenhofer. Speed dating despite jammers. In International Conference on Distributed Computing in Sensor Systems, DCOSS '09, pages 1-14. Springer Berlin Heidelberg, 2009. Google Scholar
  21. Joseph Polastre, Robert Szewczyk, and David Culler. Telos: enabling ultra-low power wireless research. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks, IPSN '05, pages 364-369. IEEE, 2005. Google Scholar
  22. Andrea Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. A jamming-resistant mac protocol for multi-hop wireless networks. In International Symposium on Distributed Computing, DISC '10, pages 179-193. Springer Berlin Heidelberg, 2010. 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