Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-00764244
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, December 12, 2012 - 4:07:33 PM
Last modification on : Monday, October 13, 2014 - 3:43:25 PM
Long-term archiving on: : Wednesday, March 13, 2013 - 3:55:35 AM

File

p412-giaccone.pdf
Explicit agreement for this submission

Identifiers

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

Share

Metrics

Record views

106

Files downloads

60