Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks
| hal.structure.identifier | Institute of Mathematics and Computer Science [Wroclaw] [IMCS] | |
| dc.contributor.author | KARDAS, Marcin | |
| hal.structure.identifier | Institute of Mathematics and Computer Science [Wroclaw] [IMCS] | |
| dc.contributor.author | KLONOWSKI, Marek | |
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | PAJAK, Dominik | |
| dc.date.accessioned | 2024-04-15T09:41:19Z | |
| dc.date.available | 2024-04-15T09:41:19Z | |
| dc.date.issued | 2013-10-01 | |
| dc.date.conference | 2013-10-01 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197591 | |
| dc.description.abstractEn | 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. | |
| dc.language.iso | en | |
| dc.publisher | IEEE | |
| dc.title.en | Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1109/ICPP.2013.49 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.page | 399-408 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | ICPP - 42nd International Conference on Parallel Processing | |
| bordeaux.country | FR | |
| bordeaux.conference.city | Lyon | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00996429 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2013-10-04 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00996429v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2013-10-01&rft.spage=399-408&rft.epage=399-408&rft.au=KARDAS,%20Marcin&KLONOWSKI,%20Marek&PAJAK,%20Dominik&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||