Optimality of Myopic Sensing in Multi-Channel Opportunistic Access
| dc.creator | Ahmad, Sahand H. A. | |
| dc.creator | Liu, Mingyan | |
| dc.creator | Javidi, Tara | |
| dc.creator | Zhao, Qing | |
| dc.creator | Krishnamachari, Bhaskar | |
| dc.date | 2008-11-05 | |
| dc.date | 2009-03-10 | |
| dc.date.accessioned | 2026-07-07T12:50:10Z | |
| dc.date.available | 2026-07-07T12:50:10Z | |
| dc.description | We consider opportunistic communications over multiple channels where the state ("good" or "bad") of each channel evolves as independent and identically distributed Markov processes. A user, with limited sensing and access capability, chooses one channel to sense and subsequently access (based on the sensed channel state) in each time slot. A reward is obtained when the user senses and accesses a "good" channel. The objective is to design the optimal channel selection policy that maximizes the expected reward accrued over time. This problem can be generally cast as a Partially Observable Markov Decision Process (POMDP) or a restless multi-armed bandit process, to which optimal solutions are often intractable. We show in this paper that the myopic policy, with a simple and robust structure, achieves optimality under certain conditions. This result finds applications in opportunistic communications in fading environment, cognitive radio networks for spectrum overlay, and resource-constrained jamming and anti-jamming. | |
| dc.description | Revised version | |
| dc.identifier | https://arxiv.org/abs/0811.0637 | |
| dc.identifier | http://arxiv.org/abs/0811.0637 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/222603 | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | Information Theory | |
| dc.title | Optimality of Myopic Sensing in Multi-Channel Opportunistic Access | |
| dc.type | text |