A Survey on Applications of Model-Free Strategy Learning in Cognitive Wireless Networks
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
The framework of cognitive wireless networks is expected to endow the wireless devices with the cognition-intelligence ability with which they can efficiently learn and respond to the dynamic wireless environment. In many practical scenarios, the complexity of network dynamics makes it difficult to determine the network evolution model in advance. Thus, the wireless decision-making entities may face a black-box network control problem and the model-based network management mechanisms will be no longer applicable. In contrast, model-free learning enables the decision-making entities to adapt their behaviors based on the reinforcement from their interaction with the environment and (implicitly) build their understanding of the system from scratch through trial-and-error. Such characteristics are highly in accordance with the requirement of cognition-based intelligence for devices in cognitive wireless networks. Therefore, model-free learning has been considered as one key implementation approach to adaptive, self-organized network control in cognitive wireless networks. In this paper, we provide a comprehensive survey on the applications of the state-of-the-art model-free learning mechanisms in cognitive wireless networks. According to the system models on which those applications are based, a systematic overview of the learning algorithms in the domains of single-agent system, multiagent systems, and multiplayer games is provided. The applications of model-free learning to various problems in cognitive wireless networks are discussed with the focus on how the learning mechanisms help to provide the solutions to these problems and improve the network performance over the model-based, non-adaptive methods. Finally, a broad spectrum of challenges and open issues is discussed to offer a guideline for the future research directions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey
Akyildiz, I. F., Lee, W.-Y., Vuran, M. C., & Mohanty, S. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.05.001 · Cited by 6,356
A Comprehensive Survey of Multiagent Reinforcement Learning
Busoniu, L., Babuska, R., & De Schutter, B. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2007.913919 · Cited by 2,235 · cited 6×
“Mathematically, a single-agent MDP is defined as follows: Definition 1 (Single-agent MDP [26]): A single-agent MDP is defined as a 4-tuple: 〈S,A, u,Pr(s′|s, a)〉, in which • S = {s1, .”
BackgroundMethodInfluentialCooperative Multi-Agent Learning: The State of the Art
Panait, L., & Luke, S. (2005) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-005-2631-2 · Cited by 1,237 · cited 1×
“tive decision-making domain [52], [53].”
Machine learning in wireless sensor networks: Algorithms, strategies, and applications
Alsheikh, M. A., Lin, S., Niyato, D., & Tan, H.-P. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2320099 · Cited by 965
Self-citationA Survey on Machine-Learning Techniques in Cognitive Radios
Bkassiny, M., Li, Y., & Jayaweera, S. K. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.100412.00017 · Cited by 580 · cited 1×
“In the recent surveys on reinforceme ntlearning theory and its applications [13], [14], such a deci sionlearning process is described by an abstract model, namely, the Observe-Orient-Decision-Action (OODA) loop [4].”
BackgroundConjectural Equilibrium in Multiagent Learning
Wellman, M. P., & Hu, J. (1998) · Machine Learning · doi:10.1023/a:1007514623589 · Cited by 75
Cited by
Applications of Deep Reinforcement Learning in Communications and Networking: A Survey
Luong, N. C., Hoang, D. T., Gong, S., Niyato, D., Wang, P., Liang, Y.-C., & Kim, D. I. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2916583 · Cited by 2,060
Self-citationApplication of Machine Learning in Wireless Networks: Key Techniques and Open Issues
Sun, Y., Peng, M., Zhou, Y., Huang, Y., & Mao, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2924243 · Cited by 678
“In addition, only a specific network scenario is covered in [20]–[24], while literatures [28], [31]–[33]”
BackgroundSharma, S. K., & Wang, X. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2916177 · Cited by 427
Morocho-Cayamcela, M. E., Lee, H., & Lim, W. (2019) · IEEE Access · doi:10.1109/access.2019.2942390 · Cited by 418
Learning for Computation Offloading in Mobile Edge Computing
Dinh, T. Q., La, Q. D., Quek, T. Q. S., & Shin, H. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2866572 · Cited by 214
Metadata
- Authors
- Wang, W., Kwasinski, A., Niyato, D., & Han, Z.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2016
- Volume
- 18
- Issue
- 3
- Pages
- 1717-1757
- ISSN
- 1553-877X (ISSN-L)
- 2373-745X
- OpenAlex
- W2283268383
- Cited by
- 90
- References
- 10
- FWCI
- 13.90
- 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: A Survey on Applications of Model-Free Strategy Learning in Cognitive Wireless Networks. https://app.cochat.ai/papers/10.1109/comst.2016.2539923
- The paper
- Wang, W., Kwasinski, A., Niyato, D., & Han, Z. (2016). A Survey on Applications of Model-Free Strategy Learning in Cognitive Wireless Networks. IEEE Communications Surveys & Tutorials. https://doi.org/10.1109/comst.2016.2539923
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.