Distributed competition to compute localized scheduling

Quentin Lampin 1, 2, * Barthel Dominique 2 Valois Fabrice 1 Isabelle Augé-Blum 1
* Auteur correspondant
1 SWING - Smart Wireless Networking
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : Duty-cycled medium access protocols allow for long lasting au- tonomous networks by periodically putting nodes to sleep. However, this life expectancy improvement comes at the cost of a lesser network capacity and a poor adaptability to bursty traffic loads. Indeed, existing contention algorithms do not provide efficient algorithms to dynamically elect multiple senders per wake-up periods. In this paper, the medium is divided in several logical chan- nels (eg. obtained by a time/frequency division of the communication medium) and we propose to allocate them dynamically among senders. For this purpose, we propose a joint contention/scheduling algorithm, named Extended Slot Se- lection (ESS), that schedules multiple sender/receiver pairs to available logical channels.
Type de document :
[Research Report] RR-7522, INRIA. 2011, pp.18
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

Contributeur : Quentin Lampin <>
Soumis le : mardi 1 février 2011 - 10:21:42
Dernière modification le : samedi 27 octobre 2018 - 01:20:04
Document(s) archivé(s) le : lundi 2 mai 2011 - 02:51:43


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00561379, version 1



Quentin Lampin, Barthel Dominique, Valois Fabrice, Isabelle Augé-Blum. Distributed competition to compute localized scheduling. [Research Report] RR-7522, INRIA. 2011, pp.18. 〈inria-00561379〉



Consultations de la notice


Téléchargements de fichiers