Resource Allocation and Sharing for UAV-Assisted Integrated TN-NTN with Multi-Connectivity

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Khan, Abd Ullah, Khan, Wali Ullah, Jung, Haejoon, Shin, Hyundong
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866918304736608256
author Khan, Abd Ullah
Khan, Wali Ullah
Jung, Haejoon
Shin, Hyundong
author_facet Khan, Abd Ullah
Khan, Wali Ullah
Jung, Haejoon
Shin, Hyundong
contents Unmanned aerial vehicles (UAVs) with multi-connectivity (MC) capabilities efficiently and reliably transfer data between terrestrial networks (TNs) and non-terrestrial networks (NTNs). However, optimally sharing and allocating spectrum and power resources to maintain MC while ensuring reliable connectivity and optimal performance remains challenging in such networks. Channel variations induced by mobility in UAV networks, coupled with the varying quality of service (QoS) demands of heterogeneous devices, resource sharing, and fairness requirements in capacity distribution pose challenges to optimal resource allocation. Thus, this paper investigates resource allocation for QoS-constrained, MC-enabled, dynamic UAVs in an integrated TN-NTN environment with spectrum sharing and fairness considerations. To this end, we consider three types of links: UAV-to-radio base station (RBS), UAV-to-UAV, and UAV-to-HAP. We also assume two types of UAVs with diverse QoS requirements to reflect a practical scenario. Consequently, we propose two algorithms. The first algorithm maximizes the capacity of UAVs-RBS and UAVs-HAP links while ensuring the reliability of the UAV-UAV link. To achieve this, the algorithm maximizes the collective throughput of the UAVs by optimizing the sum capacity of all the UAV-RBS and UAV-HAP links. Next, to provide constant capacity to all links and ensure fairness, we propose another algorithm that maximizes the minimum capacity across all links. We validate the performance of both algorithms through simulation
format Preprint
id arxiv_https___arxiv_org_abs_2601_15532
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Resource Allocation and Sharing for UAV-Assisted Integrated TN-NTN with Multi-Connectivity
Khan, Abd Ullah
Khan, Wali Ullah
Jung, Haejoon
Shin, Hyundong
Networking and Internet Architecture
Unmanned aerial vehicles (UAVs) with multi-connectivity (MC) capabilities efficiently and reliably transfer data between terrestrial networks (TNs) and non-terrestrial networks (NTNs). However, optimally sharing and allocating spectrum and power resources to maintain MC while ensuring reliable connectivity and optimal performance remains challenging in such networks. Channel variations induced by mobility in UAV networks, coupled with the varying quality of service (QoS) demands of heterogeneous devices, resource sharing, and fairness requirements in capacity distribution pose challenges to optimal resource allocation. Thus, this paper investigates resource allocation for QoS-constrained, MC-enabled, dynamic UAVs in an integrated TN-NTN environment with spectrum sharing and fairness considerations. To this end, we consider three types of links: UAV-to-radio base station (RBS), UAV-to-UAV, and UAV-to-HAP. We also assume two types of UAVs with diverse QoS requirements to reflect a practical scenario. Consequently, we propose two algorithms. The first algorithm maximizes the capacity of UAVs-RBS and UAVs-HAP links while ensuring the reliability of the UAV-UAV link. To achieve this, the algorithm maximizes the collective throughput of the UAVs by optimizing the sum capacity of all the UAV-RBS and UAV-HAP links. Next, to provide constant capacity to all links and ensure fairness, we propose another algorithm that maximizes the minimum capacity across all links. We validate the performance of both algorithms through simulation
title Resource Allocation and Sharing for UAV-Assisted Integrated TN-NTN with Multi-Connectivity
topic Networking and Internet Architecture
url https://arxiv.org/abs/2601.15532