Future wireless networks are envisioned to serve massive Internet of things (mIoT) via some radio access technologies, where the random access channel (RACH) procedure should be exploited for IoT devices to access the networks. However, the theoretical analysis of the RACH procedure for massive IoT devices is challenging. To address this challenge, we first correlate the RACH request of an IoT device with the status of its maintained queue and analyze the evolution of the queue status. Based on the analysis result, we then derive the closed-form expression of the random access (RA) success probability, which is a significant indicator characterizing the RACH procedure of the device. Besides, considering the agreement on converging different services onto a shared infrastructure, we investigate the RAN slicing for mIoT and bursty ultra-reliable and low latency communications (URLLC) service multiplexing. Specifically, we formulate the RAN slicing problem as an optimization one to maximize the total RA success probabilities of all IoT devices and provide URLLC services for URLLC devices in an energy-efficient way. A slice resource optimization (SRO) algorithm exploiting relaxation and approximation with provable tightness and error bound is then proposed to mitigate the optimization problem. Simulation results demonstrate that the proposed SRO algorithm can effectively implement the service multiplexing of mIoT and bursty URLLC traffic.

翻译：未来无线网络预计将通过某些无线电接入技术为大型事物互联网(mIoT)服务,其中随机访问频道(RACH)程序应被随机应用为IoT设备进入网络的随机访问通道(RACH)程序,然而,对大型IoT设备RACH程序的理论分析具有挑战性。为了应对这一挑战,我们首先将RACH对IoT设备的要求与其保持的队列状态联系起来,并分析队列状态的演变情况。根据分析结果,我们随后得出随机访问(RA)成功概率的封闭形式表现,这是该设备RACH程序特征的一个重要指标。此外,考虑到将不同服务融合到共享基础设施的协议,我们调查RACH对大型 IoT设备大规模IoT设备进行的理论分析是具有挑战性的。为了应对这一挑战,我们首先将RAHT设备对它的要求与其保持的排队列状态联系起来,并分析队列状态的演变情况。我们然后根据分析结果,得出随机访问概率(RA)所有IoT设备成功概率的封闭式表达,并以节能方式为URLC设备提供URLC设备的重要指标。此外,我们还要考虑将不同服务合并协议,以便有效地将MIOSimalalimalalalmaimalmabormabal,以便有效实施。