The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Cognitive Medium Access: Exploration, Exploitation, and Competition
Open accessAbstract
This paper considers the design of efficient strategies that allow cognitive users to choose frequency bands to sense and access among multiple bands with unknown parameters. First, the scenario in which a single cognitive user wishes to opportunistically exploit the availability of frequency bands is considered. By adopting tools from the classical bandit problem, optimal as well as low complexity asymptotically optimal solutions are developed. Next, the multiple cognitive user scenario is considered. The situation in which the availability probability of each channel is known is first considered. An optimal symmetric strategy that maximizes the total throughput of the cognitive users is developed. To avoid the possible selfish behavior of the cognitive users, a game-theoretic model is then developed. The performance of both models is characterized analytically. Then, the situation in which the availability probability of each channel is unknown a priori is considered. Low-complexity medium access protocols, which strike an optimal balance between exploration and exploitation in such competitive environments, are developed. The operating points of these low-complexity protocols are shown to converge to those of the scenario in which the availability probabilities are known. Finally, numerical results are provided to illustrate the impact of sensing errors and other practical considerations.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Cognitive radio: brain-empowered wireless communications
Haykin, S. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.839380 · Cited by 11,916
Cognitive radio: making software radios more personal
Mitola, J., & Maguire, G. Q. (1999) · IEEE Personal Communications · doi:10.1109/98.788210 · Cited by 9,135
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
An Introduction to Signal Detection and Estimation
Poor, H. V. (1988) · Springer Texts in Electrical Engineering · doi:10.1007/978-1-4757-3863-6 · Cited by 3,149
Self-citationBarto, A. G. (1998) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)38315-5 · Cited by 2,976
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
An Introduction to Signal Detection and Estimation
Poor, H. V. (1994) · Springer Texts in Electrical Engineering · doi:10.1007/978-1-4757-2341-0 · Cited by 2,659
Self-citationAsymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
(2020) · Machine Learning and Visual Perception · doi:10.1515/9783110595567-011 · Cited by 1,930
Decentralized 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
Restless bandits: activity allocation in a changing world
Whittle, P. (1988) · Journal of Applied Probability · doi:10.1017/s0021900200040420 · Cited by 1,173
Great Expectations: The Theory of Optimal Stopping.
Orkin, M., Chow, Y. S., Robbins, H. E., & Siegmund, D. (1975) · Journal of the American Statistical Association · doi:10.2307/2285852 · Cited by 687
Berry, D. A., & Fristedt, B. (1985) · Springer eBooks · doi:10.1007/978-94-015-3711-7 · Cited by 633
Bandit Problems, Sequential Allocation of Experiments.
Jones, P. W., Berry, D. A., & Fristedt, B. (1987) · The Journal of the Operational Research Society · doi:10.2307/2582852 · Cited by 566
The Complexity of Optimal Queuing Network Control
Papadimitriou, C. H., & Tsitsiklis, J. N. (1999) · Mathematics of Operations Research · doi:10.1287/moor.24.2.293 · Cited by 469
Opportunistic Spectrum Access via Periodic Channel Sensing
Zhao, Q., Geirhofer, S., Tong, L., & Sadler, B. M. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.907867 · Cited by 372
Optimality of Myopic Sensing in Multichannel Opportunistic Access
Ahmad, S. H. A., Liu, M., Javidi, T., Zhao, Q., & Krishnamachari, B. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2025561 · Cited by 364
Anantharam, V., Varaiya, P., & Walrand, J. (1987) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1987.1104491 · Cited by 358
The Multi-Armed Bandit Problem: Decomposition and Computation
Katehakis, M. N., & Veinott, A. F. (1987) · Mathematics of Operations Research · doi:10.1287/moor.12.2.262 · Cited by 333
A Survey of Some Results in Stochastic Adaptive Control
Kumar, P. R. (1985) · SIAM Journal on Control and Optimization · doi:10.1137/0323023 · Cited by 217
Contributions to the "Two-Armed Bandit" Problem
Feldman, D. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704454 · Cited by 128
Cited by
Advances in cognitive radio networks: A survey
Wang, B., & Liu, K. J. R. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2093210 · Cited by 1,404
Spectrum Sensing for Cognitive Radio : State-of-the-Art and Recent Advances
Axell, E., Leus, G., Larsson, E. G., & Poor, H. V. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2183771 · Cited by 1,116
Self-citationSpectrum Sensing for Cognitive Radio
Haykin, S., Thomson, D. J., & Reed, J. H. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2015711 · Cited by 812
On Upper-Confidence Bound Policies for Switching Bandit Problems
Garivier, A., & Moulines, E. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24412-4_16 · Cited by 442
Attar, A., Tang, H., Vasilakos, A. V., Yu, F. R., & Leung, V. C. M. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2208211 · Cited by 274
Metadata
- Authors
- Lai, L., El Gamal, H., Jiang, H., & Poor, H. V.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2011-02
- Volume
- 10
- Issue
- 2
- Pages
- 239-253
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2146025745
- Cited by
- 351
- References
- 24
- FWCI
- 56.94
- 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
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.