Name
Abstract | ||
|---|---|---|
We consider the channel probing problem arising in opportunistic scheduling over fading channels, cognitive radio networks, and resource constrained jamming. The communication system consists of N channels. Each channel is modeled as a multi-state Markov chain (M.C.). At each time period a user selects one channel to probe and uses it to transmit information. A reward depending on the state of the selected channel is obtained for each transmission. The objective is to design a channel probing policy that maximizes the expected total reward collected over a finite or infinite horizon. This problem can be viewed as an instance of a restless bandit problem, to which the form of optimal policies is unknown in general. We discover conditions sufficient to guarantee the optimality of a myopic probing policy. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/Allerton.2012.6483238 | Allerton Conference |
Keywords | DocType | ISSN |
resource constrained jamming,opportunistic scheduling,cognitive radio,fading channels,fading channel,cognitive radio network,channel allocation,myopic policy,channel probing policy,multistate channel probing | Conference | 2474-0195 |
ISBN | Citations | PageRank |
978-1-4673-4537-8 | 2 | 0.43 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Ouyang | 1 | 43 | 10.16 |
| Demosthenis Teneketzis | 2 | 612 | 85.73 |