The emerging Industrial Internet of Things (IIoT) is driving an ever increasing demand for providing low latency services to massive devices over wireless channels. As a result, how to assure the quality-of-service (QoS) for a large amount of mobile users is becoming a challenging issue in the envisioned sixth-generation (6G) network. In such networks, the delay-optimal wireless access will require a joint channel and queue aware scheduling, whose complexity increases exponentially with the number of users. In this paper, we adopt the mean field approximation to conceive a buffer-aware multi-user diversity or opportunistic access protocol, which serves all backlogged packets of a user if its channel gain is beyond a threshold. A theoretical analysis and numerical results will demonstrate that not only the cross-layer scheduling policy is of low complexity but is also asymptotically optimal for a huge number of devices.
翻译:新兴的工业物业互联网(IIoT)正在推动对通过无线频道向大型装置提供低长期服务的需求不断增加,因此,如何确保大量移动用户的服务质量(Qos)正在成为设想的第六代(6G)网络中的一个棘手问题,在这种网络中,延迟最理想的无线接入将需要一个有意识的联合频道和排队列表,其复杂性随着用户人数的增加而成倍增加。在本文中,我们采用了中值的实地近似,以设想一种缓冲多用户多样性或机会访问协议,如果一个用户的频道收成超过门槛,它就会为其所有积压的包件提供服务。理论分析和数字结果将表明,不仅跨层排队政策是低复杂性的,而且对大量设备来说也是同样最佳的。