Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

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.
Fichier principal
Vignette du fichier
i3e-main.pdf (165.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00996429 , version 1 (26-05-2014)

Identifiers

Cite

Marcin Kardas, Marek Klonowski, Dominik Pajak. Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks. ICPP - 42nd International Conference on Parallel Processing, Oct 2013, Lyon, France. pp.399-408, ⟨10.1109/ICPP.2013.49⟩. ⟨hal-00996429⟩
133 View
219 Download

Altmetric

Share

Gmail Facebook X LinkedIn More