The DOI matches its Crossref record; 130 of the 130 references it cites were found in a registry or an index.
Toward Massive Machine Type Communications in Ultra-Dense Cellular IoT Networks: Current Issues and Machine Learning-Assisted Solutions
Open accessAbstract
The ever-increasing number of resource-constrained machine-type communication (MTC) devices is leading to the critical challenge of fulfilling diverse communication requirements in dynamic and ultra-dense wireless environments. Among different application scenarios that the upcoming 5G and beyond cellular networks are expected to support, such as enhanced mobile broadband (eMBB), massive machine type communications (mMTCs), and ultra-reliable and low latency communications (URLLCs), the mMTC brings the unique technical challenge of supporting a huge number of MTC devices in cellular networks, which is the main focus of this paper. The related challenges include quality of service (QoS) provisioning, handling highly dynamic and sporadic MTC traffic, huge signalling overhead, and radio access network (RAN) congestion. In this regard, this paper aims to identify and analyze the involved technical issues, to review recent advances, to highlight potential solutions and to propose new research directions. First, starting with an overview of mMTC features and QoS provisioning issues, we present the key enablers for mMTC in cellular networks. Along with the highlights on the inefficiency of the legacy random access (RA) procedure in the mMTC scenario, we then present the key features and channel access mechanisms in the emerging cellular IoT standards, namely, LTE-M and narrowband IoT (NB-IoT). Subsequently, we present a framework for the performance analysis of transmission scheduling with the QoS support along with the issues involved in short data packet transmission. Next, we provide a detailed overview of the existing and emerging solutions toward addressing RAN congestion problem, and then identify potential advantages, challenges, and use cases for the applications of emerging machine learning (ML) techniques in ultra-dense cellular networks. Out of several ML techniques, we focus on the application of low-complexity Q-learning approach in the mMTC scenario along with the recent advances toward enhancing its learning performance and convergence. Finally, we discuss some open research challenges and promising 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
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
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Internet of Things: A Survey on Enabling Technologies, Protocols, and Applications
Al-Fuqaha, A., Guizani, M., Mohammadi, M., Aledhari, M., & Ayyash, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2444095 · Cited by 8,630
Backpropagation through time: what it does and how to do it
Werbos, P. J. (1990) · Proceedings of the IEEE · doi:10.1109/5.58337 · Cited by 4,879 · cited 1×
“can be adjusted to be as large as the length of the input data sequence, and the extended version of backpropagation algorithm, called Backpropagation through time [167] can be utilized to train the network.”
MethodDeep Reinforcement Learning: A Brief Survey
Arulkumaran, K., Deisenroth, M. P., Brundage, M., & Bharath, A. A. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2743240 · Cited by 4,733 · cited 4×
“…rewards from the environment, resulting in the return of L l =0 γ l r l +1 , where γ ∈ [0 1] is the discount factor which provides more weights on the immediate rewards and L denotes the length of one episode, which denotes the time period after which the state is reset for an episodic MDP [45].”
BackgroundMethodInfluentialA Brief Survey of Deep Reinforcement Learning
Arulkumaran, K., Deisenroth, M. P., Brundage, M., & Bharath, A. A. (2017) · arXiv · doi:10.48550/arxiv.1708.05866 · Cited by 4,733
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1023/a:1022676722315 · Cited by 3,907
A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection
Buczak, A. L., & Guven, E. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2494502 · Cited by 3,332 · cited 1×
“In addition, Neural Networks (NNs) can be utilized to detect network intrusion and in this context, authors in [31] have provided a comprehensive review of ML and data mining techniques for intrusion detection in cyber analytic applications.”
BackgroundDeep Reinforcement Learning with Double Q-Learning
Van Hasselt, H., Guez, A., & Silver, D. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10295 · Cited by 3,318
Cited by
On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds
Wang, C.-X., You, X., Gao, X., Zhu, X., Li, Z., Zhang, C., Wang, H., Huang, Y., Chen, Y., Haas, H., et al. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3249835 · Cited by 2,336
Satellite Communications in the New Space Era: A Survey and Future Challenges
Kodheli, O., Lagunas, E., Maturo, N., Sharma, S. K., Shankar, B., Montoya, J. F. M., Duncan, J. C. M., Spano, D., Chatzinotas, S., Kisseleff, S., et al. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3028247 · Cited by 1,524
Self-citationEnabling Massive IoT Toward 6G: A Comprehensive Survey
Guo, F., Yu, F. R., Zhang, H., Li, X., Ji, H., & Leung, V. C. M. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3063686 · Cited by 701
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
Self-citation6G Wireless Communications Networks: A Comprehensive Survey
Alsabah, M., Naser, M. A., Mahmmod, B. M., Abdulhussain, S. H., Eissa, M. R., Al-Baidhani, A., Noordin, N. K., Sait, S. M., Al-Utaibi, K. A., & Hashim, F. (2021) · IEEE Access · doi:10.1109/access.2021.3124812 · Cited by 575
Hussain, F., Hassan, S. A., Hussain, R., & Hossain, E. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2964534 · Cited by 395
A Review of Machine Learning Approaches to Power System Security and Stability
Alimi, O. A., Ouahada, K., & Abu-Mahfouz, A. M. (2020) · IEEE Access · doi:10.1109/access.2020.3003568 · Cited by 377
IoT Connectivity Technologies and Applications: A Survey
Ding, J., Nemati, M., Ranaweera, C., & Choi, J. (2020) · IEEE Access · doi:10.1109/access.2020.2985932 · Cited by 374
Distributed Control and Communication Strategies in Networked Microgrids
Zhou, Q., Shahidehpour, M., Paaso, A., Bahramirad, S., Alabdulwahab, A., & Abusorrah, A. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3023963 · Cited by 307
Deep Reinforcement Learning for Autonomous Internet of Things: Model, Applications and Challenges
Lei, L., Tan, Y., Zheng, K., Liu, S., Zhang, K., & Shen, X. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2988367 · Cited by 298
LPWAN Technologies: Emerging Application Characteristics, Requirements, and Design Considerations
Chaudhari, B. S., Zennaro, M., & Borkar, S. (2020) · Future Internet · doi:10.3390/fi12030046 · Cited by 263
Distributed Q-Learning Aided Uplink Grant-Free NOMA for Massive Machine-Type Communications
Liu, J., Shi, Z., Zhang, S., & Kato, N. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3078496 · Cited by 53
SPEED: A Deep Learning Assisted Privacy-Preserved Framework for Intelligent Transportation Systems
Usman, M., Jan, M. A., & Jolfaei, A. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3031721 · Cited by 32
Metadata
- Authors
- Sharma, S. K., & Wang, X.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2020
- Volume
- 22
- Issue
- 1
- Pages
- 426-471
- ISSN
- 1553-877X (ISSN-L)
- 2373-745X
- OpenAlex
- W2887019724
- Cited by
- 427
- References
- 130
- FWCI
- 20.97
- 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.