Competitive Spectrum Access in Cognitive Radio Networks: Graphical Game and Learning
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Competitive spectrum access is studied for cognitive radio networks. Based on the assumption of rational secondary users, the spectrum access is modeled as a graphical game, in which the payoff of a secondary user is dependent on only other secondary users that can cause significant interference. The Nash equilibrium in the graphical game is computed by minimizing the sum of regrets. To alleviate the local knowledge of payoffs (each secondary user knows only its own payoff for different channels), a subgradient based iterative algorithm is applied by exchanging information across different secondary users. When information exchange is not available, learning for spectrum access is carried out by employing stochastic approximation (more specifically, the Kiefer-Wolfowitz algorithm). The convergence of both situations is demonstrated by numerical simulations.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719 · cited 2×
“The iteration continues until it converges and the convergence is guaranteed by the property of subgradient method [13] [14].”
MethodStochastic Estimation of the Maximum of a Regression Function
Kiefer, J., & Wolfowitz, J. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729392 · Cited by 2,133
Cognitive radio for flexible mobile multimedia communications
Mitola, J. (2003) · 1999 IEEE International Workshop on Mobile Multimedia Communications (MoMuC'99) (Cat. No.99EX384) · doi:10.1109/momuc.1999.819467 · Cited by 1,406
Dynamic Spectrum Access and Management in Cognitive Radio Networks
Hossain, E., Niyato, D., & Han, Z. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609909 · Cited by 691
Self-citationConvergence Rate of Incremental Subgradient Algorithms
Nedić, A., & Bertsekas, D. (2001) · Applied Optimization · doi:10.1007/978-1-4757-6594-6_11 · Cited by 190
Han, Z., Pandana, C., & Liu, K. J. R. (2007) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2007.8 · Cited by 132
Self-citationDynamic spectrum access in cognitive radio networks
Arbaugh, W. A., & Clancy, T. (2006) · Cited by 120
Multi-agent Q-learning of channel selection in multi-user cognitive radio systems: A two by two case
Li, H. (2009) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2009.5346172 · Cited by 116
Self-citationCorrelated equilibria in graphical games
Kakade, S. M., Kearns, M. J., Langford, J. C., & Ortiz, L. E. (2003) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/779928.779934 · Cited by 93
Game theoretical mechanism design methods
Wang, B., Wu, Y., Ji, Z., Liu, K. J. R., & Clancy, T. C. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2008.929552 · Cited by 76
Research works printed but not linked: 1
- littman, 2001, An efficient exact algorithm for singly connected graphical games, Proc of the 15th Annual Conference on Neural Information Processing Systems (NIPS)
Cited by
Distributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
Gadjov, D., & Pavel, L. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2833140 · Cited by 339
Xu, Y., Wang, J., Wu, Q., Anpalagan, A., & Yao, Y.-D. (2012) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2176916 · Cited by 330
1Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed GraphsPreprint
Nedić, A., & Olshevsky, A. (2016) · Cited by 315
Xu, Y., Anpalagan, A., Wu, Q., Shen, L., Gao, Z., & Wang, J. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.030713.00189 · Cited by 229
Metadata
- Authors
- Li, H., & Han, Z.
- Affiliations
- University of Tennessee at Knoxville (US)
- University of Houston (US)
- ORCID
- Venue
- 2010 IEEE Wireless Communication and Networking Conference
- Publisher
- IEEE
- Published
- 2010-04
- Pages
- 1-6
- ISSN
- 1525-3511 (ISSN-L)
- OpenAlex
- W1992070920
- Cited by
- 67
- References
- 18
- Citations by year
- 2023: 1 · 2021: 6 · 2020: 1 · 2019: 1 · 2018: 8 · 2017: 6 · 2016: 9 · 2015: 8 · 2014: 11 · 2013: 7 · 2012: 5
- FWCI
- 4.62
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE Wireless Communications and Networking Conference (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cognitive Radio Networks and Spectrum Sensing
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Communication Networks Research
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
- Keywords
- cognitive radio networks, graphical games, Nash equilibrium, regret minimization, stochastic approximation, secondary users, interference, convergence analysis
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: Competitive Spectrum Access in Cognitive Radio Networks: Graphical Game and Learning. https://app.cochat.ai/papers/10.1109/wcnc.2010.5506285
- The paper
- Li, H., & Han, Z. (2010). Competitive Spectrum Access in Cognitive Radio Networks: Graphical Game and Learning. 2010 IEEE Wireless Communication and Networking Conference. https://doi.org/10.1109/wcnc.2010.5506285
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.