Optimality of myopic sensing in multichannel opportunistic access

  • Authors:

  • Sahand Haji Ali Ahmad;Mingyan Liu;Tara Javidi;Qing Zhao;Bhaskar Krishnamachari

  • Affiliations:

  • Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA;Department of Electrical and Computer Engineering, University of California, Davis, Davis, CA;Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.90

Visualization

Abstract

This paper considers opportunistic communication over multiple channels where the state ("good" or "bad") of each channel evolves as independent and identically distributed (i.i.d.) Markov processes. A user, with limited channel sensing capability, chooses one channel to sense and decides whether to use the channel (based on the sensing result) in each time slot. A reward is obtained whenever the user senses and accesses a "good" channel. The objective is to design a channel selection policy that maximizes the expected total (discounted or average) reward accrued over a finite or infinite horizon. This problem can be cast as a partially observed Markov decision process (POMDP) or a restless multiarmed bandit process, to which optimal solutions are often intractable. This paper shows that a myopic policy that maximizes the immediate one-step reward is optimal when the state transitions are positively correlated over time. When the state transitions are negatively correlated, we show that the same policy is optimal when the number of channels is limited to two or three, while presenting a counterexample for the case of four channels. This result finds applications in opportunistic transmission scheduling in a fading environment, cognitive radio networks for spectrum overlay, and resource-constrained jamming and antijamming.