Achieving Low Latency in Massive Access: A Mean-Field Approach

摘要

The next generation massive access has attracted considerable recent attention due to its potential in smart meters, industrial internet of things (IIoT), and smart traffics, etc. However, how to achieve the minimum queuing delay in massive access still remains open, thereby making quality-of-service (QoS) assurance a challenging issue in practice. In this paper, we aim at minimizing the average queuing delay by applying cross-layer scheduling with joint channel and buffer awareness, the complexity of which increases exponentially with the number of users. Fortunately, with massive users or devices, mean-field approximation can be adopted to substantially simplify the design and analysis of the delay-optimal scheduling. More specifically, we present a cocktail filling policy and a queue-aware multiuser diversity protocol, in which all backlogged packets of a user will be served by either NOMA or TDMA mode respectively, if the user’s channel gain is beyond a certain threshold. The average queuing delay and queue-length-violation probability are derived based on a Markov model. Numerical results will also demonstrate that the mean-field approximation based joint physical and network layer scheduling is capable of improving the QoS in massive access.