Exploiting Channel Memory for Wireless Scheduling with Limited Channel Probing: an Asymptotic Study - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

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.
Fichier principal
Vignette du fichier
p412-giaccone.pdf (330.71 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

hal-00764244 , version 1 (12-12-2012)

Identifiers

  • HAL Id : hal-00764244 , version 1

Cite

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. ⟨hal-00764244⟩

Collections

WIOPT2012
34 View
33 Download

Share

Gmail Facebook X LinkedIn More