Energy Efficient AoI Minimization in Opportunistic NOMA/OMA Broadcast Wireless Networks

The concept of Age of Information (AoI) minimization in wireless networks has garnered huge interest in recent times. While current literature focuses on scheduling for AoI minimization, there is also a need to efficiently utilize the underlying physical layer resources. In this paper, we consider t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on green communications and networking 2022-06, Vol.6 (2), p.1009-1022
Main Authors: Sharan, B. A. G. Ravi, Deshmukh, Siddharth, B. Pillai, Sibi Raj, Beferull-Lozano, Baltasar
Format: Article
Language:English
Subjects:
Age of information
Energy efficiency
energy-efficiency (EE)
Job shop scheduling
Lyapunov optimization theory
Minimization
Mixed integer
multi-user scheduling
NOMA
non-orthogonal multiple access (NOMA)
Optimization
Quality of service
Quality of service architectures
Resource allocation
Resource management
Scheduling
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The concept of Age of Information (AoI) minimization in wireless networks has garnered huge interest in recent times. While current literature focuses on scheduling for AoI minimization, there is also a need to efficiently utilize the underlying physical layer resources. In this paper, we consider the problem of energy-efficient scheduling for AoI minimization in an opportunistic NOMA/OMA downlink broadcast wireless network, where the user equipment operate with diverse QoS requirements. We first formulate a resource allocation problem to minimize the average AoI of the network, with energy-efficiency factored in by restricting the long term average transmit power to a predetermined threshold. A heuristic adaptation of the drift-plus-penalty approach from the Lyapunov framework is then utilized to solve the original long-term mixed-integer nonlinear problem on a per time-slot basis. The single time-slot problem is further decomposed into multiple sub-problems, solving for power allocation and user scheduling separately. However, the attained power allocation sub-problems being non-convex, we propose an efficient piece-wise linear approximation to obtain a tractable solution. The scheduling sub-problem is solved optimally by using the integrality property of the linear program. Finally, we provide extensive numerical simulations to show that our proposed approach outperforms the state of the art.
ISSN:2473-2400
2473-2400
DOI:10.1109/TGCN.2021.3135351