Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks

In this paper we investigate leader election protocols for single-hop radio networks from the perspective of energetic complexity. We discuss different models of energy consumption and their impact on time complexity. We also present some results about energy consumption in classic protocols optimal with respect to time complexity - we show that some very basic, intuitive algorithms for simpler model (with known number of stations) do not have to be optimal when energy of stations is restricted. We show that they can be significantly improved by introducing very simple modifications. Our main technical result is however a protocol for solving leader election problem in case of unknown number of stations n, with expected time O(log epsilon n), such that each station transmits O(1) number of times and no station is awake for more than O(log log log n) rounds.