A Resource-Efficient Coexistence Scheme for Massive Machine-Type and Human-to-Human Communications

被引:2
作者
Wang, Tao [1 ]
Wang, Yichen [1 ]
Wang, Yixin [1 ]
Cheng, Julian [2 ]
机构
[1] Xi An Jiao Tong Univ, Sch Informat & Commun Engn, Xian 710049, Shaanxi, Peoples R China
[2] Univ British Columbia, Sch Engn, Kelowna, BC V1V1V7, Canada
基金
中国国家自然科学基金;
关键词
Massive machine-type communication (mMTC); human-to-human (H2H) communication; coexisting network; resource allocation; time-nonhomogeneous Markov chain; RANDOM-ACCESS; M2M/H2H COEXISTENCE; ALLOCATION; MTC; NETWORKS;
D O I
10.1109/TCOMM.2023.3337785
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The fifth-generation (5G) and beyond networks are expected to accommodate both the original human-to-human (H2H) communication and the emerging massive machine-type communication (mMTC). To enable a harmonious coexistence between the two different types of services, we propose a resource-efficient mMTC/H2H coexistence scheme by jointly considering the random access (RA) and data transmission, where the entire uplink resources are divided for the proposed RA and data transmission procedures. Based on the proposed scheme, we derive the average achievable throughput of the bursty mMTC service and develop a time-nonhomogeneous Markov chain model to characterize the joint state transition of H2H user equipments (HUEs). To tackle the cumbersome Markov model, we approximately decompose the constructed time-nonhomogeneous Markov model into multiple independent Markov chains, where each decomposed Markov chain characterizes one single HUE's state transition. Then, the decomposed Markov model is transformed into a semi-Markov process and the corresponding steady-state condition is obtained based on the queueing network analysis for H2H service. By approximating the evolution of number of HUEs in different states as M/M/1 queues, we derive the stationary probabilities for the embedded Markov chain of the semi-Markov process and obtain the data transmission success probability of each HUE. Based on the abovementioned analytical framework, we formulate a constrained nonlinear integer programming (NLIP) problem to maximize the mMTC throughput under the constraints of H2H quality-of-service (QoS) stabilization and resource allocation. By adopting the modified particle swarm optimization (PSO) algorithm, we solve the formulated problem and obtain the efficient resource allocation strategy for the mMTC/H2H coexistence. Simulation results demonstrate that the developed analytical framework and modified PSO algorithm achieve close to the optimal mMTC/H2H coexisting performance and can be adapted to various network settings.
引用
收藏
页码:1862 / 1877
页数:16
相关论文
共 49 条
[1]  
[Anonymous], 2022, document TS 22.368
[2]  
[Anonymous], 2021, Ericsson Mobility Reports
[3]  
Azari A., 2017, PROC IEEE INT C COMM, P1
[4]   Intelligent RACH Access Techniques to Support M2M Traffic in Cellular Networks [J].
Bello, Lawal Mohammed ;
Mitchell, Paul Daniel ;
Grace, David .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (09) :8905-8918
[5]   Massive Access for 5G and Beyond [J].
Chen, Xiaoming ;
Ng, Derrick Wing Kwan ;
Yu, Wei ;
Larsson, Erik G. ;
Al-Dhahir, Naofal ;
Schober, Robert .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2021, 39 (03) :615-637
[6]   Two-Phase Random Access Procedure for LTE-A Networks [J].
Cheng, Ray-Guang ;
Becvar, Zdenek ;
Huang, Yi-Shin ;
Bianchi, Giuseppe ;
Harwahyu, Ruki .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (04) :2374-2387
[7]  
Ching K., 2013, International Series in Opera-tions Research & Management Science), V189
[8]  
de Andrade TPC, 2015, IEEE ICC, P5979, DOI 10.1109/ICC.2015.7249275
[9]   A QUEUING SYSTEM WITH IMPATIENT CUSTOMERS [J].
DEKOK, AG ;
TIJMS, HC .
JOURNAL OF APPLIED PROBABILITY, 1985, 22 (03) :688-696
[10]   Learning Automata-Based Access Class Barring Scheme for Massive Random Access in Machine-to-Machine Communications [J].
Di, Chong ;
Zhang, Bo ;
Liang, Qilian ;
Li, Shenghong ;
Guo, Ying .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (04) :6007-6017