Open Access
ARTICLE
Two-Hop Delay-Aware Energy Efficiency Resource Allocation in Space-Air-Ground Integrated Smart Grid Network
1 Beijing FibrLink Communications Co. Ltd., Beijing, 100071, China
2 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China
* Corresponding Author: Yang Yang. Email:
Computers, Materials & Continua 2025, 83(2), 2429-2447. https://doi.org/10.32604/cmc.2025.062067
Received 09 December 2024; Accepted 06 February 2025; Issue published 16 April 2025
Abstract
The lack of communication infrastructure in remote regions presents significant obstacles to gathering data from smart power sensors (SPSs) in smart grid networks. In such cases, a space-air-ground integrated network serves as an effective emergency solution. This study addresses the challenge of optimizing the energy efficiency of data transmission from SPSs to low Earth orbit (LEO) satellites through unmanned aerial vehicles (UAVs), considering both effective capacity and fronthaul link capacity constraints. Due to the non-convex nature of the problem, the objective function is reformulated, and a delay-aware energy-efficient power allocation and UAV trajectory design (DEPATD) algorithm is proposed as a two-loop approach. Since the inner loop remains non-convex, the block coordinate descent (BCD) method is employed to decompose it into three subproblems: power allocation for SPSs, power allocation for UAVs, and UAV trajectory design. The first two subproblems are solved using the Lagrangian dual method, while the third is addressed with the successive convex approximation (SCA) technique. By iteratively solving these subproblems, an efficient algorithm is developed to resolve the inner loop issue. Simulation results demonstrate that the energy efficiency of the proposed DEPATD algorithm improves by 4.02% compared to the benchmark algorithm when the maximum transmission power of the SPSs increases from 0.1 to 0.45 W.Keywords
Cite This Article

This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.