Energy-Aware Resource Optimization for Improved URLLC in Multi-hop Integrated Aerial Terrestrial Networks

Awais, Muhammad and Pervaiz, Haris and Jamshed, Muhammad Ali and Yu, Wenjuan and Ni, Qiang (2024) Energy-Aware Resource Optimization for Improved URLLC in Multi-hop Integrated Aerial Terrestrial Networks. IEEE Transactions on Green Communications and Networking, 8 (1). pp. 252-264. ISSN 2473-2400

Text (Author_final_accepted version)
Author_final_accepted_version.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (633kB)

Abstract

The development of futuristic wireless infrastructure necessitates low power consumption, high reliability, and massive connectivity. One of the most promising solutions to address these requirements is the integration of aerial base station (ABS) based communication systems that employ both in the air (aerial) and on the ground (terrestrial) components. This integration enhances line of sight connections, enabling the fulfillment of escalating quality-of-service (QoS) demands. This article examines the problem of resource allocation in ABS assisted multi-hop wireless networks. We investigate a joint optimization problem that involves subcarrier (SC) assignment, power allocation, and blocklength allocation, subject to delay, reliability, and QoS constraints to improve the sum-rate under the finite blocklength (FBL) regime. We propose an approach for SC allocation and selection of cooperative ABSs based on matching theory. Subsequently, we employ an alternating optimization method to propose a novel bisection-based low-complexity adaptation (BLCA) algorithm to optimize the resource allocation policy. This algorithm includes a two-step projected gradient descent-based strategy to optimize the power allocation on each SC using dynamic and geometric programming. Furthermore, we examine flexible blocklength and power allocation use cases under the next generation of multiple access techniques. Monte-Carlo simulations validate that the proposed algorithmic solution significantly achieves a near-optimal solution while requiring 1600 times less computational cost compared to benchmarks in its counterparts.