The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Game Theoretic Approaches for Multiple Access in Wireless Networks: A Survey
Abstract
Multiple access methods in a wireless network allow multiple nodes to share a set of available channels for data transmission. The nodes can either compete or cooperate with each other to access the channel(s) so that either an individual or a group objective can be achieved. Game theory, which is a mathematical tool developed to understand the interaction among rational entities, can be applied to model and to analyze individual or group behaviour of nodes for multiple access in wireless networks. Game theory also enables us to model the selfish/malicious behaviour of nodes, and subsequently design the punishment or defense mechanisms for robust multiple access in wireless networks. In addition, game models can provide distributed solutions to the multiple access problems, which are based on solid theoretical foundations. In this survey, we provide a comprehensive review of the game models (e.g., noncooperative/cooperative, static/dynamic, and complete/incomplete information) developed for different multiple access schemes (i.e., contention-free and contention-based random channel access) in wireless networks. We consider time-division multiple access (TDMA), frequency-division multiple access (FDMA), and code-division multiple access (CDMA), ALOHA, and carrier sense multiple access (CSMA)-based wireless networks. In addition, game models for multiple access in dynamic spectrum access-based cognitive radio networks are reviewed. The major findings from the game models used for these different access schemes are highlighted. To this end, several of the key open research directions are outlined.
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
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
Subjectivity and Correlation in Randomized Strategies
Aumann, R. J. (1974) · Journal of Mathematical Economics · doi:10.1016/0304-4068(74)90037-8 · Cited by 1,630
Cited by
Ultra-Dense Networks: A Survey
Kamel, M., Hamouda, W., & Youssef, A. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2571730 · Cited by 919
A 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
Peng, M., Sun, Y., Li, X., Mao, Z., & Wang, C. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2548658 · Cited by 386
Khan, A. A., Rehmani, M. H., & Reisslein, M. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2481722 · Cited by 355
A Survey on Radio Resource Allocation in Cognitive Radio Sensor Networks
Ahmad, A., Ahmad, S., Rehmani, M. H., & Hassan, N. U. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2401597 · Cited by 277
Metadata
- Authors
- Akkarajitsakul, K., Hossain, E., Niyato, D., & Kim, D. I.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2011
- Volume
- 13
- Issue
- 3
- Pages
- 372-395
- ISSN
- 1553-877X (ISSN-L)
- OpenAlex
- W2102474916
- Cited by
- 244
- References
- 2
- FWCI
- 31.64
- Type
- journal article
- Language
- en
- Open access
- closed
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: Game Theoretic Approaches for Multiple Access in Wireless Networks: A Survey. https://app.cochat.ai/papers/10.1109/surv.2011.122310.000119
- The paper
- Akkarajitsakul, K., Hossain, E., Niyato, D., & Kim, D. I. (2011). Game Theoretic Approaches for Multiple Access in Wireless Networks: A Survey. IEEE Communications Surveys & Tutorials. https://doi.org/10.1109/surv.2011.122310.000119
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.