The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Optimality of Myopic Sensing in Multichannel Opportunistic Access
Open accessAbstract
This paper considers opportunistic communication over multiple channels where the state (ldquogoodrdquo or ldquobadrdquo) 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 ldquogoodrdquo 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Puterman, M. L. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316887 · Cited by 6,024
A Survey of Dynamic Spectrum Access
Zhao, Q., & Sadler, B. M. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.361604 · Cited by 2,698
Self-citationDecentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework
Zhao, Q., Tong, L., Swami, A., & Chen, Y. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.070409 · Cited by 1,587
Self-citationBandit processes and dynamic allocation indices
Gittins, J. C. (1979) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1979.tb01068.x · Cited by 1,487
The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
Smallwood, R. D., & Sondik, E. J. (1973) · Operations Research · doi:10.1287/opre.21.5.1071 · Cited by 1,479
Restless bandits: activity allocation in a changing world
Whittle, P. (1988) · Journal of Applied Probability · doi:10.1017/s0021900200040420 · Cited by 1,173
Stochastic systems : estimation, identification, and adaptive control
Kumar, P. R., & Varaiya, P. (1986) · Medical Entomology and Zoology · Cited by 1,018
Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
Arapostathis, A., Borkar, V. S., Fernández-Gaucherand, E., Ghosh, M. K., & Marcus, S. I. (1993) · SIAM Journal on Control and Optimization · doi:10.1137/0331018 · Cited by 592
Multi-Armed Bandits and the Gittins Index
Whittle, P. (1980) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1980.tb01111.x · Cited by 514
Cited by
Deep Multi-User Reinforcement Learning for Distributed Dynamic Spectrum Access
Naparstek, O., & Cohen, K. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2879433 · Cited by 477
Deep Reinforcement Learning for Dynamic Multichannel Access in Wireless Networks
Wang, S., Liu, H., Gomes, P. H., & Krishnamachari, B. (2018) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2018.2809722 · Cited by 477
Self-citationCognitive Medium Access: Exploration, Exploitation, and Competition
Lai, L., El Gamal, H., Jiang, H., & Poor, H. V. (2011) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.65 · Cited by 351
Liu, K., & Zhao, Q. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2068950 · Cited by 347
Self-citationDeep-Learning-Based Wireless Resource Allocation With Application to Vehicular Networks
Liang, L., Ye, H., Yu, G., & Li, G. Y. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2957798 · Cited by 282
Metadata
- Authors
- Ahmad, S. H. A., Liu, M., Javidi, T., Zhao, Q., & Krishnamachari, B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-09
- Volume
- 55
- Issue
- 9
- Pages
- 4040-4050
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2029199203
- Cited by
- 364
- References
- 17
- FWCI
- 51.83
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimality of Myopic Sensing in Multichannel Opportunistic Access. https://app.cochat.ai/papers/10.1109/tit.2009.2025561
- The paper
- Ahmad, S. H. A., Liu, M., Javidi, T., Zhao, Q., & Krishnamachari, B. (2009). Optimality of Myopic Sensing in Multichannel Opportunistic Access. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2009.2025561
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.