Leader election in multi-hop radio networks

Theoretical Computer Science - Tập 792 - Trang 2-11 - 2019
Artur Czumaj1, Peter Davies1
1Department of Computer Science, Centre for Discrete Mathematics and its Applications, University of Warwick, United Kingdom

Tài liệu tham khảo

Alon, 1991, A lower bound for radio broadcast, J. Comput. Syst. Sci., 43, 290, 10.1016/0022-0000(91)90015-W Bar-Yehuda, 1991, Efficient emulation of single-hop radio network with collision on multi-hop radio network with no collision detection, Distrib. Comput., 5, 67, 10.1007/BF02259748 Bar-Yehuda, 1992, On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization, J. Comput. Syst. Sci., 45, 104, 10.1016/0022-0000(92)90042-H Chlebus, 2002, Deterministic broadcasting in unknown radio networks, Distrib. Comput., 15, 27, 10.1007/s446-002-8028-1 Chlebus, 2012, Electing a leader in multi-hop radio networks, 106 Chrobak, 2002, Fast broadcasting and gossiping in radio networks, J. Algorithms, 43, 177, 10.1016/S0196-6774(02)00004-4 Chrobak, 2007, The wake-up problem in multihop radio networks, SIAM J. Comput., 36, 1453, 10.1137/S0097539704442726 Clementi, 2003, Distributed broadcasting in radio networks of unknown topology, Theor. Comput. Sci., 302, 337, 10.1016/S0304-3975(02)00851-4 Cornejo, 2010, Deploying wireless networks with beeps, 148 Czumaj, 2015, Communicating with beeps, 30:1 Czumaj, 2018, Brief announcement: randomized blind radio networks Czumaj, 2006, Broadcasting algorithms in radio networks with unknown topology, J. Algorithms, 60, 115, 10.1016/j.jalgor.2004.08.001 Förster, 2014, Deterministic leader election in multi-hop beeping networks, 212 Ghaffari, 2013, Near optimal leader election in multi-hop radio networks, 748 Ghaffari, 2012, Leader election using loneliness detection, Distrib. Comput., 25, 427, 10.1007/s00446-012-0172-x Greenberg, 1985, A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels, J. ACM, 32, 589, 10.1145/3828.214125 Kowalski, 2005, Broadcasting in undirected ad hoc radio networks, Distrib. Comput., 18, 43, 10.1007/s00446-005-0126-7 Kowalski, 2013, Leader election in ad hoc radio networks: a keen ear helps, J. Comput. Syst. Sci., 79, 1164, 10.1016/j.jcss.2013.04.003 Kushilevitz, 1998, An Ω(Dlog⁡(N/D)) lower bound for broadcast in radio networks, SIAM J. Comput., 27, 702, 10.1137/S0097539794279109 Nakano, 2002, Uniform leader election protocols for radio networks, IEEE Trans. Parallel Distrib. Syst., 13, 516, 10.1109/TPDS.2002.1003864 Peleg, 2007, Time-efficient broadcasting in radio networks: A review, 1 Willard, 1986, Log-logarithmic selection resolution protocols in a multiple access channel, SIAM J. Comput., 15, 468, 10.1137/0215032