Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.16501

Offline-Tuned Service-Aware TN-NTN Feeder Allocation for 6G Post-Disaster Service Resilience

Donglin Wang·Anjie Qiu·Qiuheng Zhou·Hans D. Schotten
View original source ↗Read source document ↗Export metadata ↓

Abstract

Terrestrial network (TN) failures during disasters can overload surviving base stations (BSs) and disrupt emergency services. A non-terrestrial network (NTN) provides fallback, but its feeder link can become a bottleneck as users migrate. This paper studies post-disaster network resilience through service-priority-aware orchestration of constrained NTN feeder capacity in a post-failure snapshot. A lightweight Cross-Entropy Method (CEM) tunes feeder, offload, and user-ranking parameters offline, not as an online artificial intelligence (AI) controller. A Python system-level simulator sweeps operating regions under abstract TN-NTN link and queueing models. Gains depend on failure severity. At a 180-Mbps feeder under total TN outage, the proposed policy increases the absolute emergency-weighted continuity metric Cemg from 0.399 to 0.666 relative to the matched rule baseline with uniform feeder scaling (paired gain: 0.267; 95% bootstrap CI: [0.264, 0.271]); mild damage can reduce aggregate continuity. Offline CEM feeder-weight tuning further improves severe-failure continuity over fixed service priorities, whereas tuned offload and user ranking provide no detectable incremental gain.

Explore related subjects

cs.NIcs.SYeess.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Donglin Wang, Anjie Qiu, Qiuheng Zhou, Hans D. Schotten. 2026-10-12. Offline-Tuned Service-Aware TN-NTN Feeder Allocation for 6G Post-Disaster Service Resilience. https://arxiv.org/abs/2610.16501

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Energy Consumption in Next Generation Radio Access Networks

Historically, in macro-cell-based networks, the radio access network (RAN) portion accounts for the largest share of energy consumption in mobile networks. With greater densification, the transition to small cells and increased virtualization of the radio processing functions, the relative energy use of the different network segments is changing. At the same time, open radio access networks (O-RAN) have emerged as a promising approach to support this evolution through open interfaces that enable a multi-vendor environment, support for hierarchical intelligent controls, and simplified, cost-effective radio units that facilitate large-scale deployments. This paper examines the impact of these changes on energy consumption in next-generation RAN architectures through transaction-based energy models. Transaction-based network energy models were developed in 2009 to understand the evolution of energy use in networks. Here we update these models with today's hardware and apply recently developed models for emerging architectures, considering current access point densification trends. Results indicate that efficiency improvements have followed predicted trends, which were largely based on semiconductor Moore's Law-related evolution. Emerging RAN architectures show improved energy per bit, although the processing energy becomes the largest contributor. Densification increases total energy consumption, but the relative contributions of processing and transport energy depend strongly on the location of the baseband processing.

cs.NI↗
arXiv2026

When Unlearning Fails: Reliable Data Deletion under Post-Training in Agent Networks

Embedded AI agents on edge devices can learn as a federation and keep improving after deployment. Each agent collects new trajectories with the current policy, and the edge server aggregates them in later rounds. In such self-improving agent networks, deleting data is harder than a one-time model repair. The data to be deleted may have already shaped later retained trajectories, so retraining or model-side unlearning leaves an influence echo that returns as the network keeps learning. We propose Muting Unlearned Trajectories' Echoes (MUTE) for reliable deletion over edge networks. MUTE traces the echo from a lightweight ledger at the edge server, without moving raw trajectories off the devices. It erases the current residue with a forget-retain update, contains high-influence retained trajectories, and audits later behavior to schedule further erasure under the uplink budget and the response deadline. On LIBERO, MUTE keeps the regenerated share of forgotten behavior at or below 0.401 for every request type, against at least 0.466 for five recent methods.

cs.NI↗
arXiv2026

QoE-Aware Service Function Chain Orchestration in Space-Air-Ground Integrated Networks for In-Flight Internet

In remote regions lacking terrestrial infrastructure, aviation users increasingly demand Internet services comparable to ground cellular networks. This paper proposes a space-air-ground integrated network (SAGIN) architecture that combines ground networks, civil aviation networks, and low Earth orbit (LEO) satellites. Based on real North Atlantic flight data, a heterogeneous aviation Internet is constructed to support diverse aircraft service requirements. A composite Quality of Experience (QoE) metric, characterized by transmission delay, jitter, and content similarity, guides efficient resource utilization. The dynamic connectivity of SAGIN is modeled using a reconfigurable time-expanded graph (RTEG). With Network Function Virtualization (NFV), data delivery is formulated as a Service Function Chain (SFC) deployment across ground stations, relay aircraft, and satellites, resulting in a long-term QoE maximization problem. A tailored Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm incorporating LCSS-based path filtering and softmax-based action selection is developed. Simulation results demonstrate that the proposed approach enables seamless connectivity for heterogeneous aircraft and consistently outperforms game-theoretic and MATD3 methods in terms of QoE.

cs.NI↗