Abstract
UAV network slicing enables flexible, task-oriented resource allocation. However, most current deployments lack true slicing support and face scalability and coordination challenges. Existing methods fail to jointly handle multi-type tasks, UAV deadlines, and hierarchical bandwidth quotas, leading to suboptimal welfare in dynamic environments. We study QoS-aware resource allocation in multi-UAV networks, with the objective of maximizing social welfare. We present a holistic mechanism called Advanced Dynamic Slicing and Task Allocation that supports per-task cross-slice orchestration and per-UAV multi-slice service under per-UAV capacity, coverage, and deadline constraints; we design an online primal–dual algorithm with a dual subroutine that prices multi-slice demands and applies a unit-cost heuristic (travel cost amortized by multi-slice bandwidth requirement) to select feasible UAVs; and we reformulate the integer program to capture travel constraints, bidding prices, and slice-level quotas, using complementary-slackness guidance for real-time task acceptance and resource allocation. In contrast to existing online primal–dual or auction-based UAV schedulers, the proposed mechanism explicitly combines (i) per-UAV concurrent multi-slice service, (ii) per-task cross-slice composition, and (iii) travel-cost-aware deadline constraints in a single optimization and algorithmic framework. Our duality analysis establishes a one-to-one correspondence between dual solutions and primal allocations, ensuring feasible online decisions. Empirical studies verify consistent performance gains, achieving about 10\% higher social welfare than other allocation baselines. We also discuss modeling assumptions, economic interpretation, and limitations, providing a clearer positioning of the proposed mechanism relative to prior work and outlining directions for further empirical validation.