Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 IMCS - Institute of Mathematics and Computer Science Wroclaw 2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d-Électronique, Informatique et Radiocommunications de Bordeaux ENSEIRB, CNRS - Centre National de la Recherche Scientifique : UMR5800 3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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 $O1$ number of times and no station being awake for more than $O\log \log \log n$ rounds.

Autor: Marcin Kardas - Marek Klonowski - Dominik Pajak -

Fuente: https://hal.archives-ouvertes.fr/

DESCARGAR PDF