Throughput Optimization With Delay Guarantee for Massive Random Access of M2M Communications in Industrial IoT

被引:41
作者
Zhang, Changwei [1 ,2 ]
Sun, Xinghua [3 ,4 ]
Zhang, Jun [1 ,2 ]
Wang, Xianbin [5 ]
Jin, Shi [6 ]
Zhu, Hongbo [1 ,2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Jiangsu Key Lab Wireless Commun, Nanjing 210003, Jiangsu, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Engn Res Ctr Hlth Serv Syst Based Ubiquitous Wire, Minist Educ, Nanjing 210003, Jiangsu, Peoples R China
[3] Sun Yat Sen Univ, Sch Elect & Commun Engn, Guangzhou 510006, Guangdong, Peoples R China
[4] Chinese Acad Sci, Shanghai Inst Microsyst & Informat Technol, Key Lab Wireless Sensor Network & Commun, Shanghai 200050, Peoples R China
[5] Univ Western Ontario, Dept Elect & Comp Engn, London, ON N6A 5B9, Canada
[6] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Delay; industrial Internet-of-Things (IIoT); machine-to-machine (M2M) communications; random access (RA); throughput optimization; NETWORKS; INTERNET;
D O I
10.1109/JIOT.2019.2935548
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The machine-to-machine (M2M) communication is an emerging technology that is widely utilized in a vast number of industrial Internet-of-Things (IIoT) applications. Due to the diversity of IIoT applications, provisioning of heterogeneous delay requirements of delay-sensitive machine type devices (MTDs) while optimizing the access efficiency of delay-tolerate MTDs becomes a critical challenge for M2M communications. To address this issue, a multigroup analytical framework for massive random access of M2M communications in IIoT is proposed in this article. Specifically, we consider delay-sensitive MTDs and delay-tolerate MTDs coexist in the network, and those MTDs are divided into multiple groups according to their delay requirements. The access behavior of each MTD is characterized by a double-queue model. Based on this model, the throughput and the mean access delay of each group are characterized. It is found that for each group, the mean access delay decreases as the throughput increases and is minimized when the throughput is maximized. To achieve the maximum throughput of delay-tolerate MTDs under delay constraints of delay-sensitive MTDs, the backoff parameters of delay-sensitive MTDs should be tuned according to the delay constraints while that of delay-tolerate MTDs should be tuned further according to the aggregate packet arrival rate and the number of MTDs in each group. It is further demonstrated that the optimal tuning of backoff parameters is robust against the burstiness of input traffic. The analysis sheds important light on the access design of M2M communications in IIoT with delay constraints.
引用
收藏
页码:10077 / 10092
页数:16
相关论文
共 39 条
[1]  
3GPP, 2011, Technical Specification (TS) 37.868
[2]   IoT Traffic Management and Integration in the QoS Supported Network [J].
Al-Shammari, Basim K. J. ;
Al-Aboody, Nadia ;
Al-Raweshidy, Hamed S. .
IEEE INTERNET OF THINGS JOURNAL, 2018, 5 (01) :352-370
[3]   Context-Sensitive Access in Industrial Internet of Things (IIoT) Healthcare Applications [J].
Al-Turjman, Fadi ;
Alturjman, Sinem .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2018, 14 (06) :2736-2744
[4]  
[Anonymous], 2011, 36211 TS 3GPP
[5]  
[Anonymous], 2015, 36321 TS 3GPP
[6]   On the Adaptive Determination of the Number of Preambles in RACH for MTC [J].
Choi, Jinho .
IEEE COMMUNICATIONS LETTERS, 2016, 20 (07) :1385-1388
[7]   Stability and Delay Analysis of Buffered Aloha Networks [J].
Dai, Lin .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2012, 11 (08) :2707-2719
[8]   D-ACB: Adaptive Congestion Control Algorithm for Bursty M2M Traffic in LTE Networks [J].
Duan, Suyang ;
Shah-Mansouri, Vahid ;
Wang, Zehua ;
Wong, Vincent W. S. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (12) :9847-9861
[9]  
Gross D., 2008, FUNDAMENTALS QUEUEIN
[10]   Mobile-Edge Computation Offloading for Ultradense IoT Networks [J].
Guo, Hongzhi ;
Liu, Jiajia ;
Zhang, Jie ;
Sun, Wen ;
Kato, Nei .
IEEE INTERNET OF THINGS JOURNAL, 2018, 5 (06) :4977-4988