Yi-Jun Chang
Ran Duan
Abstract
We consider the energy complexity of the leader election problem in the single-hop radio network model, where each device v has a unique identifier
Much progress has been made in understanding the energy complexity of leader election in radio networks, but very little is known about the tradeoff between time and energy. Chang et al. [STOC 2017] showed that the optimal deterministic energy complexity of leader election is Θ (log log N) if each device can simultaneously transmit and listen but still leaving the problem of determining the optimal time complexity under any given energy constraint.
Time–energy tradeoff: For any k ≥ log log N, we show that a leader among at most n devices can be elected deterministically in O(k ċ n1+ε) + O(k ċ N1/k) time and O(k) energy if each device can simultaneously transmit and listen, where ε > 0 is any small constant. This improves upon the previous O(N)-time O(log log N)-energy algorithm by Chang et al. [STOC 2017]. We provide lower bounds to show that the time–energy tradeoff of our algorithm is near-optimal.
Dense instances: For the dense instances where the number of devices is n = Θ (N), we design a deterministic leader election algorithm using only O(1) energy. This improves upon the O(log* N)-energy algorithm by Jurdziński, Kutyłowski, and Zatopiański [PODC 2002] and the O(α (N))-energy algorithm by Chang et al. [STOC 2017]. More specifically, we show that the optimal deterministic energy complexity of leader election is \(\Theta (\max \lbrace 1, \log \tfrac{N}{n}\rbrace)\) if each device cannot simultaneously transmit and listen, and it is \(Θ (\max \lbrace 1, \log \log \tfrac{N}{n}\rbrace)\) if each device can simultaneously transmit and listen.
- [1] . 1991. A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 2 (1991), 290–298.Google Scholar
Digital Library
- [2] . 2020. Transmitting once to elect a leader on wireless networks. In Proceedings of the 14th Latin American Symposium on Theoretical Informatics (LATIN’20). Springer International Publishing, Cham, 439–450.Google ScholarDigital Library
- [3] . 2022. Brief announcement: Distributed MST computation in the sleeping model: Awake-optimal algorithms and lower bounds. Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (PODC’22, Salerno, Italy), Association for Computing Machinery, New York, NY, 51–53. Distributed MST computation in the sleeping model: Awake-optimal algorithms and lower bounds. arXiv:2204.08385. Retrieved from https://arxiv.org/abs/2204.08385Google ScholarDigital Library
- [4] . 1991. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. Distrib. Comput. 5, 2 (1991), 67–71.Google ScholarDigital Library
- [5] . 1992. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 1 (1992), 104–126.Google ScholarCross Ref
- [6] . 2021. Deterministic logarithmic completeness in the distributed sleeping model. In Proceedings of the 35th International Symposium on Distributed Computing (DISC’21),
Leibniz International Proceedings in Informatics (LIPIcs) , (Ed.), Vol. 209. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 10:1–10:19.DOI: Google ScholarCross Ref - [7] . 2005. Adversarial contention resolution for simple channels. In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’05). Association for Computing Machinery, New York, NY, 325–332.
DOI: Google ScholarDigital Library - [8] . 2016. Contention resolution with log-logstar channel accesses. In Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC’16). Association for Computing Machinery, New York, NY, 499–508.
DOI: Google ScholarDigital Library - [9] . 1979. Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory 25, 5 (1979), 505–515.Google ScholarDigital Library
- [10] . 2018. The energy complexity of broadcast. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC’18). ACM, 95–104.
DOI: Google ScholarDigital Library - [11] . 2019. Exponential separations in the energy complexity of leader election. ACM Trans. Algor. 15, 4, Article
49 (Oct. 2019), 31 pages.DOI: Google ScholarDigital Library - [12] . 2020. The energy complexity of BFS in radio networks. In Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC’20). ACM, 273–282.
DOI: Google ScholarDigital Library - [13] . 2022. The energy complexity of las vegas leader election. In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures. 75–86.Google ScholarDigital Library
- [14] . 2020. Sleeping is efficient: MIS in \(O(1)\)-rounds node-averaged awake complexity. In Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC’20). ACM, 99–108.
DOI: Google ScholarDigital Library - [15] . 2001. Randomized communication in radio networks. Combin. Optim. Dordrecht 9, 1 (2001), 401–456.Google Scholar
- [16] . 2012. Adversarial queuing on the multiple access channel. ACM Trans. Algor. 8, 1 (2012), 1–31.Google ScholarDigital Library
- [17] . 2003. Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302, 1 (2003), 337–364.Google ScholarDigital Library
- [18] . 2017. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC’17). 3–12.
DOI: Google ScholarDigital Library - [19] . 2006. Broadcasting algorithms in radio networks with unknown topology. J. Algor. 60, 2 (2006), 115–143.
DOI: Google ScholarDigital Library - [20] . 2023. Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks. Distributed Computing 36, 3 (2023), 373–384. Google ScholarDigital Library
- [21] . 2015. Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel. SIAM J. Comput. 44, 3 (2015), 868–888.Google ScholarDigital Library
- [22] . 2019. Deterministic contention resolution on a shared channel. In Proceedings of the IEEE 39th International Conference on Distributed Computing Systems (ICDCS’19). IEEE, 472–482.Google ScholarCross Ref
- [23] . 2021. Deterministic contention resolution without collision detection: Throughput vs energy. In Proceedings of the IEEE 41st International Conference on Distributed Computing Systems (ICDCS’21). IEEE, 1009–1019.Google ScholarCross Ref
- [24] . 2017. Asynchronous shared channel. In Proceedings of the ACM Symposium on Principles of Distributed Computing. 391–400.Google ScholarDigital Library
- [25] . 2023. Distributed MIS in O(Log Log n) awake complexity. Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (PODC’23, Orlando, FL, USA), Association for Computing Machinery, New York, NY, 135–145. Google ScholarDigital Library
- [26] . 2006. Lower bounds for clear transmissions in radio networks. In Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN’06). 447–454.
DOI: Google ScholarDigital Library - [27] . 1985. A perspective on multiaccess channels. IEEE Trans. Inf. Theory 31, 2 (1985), 124–142.Google ScholarDigital Library
- [28] . 2013. Near optimal leader election in multi-hop radio networks. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’13). 748–766.Google ScholarCross Ref
- [29] . 2022. Average awake complexity of MIS and matching. In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’22). 45–55.Google ScholarDigital Library
- [30] . 2000. Contention resolution with constant expected delay. J. ACM 47, 6 (2000), 1048–1096.Google ScholarDigital Library
- [31] . 1987. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. J. ACM 34, 2 (1987), 289–325.Google ScholarDigital Library
- [32] . 1983. Estimating the multiplicities of conflicts in multiple access channels. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science (SFCS’83). IEEE, 383–392.Google ScholarDigital Library
- [33] . 1985. A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM 32, 3 (1985), 589–596.Google ScholarDigital Library
- [34] . 2016. A faster distributed radio broadcast primitive. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC’16). ACM, 361–370.Google ScholarDigital Library
- [35] . 1987. Analysis of backoff protocols for multiple access channels. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing. 241–253.Google ScholarDigital Library
- [36] . 1978. An adaptive technique for local distribution. IEEE Trans. Commun. 26, 8 (1978), 1178–1186.Google ScholarCross Ref
- [37] . 2002. Efficient algorithms for leader election in radio networks. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC’02). 51–57.
DOI: Google ScholarDigital Library - [38] . 2003. Weak communication in single-hop radio networks: Adjusting algorithms to industrial standards. Concurr. Comput.: Pract. Exp. 15, 11–12 (2003), 1117–1131.Google ScholarCross Ref
- [39] . 2005. Probabilistic algorithms for the wake-up problem in single-hop radio networks. Theory Comput. Syst. 38, 3 (2005), 347–367.Google ScholarDigital Library
- [40] . 1985. An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory 31, 2 (1985), 302–306.Google ScholarDigital Library
- [41] . 2005. On selection problem in radio networks. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing. 158–166.Google ScholarDigital Library
- [42] . 2005. Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18, 1 (2005), 43–57.
DOI: Google ScholarDigital Library - [43] . 1998. An \(\Omega (D\log (N/D))\) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 3 (1998), 702–712.
DOI: Google ScholarDigital Library - [44] . 1976. Ethernet: Distributed packet switching for local computer networks. Commun. ACM 19, 7 (1976), 395–404.Google ScholarDigital Library
- [45] . 2011. Unbounded contention resolution in multiple-access channels. In Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. 211–212.Google ScholarDigital Library
- [46] . 2000. Randomized leader election protocols in radio networks with no collision detection. In International Symposium on Algorithms and Computation (ISAAC’00). Springer, 362–373.Google Scholar
- [47] . 2002. Uniform leader election protocols for radio networks. IEEE Trans. Parallel Distrib. Syst. 13, 5 (2002), 516–526.Google ScholarDigital Library
- [48] . 2014. Radio network lower bounds made easy. In Proceedings of the 28th International Symposium on Distributed Computing (DISC’14). 258–272.
DOI: Google ScholarCross Ref - [49] . 1995. Stochastic contention resolution with short delays. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing. 229–237.Google ScholarDigital Library
- [50] . 1978. Free synchronous packet access in a broadcast channel with feedback. Probl. Peredachi Inf. 14, 4 (1978), 32–59.Google Scholar
- [51] . 1986. Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15, 2 (1986), 468–477.
DOI: Google ScholarDigital Library
Index Terms
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
Recommendations
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election
SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and ArchitecturesWe consider the energy complexity of the leader election problem in the single-hop radio network model, where each device ν has a unique identifier ID(ν) ∈ {1, 2, ..., N}. Energy is a scarce resource for small battery-powered devices. For such devices, ...
The Energy Complexity of Las Vegas Leader Election
SPAA '22: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe consider the time (number of communication rounds) and energy (number of non-idle communication rounds per device) complexities of randomized leader election in a multiple-access channel, where the number of devices n ≥ 2 is unknown. It is well-...
Sublinear bounds for randomized leader election
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O ( 1 ) rounds and (with high probability) uses only O ( n log 3 / 2 n ) ...
Comments