AoI Minimization for Grant-Free Massive Access with Short Packets using Mean-Field Games

Grant-free (GF) access, where channels are accessed without undergoing assignment through a handshake process, is a promising solution to support the massive connectivity for IoT networks. In this paper, we consider uplink GF massive access for an IoT network. IoT devices generate short packets and transmit the generated packets by GF non-orthogonal multiple access (NOMA) communications. To keep the information fresh, we first derive the age of information (AoI) in the GF short-packet communications and then formulate the AoI minimization problem. However, the AoI minimization problem is challenging to solve since the number of users involved is large. To tackle this problem efficiently, we propose a mean-field evolutionary game-based scheme where the average behavior of the IoT nodes will be considered rather than their individual behavior to reduce the complexity. Simulation results verify the effectiveness of the proposed mean-field evolutionary game-based algorithm.

[1]  Lingyang Song,et al.  IoT-U: Cellular Internet-of-Things Networks Over Unlicensed Spectrum , 2019, IEEE Transactions on Wireless Communications.

[2]  Branka Vucetic,et al.  A Novel Analytical Framework for Massive Grant-Free NOMA , 2019, IEEE Transactions on Communications.

[3]  Ness B. Shroff,et al.  Age-optimal Sampling and Transmission Scheduling in Multi-Source Systems , 2018, MobiHoc.

[4]  Jun Lu,et al.  Population Games and Discrete Optimal Transport , 2017, Journal of Nonlinear Science.

[5]  Guowang Miao,et al.  Grant-Free Radio Access for Short-Packet Communications over 5G Networks , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[6]  Nelson Luis Saldanha da Fonseca,et al.  The Random Access Procedure in Long Term Evolution Networks for the Internet of Things , 2017, IEEE Communications Magazine.

[7]  Yan Chen,et al.  Grant-Free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things , 2016, IEEE Communications Letters.

[8]  Giuseppe Durisi,et al.  Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels , 2016, IEEE Transactions on Communications.

[9]  Roy D. Yates,et al.  Update or wait: How to keep your data fresh , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[10]  Roy D. Yates,et al.  Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.

[11]  Roy D. Yates,et al.  Status updates through queues , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).