vix.ing · top · new · best · stats · spec

Data Service Maximization in Space-Air-Ground Integrated 6G Networks

2024/05/30 by Nway Nway Ei, Ei, Nway Nway, Ki Tae Kim +5
Engineering · #Advanced MIMO Systems Optimization #Advanced Wireless Communication Technologies #FOS: Computer and information sciences #FOS: Electrical engineering #Networking and Internet Architecture (cs.NI) #Signal Processing (eess.SP) #Telecommunications and Broadcasting Technologies #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.2405.19771

openalex publication_date 2024/05/30 · openalex created_date 2024/06/01 · openalex updated_date 2026/07/28

Abstract

Integrating terrestrial and non-terrestrial networks has emerged as a promising paradigm to fulfill the constantly growing demand for connectivity, low transmission delay, and quality of services (QoS). This integration brings together the strengths of the reliability of terrestrial networks, broad coverage and service continuity of non-terrestrial networks like low earth orbit satellites (LEOSats), etc. In this work, we study a data service maximization problem in space-air-ground integrated network (SAGIN) where the ground base stations (GBSs) and LEOSats cooperatively serve the coexisting aerial users (AUs) and ground users (GUs). Then, by considering the spectrum scarcity, interference, and QoS requirements of the users, we jointly optimize the user association, AU's trajectory, and power allocation. To tackle the formulated mixed-integer non-convex problem, we disintegrate it into two subproblems: 1) user association problem and 2) trajectory and power allocation problem. We formulate the user association problem as a binary integer programming problem and solve it by using the Gurobi optimizer. Meanwhile, the trajectory and power allocation problem is solved by the deep deterministic policy gradient (DDPG) method to cope with the problem's non-convexity and dynamic network environments. Then, the two subproblems are alternately solved by the proposed block coordinate descent algorithm. By comparing with the baselines in the existing literature, extensive simulations are conducted to evaluate the performance of the proposed framework.

Related