Most existing works on random access for machine-type communication (MTC) assume independent device activities. However, in several Internet-of-Things (IoT) applications, device activities are driven by events and hence may be correlated. This paper investigates the joint optimization of preamble selection and access barring for correlated device activities. We adopt a random access scheme with general random preamble selection parameterized by the preamble selection distributions of all devices and an access barring scheme parameterized by the access barring factor, to maximally exploit correlated device activities for improving the average throughput. First, we formulate the average throughput maximization problem with respect to the preamble selection distributions and the access barring factor. It is a challenging nonconvex problem. We characterize an optimality property of the problem. Then, we develop two iterative algorithms to obtain a stationary point and a low-complexity solution respectively by using the block coordinate descend (BCD) method. Numerical results show that the two proposed solutions achieve significant gains over existing schemes, demonstrating the significance of exploiting correlation of device activities in improving the average throughput. Numerical results also show that compared to the stationary point, the low-complexity solution achieves a similar average throughput with much lower computational complexity, demonstrating the effectiveness of the low-complexity solution.
翻译:大多数关于随机访问机器类型通信(MTC)的现有工作大多采用独立的设备活动。然而,在几个互联网连接应用程序中,设备活动是由事件驱动的,因此可能是相互关联的。本文件调查了共同优化序言选择和访问,但与此相关的设备活动除外。我们采用了一种随机访问计划,根据所有设备的序言选择分布和接入阻塞计划参数,以所有设备的接入阻塞系数参数为总体随机选择序言选择参数,并采用接入阻塞参数为参数,以最大限度地利用相关设备活动,改进平均吞吐量。首先,我们提出了序言选择分布和访问阻塞因素方面的平均吞吐量最大化问题。这是一个具有挑战性的非convex问题。我们确定了这一问题的最佳性属性。然后,我们开发了两种迭代算法,分别使用区块坐标递增法(BCD),以获得固定点和低兼容性解决方案的参数。数字结果表明,两种拟议解决方案在改进平均吞吐量分配和访问限制因素方面利用设备活动的相关性,其重要性也表明在改进平均吞吐量和访问限制因素方面,通过较低的计算结果也显示与低度解决方案相比具有相似性。