8 research outputs found
Quasi-Optimal Energy-Efficient Leader Election Algorithms in Radio Networks
International audienceRadio networks (RN) are distributed systems (\textit{ad hoc networks}) consisting in radio stations. Assuming the number unknown, two distinct models of RN without collision detection (\textit{no-CD}) are addressed: the model with \textit{weak no-CD} RN and the one with \textit{strong no-CD} RN. We design and analyze two distributed leader election protocols, each one running in each of the above two (no-CD RN) models, respectively. Both randomized protocols are shown to elect a leader within \BO(\log{(n)}) expected time, with no station being awake for more than \BO(\log{\log{(n)}}) time slots (such algorithms are said to be \textit{energy-efficient}). Therefore, a new class of efficient algorithms is set up that matchthe time lower-bound established by Kushilevitz and Mansour
Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks
International audienceIn this paper we investigate leader election protocols for single-hop radio networks from perspective of energetic complexity. We discuss different models of energy consumption and its relation with 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 simplest models (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 , working on expectancy within rounds, with each station transmitting number of times and no station being awake for more than rounds