Exploiting Channel Memory for Wireless Scheduling with Limited Channel Probing: an Asymptotic Study

Abstract : We consider a wireless downlink communication system with N parallel channels under the following two assumptions: (1) the channels states can be explicitly sensed at a limited rate !s, (2) channels are modeled as i.i.d., ON/OFF Markov chains with stationary distribution ["OFF , "ON]. The goal of this paper is to characterize the fundamental trade-off between system throughput and channel sensing rate !s in the challenging scenario in which N !" and jointly "ON ! 0. To this end, we propose a simple scheduling algorithm that effectively exploits channel memory to maximize the successful transmission probability. We obtain sufficient and necessary conditions to achieve maximum (in order sense) system throughput. Finally, we show the performance of our policy under a non-asymptotic scenario.
Type de document :
Communication dans un congrès
WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.412-416, 2012
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00764244
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 12 décembre 2012 - 16:07:33
Dernière modification le : lundi 13 octobre 2014 - 15:43:25
Document(s) archivé(s) le : mercredi 13 mars 2013 - 03:55:35

Fichier

p412-giaccone.pdf
Accord explicite pour ce dépôt

Identifiants

  • HAL Id : hal-00764244, version 1

Collections

Citation

Paolo Giaccone, Emilio Leonardi. Exploiting Channel Memory for Wireless Scheduling with Limited Channel Probing: an Asymptotic Study. WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.412-416, 2012. 〈hal-00764244〉

Partager

Métriques

Consultations de la notice

59

Téléchargements de fichiers

47