Impact of NOMA on Age of Information: A Grant-Free Transmission Perspective

The aim of this paper is to characterize the impact of non-orthogonal multiple access (NOMA) on the age of information (AoI) of grant-free transmission. In particular, a low-complexity form of NOMA, termed NOMA-assisted random access, is applied to grant-free transmission in order to illustrate the two benefits of NOMA for AoI reduction, namely increasing channel access and reducing user collisions. Closed-form analytical expressions for the AoI achieved by NOMA assisted grant-free transmission are obtained, and asymptotic studies are carried out to demonstrate that the use of the simplest form of NOMA is already sufficient to reduce the AoI of orthogonal multiple access (OMA) by more than 40%. In addition, the developed analytical expressions are also shown to be useful for optimizing the users' transmission attempt probabilities, which are key parameters for grant-free transmission.

[1]  Ye Wang,et al.  Multitype Services Coexistence in Uplink NOMA for Dual-Layer LEO Satellite Constellation , 2023, IEEE Internet of Things Journal.

[2]  Haiyang Ding,et al.  Enhancing Physical-Layer Security for IoT With Nonorthogonal Multiple Access Assisted Semi-Grant-Free Transmission , 2022, IEEE Internet of Things Journal.

[3]  Ankit Kumar Gupta,et al.  Design and performance evaluation of successive interference cancellation based Slotted Aloha MAC protocol , 2022, Phys. Commun..

[4]  Fang Fang,et al.  Optimizing Age of Information in RIS-Assisted NOMA Networks: A Deep Reinforcement Learning Approach , 2022, IEEE Wireless Communications Letters.

[5]  H. Poor,et al.  Age of Information: Can CR-NOMA Help? , 2022, IEEE Transactions on Communications.

[6]  A. Liu,et al.  Non-Orthogonal Multiple Access-Based Average Age of Information Minimization in LEO Satellite-Terrestrial Integrated Networks , 2022, IEEE Transactions on Green Communications and Networking.

[7]  Jiaxin Liang,et al.  Age of Information in SIC-based Non-Orthogonal Multiple Access , 2022, 2022 IEEE Wireless Communications and Networking Conference (WCNC).

[8]  Jung Woo Baek,et al.  Age of Information and Throughput in Random Access-Based IoT Systems With Periodic Updating , 2022, IEEE Wireless Communications Letters.

[9]  Jie Jia,et al.  Resource Allocation for IRS Assisted SGF NOMA Transmission: A MADRL Approach , 2022, IEEE Journal on Selected Areas in Communications.

[10]  H. Poor,et al.  Age- and Correlation-Aware Information Gathering , 2022, IEEE Wireless Communications Letters.

[11]  Bo Ai,et al.  OTFS-TSMA for Massive Internet of Things in High-Speed Railway , 2021, IEEE Transactions on Wireless Communications.

[12]  João Luiz Rebelatto,et al.  Age of Information of SIC-Aided Massive IoT Networks With Random Access , 2021, IEEE Internet of Things Journal.

[13]  Jinho Choi,et al.  Grant-Free Random Access in Machine-Type Communication: Approaches and Challenges , 2020, IEEE Wireless Communications.

[14]  P. Fan,et al.  Bayesian Learning Based Multiuser Detection for Grant-Free NOMA Systems , 2022, IEEE Transactions on Wireless Communications.

[15]  Lingyang Song,et al.  Age of Information Minimization for Grant-Free Non-Orthogonal Massive Access Using Mean-Field Games , 2021, IEEE Transactions on Communications.

[16]  Victor C. M. Leung,et al.  Timely Information Update With Nonorthogonal Multiple Access , 2021, IEEE Transactions on Industrial Informatics.

[17]  Chandra R. Murthy,et al.  On the Minimum Average Age of Information in IRSA for Grant-Free mMTC , 2021, IEEE Journal on Selected Areas in Communications.

[18]  Andrea Munari,et al.  Modern Random Access: An Age of Information Perspective on Irregular Repetition Slotted ALOHA , 2020, IEEE Transactions on Communications.

[19]  Elif Uysal,et al.  Analysis of Slotted ALOHA With an Age Threshold , 2020, IEEE Journal on Selected Areas in Communications.

[20]  Erik G. Larsson,et al.  Towards 6G wireless communication networks: vision, enabling technologies, and new paradigm shifts , 2020, Science China Information Sciences.

[21]  Limin Xiao,et al.  Pilot domain NOMA for grant-free massive random access in massive MIMO marine communication system , 2020, China Communications.

[22]  Amr M. Youssef,et al.  NOMA-Assisted Machine-Type Communications in UDN: State-of-the-Art and Challenges , 2020, IEEE Communications Surveys & Tutorials.

[23]  Daiming Qu,et al.  Analysis of Non-Orthogonal Sequences for Grant-Free RA With Massive MIMO , 2020, IEEE Transactions on Communications.

[24]  Naveen Mysore Balasubramanya,et al.  Toward the Standardization of Grant-Free Operation and the Associated NOMA Strategies in 3GPP , 2019, IEEE Communications Standards Magazine.

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

[26]  Anthony Ephremides,et al.  Minimizing The Age of Information: NOMA or OMA? , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[27]  Pingzhi Fan,et al.  Simple Semi-Grant-Free Transmission Strategies Assisted by Non-Orthogonal Multiple Access , 2018, IEEE Transactions on Communications.

[28]  Erik G. Larsson,et al.  Grant-Free Massive MTC-Enabled Massive MIMO: A Compressive Sensing Approach , 2018, IEEE Transactions on Communications.

[29]  Wei Yu,et al.  Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things , 2018, IEEE Signal Processing Magazine.

[30]  Yitong Li,et al.  Maximum Sum Rate of Slotted Aloha With Successive Interference Cancellation , 2018, IEEE Transactions on Communications.

[31]  Wei Yu,et al.  Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation , 2017, IEEE Transactions on Signal Processing.

[32]  Jinho Choi,et al.  NOMA-Based Random Access With Multichannel ALOHA , 2017, IEEE Journal on Selected Areas in Communications.

[33]  Branka Vucetic,et al.  Random Access for M2M Communications With QoS Guarantees , 2017, IEEE Transactions on Communications.

[34]  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.

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