Name
Title | ||
|---|---|---|
AoI Minimization for Grant-Free Massive Access with Short Packets using Mean-Field Games. |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/GLOBECOM42002.2020.9348014 | GLOBECOM |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongliang Zhang | 1 | 577 | 47.71 |
| Yuhan Kang | 2 | 6 | 2.48 |
| Zhu Han | 3 | 0 | 0.34 |
| H. V. Poor | 4 | 25411 | 1951.66 |