| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks
Abstract : In 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 $n$, working on expectancy within $O(\log^\epsilon n)$ rounds, with each station transmitting $O(1)$ number of times and no station being awake for more than $O(\log \log \log n)$ rounds.
Cited literature [16 references]
https://hal.inria.fr/hal-00996429
Contributor : Dominik Pajak Connect in order to contact the contributor
Submitted on : Monday, May 26, 2014 - 3:10:05 PM
Last modification on : Monday, December 20, 2021 - 4:50:12 PM
Long-term archiving on: : Tuesday, August 26, 2014 - 12:00:34 PM
Contributor : Dominik Pajak Connect in order to contact the contributor
Submitted on : Monday, May 26, 2014 - 3:10:05 PM
Last modification on : Monday, December 20, 2021 - 4:50:12 PM
Long-term archiving on: : Tuesday, August 26, 2014 - 12:00:34 PM
File
i3e-main.pdf
Files produced by the author(s)