Distributed competition to compute localized scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2011

Distributed competition to compute localized scheduling

Barthel Dominique
  • Fonction : Auteur
  • PersonId : 847534
Valois Fabrice
Isabelle Augé-Blum
  • Fonction : Auteur
  • PersonId : 836658

Résumé

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.
Fichier principal
Vignette du fichier
RR-7522.pdf (522.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00561379 , version 1 (01-02-2011)

Identifiants

  • HAL Id : inria-00561379 , version 1

Citer

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⟩
169 Consultations
160 Téléchargements

Partager

Gmail Facebook X LinkedIn More