How to Elect a Low-energy Leader

In many networks of wireless devices the scarcest resource is energy, and the lion's share of energy is often spent on sending and receiving packets. In this paper we present a comprehensive study of the energy complexity of fundamental problems in wireless networks with four different levels of collision detection: Strong-CD (in which transmitters and listeners detect collisions), Sender-CD (in which transmitters detect collisions, indirectly), Receiver-CD (in which listeners detect collisions), and No-CD (in which no one detects collisions). We show that the randomized energy complexity of Approximate Counting and Leader Election is $\Omega(\log^* n)$ in Sender-CD and No-CD but $\Omega(\log(\log^* n))$ in Strong-CD and Receiver-CD, and also provide matching upper bounds. This establishes an exponential separation between the Sender-CD and Receiver-CD models, and also confirms that the recent $O(\log(\log^* n))$ Contention Resolution protocol of Bender et al. (STOC 2016) is optimal in Strong-CD. In the deterministic setting, all $n$ devices have unique IDs in the range $[N]$. We establish another exponential separation between the deterministic Sender-CD and Receiver-CD models in the opposite direction. We show that Leader Election can be solved with $O(\log \log N)$ energy in the deterministic Sender-CD model, and give a matching $\Omega(\log \log N)$ energy lower bound in the Strong-CD model. However, in Receiver-CD and No-CD the energy complexity of these problems jumps to $\Theta(\log N)$. For the special case where $n = \Theta(N)$, we prove that Leader Election can be solved with only $O(\alpha(N))$ energy in No-CD. To our best knowledge, this is the first time the inverse-Ackermann function appears in the field of distributed computing.

[1]  Calvin C. Newport,et al.  The Computational Power of Beeps , 2015, DISC.

[2]  D. K. Arvind,et al.  ENS: An Energy Harvesting Wireless Sensor Network Platform , 2010, 2010 Fifth International Conference on Systems and Networks Communications.

[3]  Dan E. Willard,et al.  Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel , 1986, SIAM J. Comput..

[4]  Stephan Olariu,et al.  Randomized Initialization Protocols for Ad Hoc Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[5]  Marek Klonowski,et al.  Approximating the Size of a Radio Network in Beeping Model , 2016, SIROCCO.

[6]  Eyal Kushilevitz,et al.  An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.

[7]  Calvin C. Newport.  Radio Network Lower Bounds Made Easy , 2014, DISC.

[8]  Miroslaw Kutylowski,et al.  Efficient algorithms for leader election in radio networks , 2002, PODC '02.

[9]  Calvin C. Newport,et al.  Leader election in shared spectrum radio networks , 2012, PODC '12.

[10]  Miroslaw Kutylowski,et al.  Adversary Immune Leader Election in ad hoc Radio Networks , 2003, ESA.

[11]  Calvin C. Newport,et al.  Contention Resolution on a Fading Channel , 2016, PODC.

[12]  David E. Culler,et al.  Telos: enabling ultra-low power wireless research , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[13]  A. Rényii,et al.  ON A PROBLEM OF GRAPH THEORY , 1966 .

[14]  Andrzej Pelc,et al.  Electing a Leader in Multi-hop Radio Networks , 2012, OPODIS.

[15]  Miroslaw Kutylowski,et al.  Weak Communication in Radio Networks , 2002, Euro-Par.

[16]  Peter Davies,et al.  Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks , 2016, PODC.

[17]  Miroslaw Kutylowski,et al.  Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards , 2003, Concurr. Comput. Pract. Exp..

[18]  Noga Alon,et al.  A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..

[19]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[20]  Fabian Kuhn,et al.  Deploying Wireless Networks with Beeps , 2010, DISC.

[21]  Andrea E. F. Clementi,et al.  Distributed broadcast in radio networks of unknown topology , 2003, Theor. Comput. Sci..

[22]  Eyal Kushilevitz,et al.  An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..

[23]  Bernhard Haeupler,et al.  Near Optimal Leader Election in Multi-Hop Radio Networks , 2012, SODA.

[24]  Miroslaw Kutylowski,et al.  Energy-Efficient Size Approximation of Radio Networks with No Collision Detection , 2002, COCOON.

[25]  Andrzej Pelc,et al.  Broadcasting in undirected ad hoc radio networks , 2003, PODC '03.

[26]  Reuven Bar-Yehuda,et al.  Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection , 1989, Distributed Computing.

[27]  Michael A. Bender,et al.  How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness , 2016, SODA.

[28]  Nancy A. Lynch,et al.  Leader election using loneliness detection , 2012, Distributed Computing.

[29]  David Blaauw,et al.  A Modular 1 mm$^{3}$ Die-Stacked Sensing Platform With Low Power I$^{2}$C Inter-Die Communication and Multi-Modal Energy Harvesting , 2013, IEEE Journal of Solid-State Circuits.

[30]  Maxwell Young,et al.  Conflict on a communication channel , 2011, PODC '11.

[31]  Michael A. Bender,et al.  Resource-Competitive Algorithms , 2015, SIGA.

[32]  Wojciech Rytter,et al.  Broadcasting algorithms in radio networks with unknown topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[33]  Albert G. Greenberg,et al.  A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels , 1985, JACM.

[34]  Marek Klonowski,et al.  Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks , 2013, 2013 42nd International Conference on Parallel Processing.

[35]  Miguel A. Mosteiro,et al.  Lower Bounds for Clear Transmissions in Radio Networks , 2006, LATIN.

[36]  Andrzej Pelc,et al.  Leader election in ad hoc radio networks: A keen ear helps , 2013, J. Comput. Syst. Sci..

[37]  Krishna M. Sivalingam,et al.  Low power link and access protocols for wireless multimedia networks , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[38]  Stephan Olariu,et al.  Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection , 2000, IEEE Trans. Parallel Distributed Syst..

[39]  Tomasz Jurdzinski,et al.  Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks , 2002, ISAAC.