Online Learning to Optimize Transmission over an Unknown Gilbert-Elliott Channel - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Online Learning to Optimize Transmission over an Unknown Gilbert-Elliott Channel

Abstract

This paper studies the optimal transmission policy for a Gilbert-Elliott Channel. The transmitter has two actions: sending aggressively or sending conservatively, with rewards depending on the action chosen and the underlying channel state. The aim is to compute the scheduling policy to determine which actions to choose at each time slot in order to maximize the expected total discounted reward. We first establish the threshold structure of the optimal policy when the underlying channel statistics are known. We then consider the more challenging case when the statistics are unknown. For this problem, we map different threshold policies to arms of a suitably defined multiarmed bandit problem. To tractably handle the complexity introduced by countably infinite arms and the infinite time horizon, we weaken our objective a little: finding a (OPT ( + ))- approximate policy instead. We present the UCB-P algorithm, which can achieve this objective with logarithmic-time regret.
Fichier principal
Vignette du fichier
p27-wu.pdf (474.68 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

hal-00763262 , version 1 (10-12-2012)

Identifiers

  • HAL Id : hal-00763262 , version 1

Cite

Yanting Wu, Bhaskar Krishnamachari. Online Learning to Optimize Transmission over an Unknown Gilbert-Elliott Channel. WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.27-32. ⟨hal-00763262⟩

Collections

WIOPT2012
38 View
118 Download

Share

Gmail Facebook X LinkedIn More