Magnús M. Halldórsson
Tigran Tonoyan
Skip Abstract Section
Abstract
We develop randomized distributed algorithms for many of the most fundamental communication problems in wireless networks under the Signal to Interference and Noise Ratio (SINR) model of communication, including (multi-message) broadcast, local broadcast, coloring, Maximal Independent Set, and aggregation. The complexity of our algorithms is optimal up to polylogarithmic preprocessing time. It shows—contrary to expectation—that the plain vanilla SINR model is just as powerful and fast (modulo the preprocessing) as various extensions studied, including power control, carrier sense, collision detection, free acknowledgements, and geolocation knowledge. Central to these results is an efficient construction of a constant-density backbone structure over the network, which is of independent interest. This is achieved using an indirect sensing technique, where message non-reception is used to deduce information about relative node-distances.
- Noga Alon, Amotz Bar-Noy, Nathan Linial, and David Peleg. 1991. A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 2 (1991), 290–298. DOI:https://doi.org/10.1016/0022-0000(91)90015-WGoogle Scholar
Digital Library
- Leonid Barenboim and David Peleg. 2015. Nearly optimal local broadcasting in the SINR model with feedback. In Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO’15), Christian Scheideler (Ed.), Lecture Notes in Computer Science, Vol. 9439. Springer, 164–178. DOI:https://doi.org/10.1007/978-3-319-25258-2_12Google Scholar
- Marijke H. L. Bodlaender, Magnús M. Halldórsson, and Pradipta Mitra. 2013. Connectivity and aggregation in multihop wireless networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC’13), Panagiota Fatourou and Gadi Taubenfeld (Eds.). ACM, 355–364. DOI:https://doi.org/10.1145/2484239.2484265Google ScholarDigital Library
- Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, and Goran Zuzic. 2019. Erasure correction for noisy radio networks. In Proceedings of the 33rd International Symposium on Distributed Computing (DISC’19), Jukka Suomela (Ed.), LIPIcs,Vol. 146. Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 10:1–10:17. DOI:https://doi.org/10.4230/LIPIcs.DISC.2019.10Google Scholar
- Imrich Chlamtac and Shay Kutten. 1985. On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Commun. 33, 12 (1985), 1240–1246. DOI:https://doi.org/10.1109/TCOM.1985.1096245Google ScholarCross Ref
- Bogdan S. Chlebus and Shailesh Vaya. 2016. Distributed communication in bare-bones wireless networks. In Proceedings of the 17th International Conference on Distributed Computing and Networking. ACM, 1:1–1:10. DOI:https://doi.org/10.1145/2833312.2833454Google Scholar
- Sebastian Daum, Seth Gilbert, Fabian Kuhn, and Calvin C. Newport. 2013. Broadcast in the ad hoc SINR model. In Proceedings of the 27th International Symposium on Distributed Computing (DISC’13), Yehuda Afek (Ed.), Lecture Notes in Computer Science,Vol. 8205. Springer, 358–372. DOI:https://doi.org/10.1007/978-3-642-41527-2_25Google Scholar
- Bilel Derbel and El-Ghazali Talbi. 2010. Radio network distributed algorithms in the unknown neighborhood model. In Proceedings of the 11th International Conference on Distributed Computing and Networking (ICDCN’10), Krishna Kant, Sriram V. Pemmaraju, Krishna M. Sivalingam, and Jie Wu (Eds.), Lecture Notes in Computer Science, Vol. 5935. Springer, 155–166. DOI:https://doi.org/10.1007/978-3-642-11322-2_18Google ScholarCross Ref
- Benjamin Doerr. 2020. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. Springer International Publishing, Cham, 1–87. DOI:https://doi.org/10.1007/978-3-030-29414-4_1Google Scholar
- Jeremy T. Fineman, Seth Gilbert, Fabian Kuhn, and Calvin Newport. 2019. Contention resolution on a fading channel. Distrib. Comput. 32, 6 (2019), 517–533. DOI:https://doi.org/10.1007/s00446-018-0323-9Google ScholarCross Ref
- Fabian Fuchs and Roman Prutkin. 2015. Simple distributed Δ + 1 Coloring in the SINR Model. In Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO’15), Christian Scheideler (Ed.), Lecture Notes in Computer Science, Vol. 9439. Springer, 149–163. DOI:https://doi.org/10.1007/978-3-319-25258-2_11Google Scholar
- Mohsen Ghaffari, Bernhard Haeupler, and Majid Khabbazian. 2015. Randomized broadcast in radio networks with collision detection. Distrib. Comput. 28, 6 (2015), 407–422. DOI:https://doi.org/10.1007/s00446-014-0230-7Google ScholarDigital Library
- Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, and Calvin C. Newport. 2012. Bounds on contention management in radio networks. In Proceedings of the 26th International Symposium on Distributed Computing (DISC’12), Marcos K. Aguilera (Ed.), Lecture Notes in Computer Science,Vol. 7611. Springer, 223–237. DOI:https://doi.org/10.1007/978-3-642-33651-5_16Google Scholar
- Wayne Goddard and Michael A. Henning. 2013. Independent domination in graphs: A survey and recent results. Discr. Math. 313, 7 (2013), 839–854. DOI:https://doi.org/10.1016/j.disc.2012.11.031Google ScholarCross Ref
- Olga Goussevskaia, Thomas Moscibroda, and Roger Wattenhofer. 2008. Local broadcasting in the physical interference model. In Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Michael Segal and Alexander Kesselman (Eds.). ACM, 35–44. DOI:https://doi.org/10.1145/1400863.1400873Google ScholarDigital Library
- Piyush Gupta and P. R. Kumar. 2000. The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 2 (2000), 388–404. DOI:https://doi.org/10.1109/18.825799Google ScholarDigital Library
- Magnús M. Halldórsson, Stephan Holzer, and Nancy A. Lynch. 2015. A local broadcast layer for the SINR network model. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC’15), Chryssis Georgiou and Paul G. Spirakis (Eds.). ACM, 129–138. DOI:https://doi.org/10.1145/2767386.2767432Google Scholar
- Magnús M. Halldórsson, Fabian Kuhn, Nancy A. Lynch, and Calvin Newport. 2017. An efficient communication abstraction for dense wireless networks. In Proceedings of the 31st International Symposium on Distributed Computing (DISC’17), Andréa W. Richa (Ed.), LIPIcs,Vol. 91. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 25:1–25:16. DOI:https://doi.org/10.4230/LIPIcs.DISC.2017.25Google Scholar
- Magnús M. Halldórsson and Pradipta Mitra. 2012. Towards tight bounds for local broadcasting. In Proceedings of the 8th ACM International Workshop on Foundations of Mobile Computing (part of FOMC’12), Fabian Kuhn and Calvin C. Newport (Eds.). ACM, 2. DOI:https://doi.org/10.1145/2335470.2335472Google Scholar
- Magnús M. Halldórsson and Tigran Tonoyan. 2018. Leveraging indirect signaling for topology inference and fast broadcast. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (PODC’18), Calvin Newport and Idit Keidar (Eds.). ACM, 85–93. DOI:https://doi.org/10.1145/3212734.3212766Google Scholar
- Magnús M. Halldórsson and Tigran Tonoyan. 2019. Plain SINR is enough! In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC’19), Peter Robinson and Faith Ellen (Eds.). ACM, 127–136. DOI:https://doi.org/10.1145/3293611.3331602Google Scholar
- Dorit S. Hochbaum and David B. Shmoys. 1986. A unified approach to approximation algorithms for bottleneck problems. J. ACM 33, 3 (1986), 533–550. DOI:https://doi.org/10.1145/5925.5933Google ScholarDigital Library
- Tomasz Jurdzinski and Dariusz R. Kowalski. 2012. Distributed backbone structure for algorithms in the SINR model of wireless networks. In Proceedings of the 26th International Symposium on Distributed Computing (DISC’12), Marcos K. Aguilera (Ed.), Lecture Notes in Computer Science,Vol. 7611. Springer, 106–120. DOI:https://doi.org/10.1007/978-3-642-33651-5_8Google ScholarCross Ref
- Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, and Grzegorz Stachowiak. 2013. Distributed randomized broadcasting in wireless networks under the SINR model. In Proceedings of the 27th International Symposium on Distributed Computing (DISC’13), Yehuda Afek (Ed.), Lecture Notes in Computer Science,Vol. 8205. Springer, 373–387. DOI:https://doi.org/10.1007/978-3-642-41527-2_26Google ScholarDigital Library
- Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, and Grzegorz Stachowiak. 2014. On the impact of geometry on ad hoc communication in wireless networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC’14), Magnús M. Halldórsson and Shlomi Dolev (Eds.). ACM, 357–366. DOI:https://doi.org/10.1145/2611462.2611487Google ScholarDigital Library
- Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, and Grzegorz Stachowiak. 2018. Deterministic digital clustering of wireless ad hoc networks. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (PODC’18), Calvin Newport and Idit Keidar (Eds.). ACM, 105–114. DOI:https://doi.org/10.1145/3212734.3212752Google ScholarDigital Library
- Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski, and Grzegorz Stachowiak. 2020. Token traversal in ad hoc wireless networks via implicit carrier sensing. Theor. Comput. Sci. 811 (2020), 3–20. DOI:https://doi.org/10.1016/j.tcs.2019.09.016Special issue on Structural Information and Communication Complexit.Google ScholarCross Ref
- Tomasz Jurdzinski, Dariusz R. Kowalski, and Grzegorz Stachowiak. 2013. Distributed deterministic broadcasting in uniform-power ad hoc wireless networks. In Proceedings of the 19th International Symposium on Fundamentals of Computation Theory (FCT’13), Leszek Gasieniec and Frank Wolter (Eds.), Lecture Notes in Computer Science, Vol. 8070. Springer, 195–209. DOI:https://doi.org/10.1007/978-3-642-40164-0_20Google ScholarDigital Library
- Eyal Kushilevitz and Yishay Mansour. 1998. An omega(D log (N/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 3 (1998), 702–712. DOI:https://doi.org/10.1137/S0097539794279109Google ScholarDigital Library
- Thomas Moscibroda and Roger Wattenhofer. 2005. Maximal independent sets in radio networks. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC’05), Marcos Kawazoe Aguilera and James Aspnes (Eds.). ACM, 148–157. DOI:https://doi.org/10.1145/1073814.1073842Google ScholarDigital Library
- Thomas Moscibroda and Roger Wattenhofer. 2008. Coloring unstructured radio networks. Distrib. Comput. 21, 4 (2008), 271–284. DOI:https://doi.org/10.1007/s00446-008-0070-4Google ScholarDigital Library
- Calvin C. Newport. 2014. Radio network lower bounds made easy. In Proceedings of the 28th International Symposium on Distributed Computing (DISC’14), Fabian Kuhn (Ed.), Lecture Notes in Computer Science,Vol. 8784. Springer, 258–272. DOI:https://doi.org/10.1007/978-3-662-45174-8_18Google ScholarCross Ref
- David Peleg. 2000. Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA.Google ScholarCross Ref
- Christian Scheideler, Andréa W. Richa, and Paolo Santi. 2008. An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’08), Xiaohua Jia, Ness B. Shroff, and Peng-Jun Wan (Eds.). ACM, 91–100. DOI:https://doi.org/10.1145/1374618.1374632Google ScholarDigital Library
- Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, and Francis C. M. Lau. 2012. An O(log n) distributed approximation algorithm for local broadcasting in unstructured wireless networks. In Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems (DCOSS’12). IEEE Computer Society, 132–139. DOI:https://doi.org/10.1109/DCOSS.2012.39Google Scholar
- Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Haisheng Tan, and Francis C. M. Lau. 2012. 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’12), Guy Even and Magnús M. Halldórsson (Eds.), Lecture Notes in Computer Science,Vol. 7355. Springer, 111–122. DOI:https://doi.org/10.1007/978-3-642-31104-8_10Google ScholarCross Ref
- Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Haisheng Tan, and Francis C. M. Lau. 2016. Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model. Theor. Comput. Sci. 610 (2016), 182–191. DOI:https://doi.org/10.1016/j.tcs.2014.06.043Google ScholarDigital Library
- Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, and Francis C. M. Lau. 2014. Distributed (Δ + 1)-coloring in the physical model. Theor. Comput. Sci. 553 (2014), 37–56. DOI:https://doi.org/10.1016/j.tcs.2014.05.016Google ScholarDigital Library
- Dongxiao Yu, Yuexuan Wang, Tigran Tonoyan, and Magnús M. Halldórsson. 2017. Dynamic adaptation in wireless networks under comprehensive interference via carrier sense. In Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS’17). IEEE Computer Society, 337–346. DOI:https://doi.org/10.1109/IPDPS.2017.78Google Scholar
Index Terms
- Sparse Backbone and Optimal Distributed SINR Algorithms
Recommendations
Plain SINR is Enough!
PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed ComputingWe develop randomized distributed algorithms for many of the most fundamental communication problems in the wireless SINR model, including (multi-message) broadcast, local broadcast, coloring, MIS, and aggregation. The complexity of the algorithms is ...
Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model
In a multiple-message broadcast, an arbitrary number of messages originate at arbitrary nodes in the network at arbitrary times. The problem is to disseminate all these messages to the whole network. This paper gives the first randomized distributed ...
Distributed wireless link scheduling in the SINR model
We present an approximation algorithm for wireless link scheduling under the physical SINR interference model. In the link scheduling problem, it is given a set of $$n$$n links in a metric space, each of which is a sender---receiver pair, and the ...
Comments