Quasi-Optimal Energy-Efficient Leader Election Algorithms in Radio Networks - Université Sorbonne Paris Nord Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2007

Quasi-Optimal Energy-Efficient Leader Election Algorithms in Radio Networks

Résumé

Radio networks (RN) are distributed systems (\textit{ad hoc networks}) consisting in $n \ge 2$ radio stations. Assuming the number $n$ 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 $\Omega(\log{(n)})$ time lower-bound established by Kushilevitz and Mansour.
Fichier principal
Vignette du fichier
LERNfinal06.pdf (194.58 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00084603 , version 1 (07-07-2006)

Identifiants

Citer

Christian Lavault, Jean-François Marckert, Vlady Ravelomanana. Quasi-Optimal Energy-Efficient Leader Election Algorithms in Radio Networks. Information and Computation, 2007, 205 (5), p. 679-693. ⟨hal-00084603⟩
149 Consultations
92 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More