Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks
PAJAK, Dominik
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
PAJAK, Dominik
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
< Réduire
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Langue
en
Communication dans un congrès
Ce document a été publié dans
ICPP - 42nd International Conference on Parallel Processing, 2013-10-01, Lyon. 2013-10-01p. 399-408
IEEE
Résumé en anglais
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 ...Lire la suite >
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.< Réduire
Origine
Importé de halUnités de recherche