Resource Allocation for UAV Swarm Networks using Overlapping Coalition Formation Game
- 주제(키워드) UAV network , Resource allocation , Game theory
- 주제(DDC) 004.6
- 발행기관 아주대학교 일반대학원
- 지도교수 Jae-Hyun Kim
- 발행년도 2026
- 학위수여년월 2026. 2
- 학위명 석사
- 학과 및 전공 일반대학원 AI융합네트워크학과
- 실제URI http://www.dcollection.net/handler/ajou/000000035810
- 본문언어 한국어
- 저작권 아주대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
Unmanned aerial vehicle (UAV) swarm networks are rapidly evolving to support diverse mission critical applications through collaborative sensing and communication. In particular, manned-unmanned teaming (MUM-T) operations represent a specialized class of these networks, relying on time division multiple access (TDMA) for command and control (C2) links. As these operations scale, the network must support a heterogeneous traffic structure where low-demand (LDT) and high-demand tasks (HDT) coexist. The fixed slot nature of traditional TDMA is inefficient, leading to severe slot wastage and unnecessarily long frame lengths. Existing protocols are limited in addressing this challenge, as Dynamic TDMA (DTDMA) fails due to its lack of spatial reuse, while classical coalition formation games (CFG) cannot satisfy the multi-slot requirements of HDTs due to the disjoint partition constraint. To overcome these limitations, this thesis proposes a demand-aware overlapping coalition formation game (DA-OCFG) framework. This novel, distributed approach uniquely allows tasks to overlappingly participate in multiple time slots, enabling simultaneous HDT demand satisfaction and spatial slot reuse. The framework autonomously solves a multi-objective problem, minimizing both frame length and power consumption through Merge and Split actions. Simulation results confirm DA-OCFG’s superior performance over conventional schemes, including TDMA, DTDMA, and CFG, across key metrics, specifically throughput, packet delivery ratio (PDR), latency, and network energy efficiency. The framework achieves this by maintaining a high PDR for HDT even under heavy network load, thereby proving it is a robust and practical solution. The framework offers a highly efficient real-time scheduling mechanism for dynamic and heterogeneous UAV swarm networks.
more목차
1 Introduction 1
1.1 Background and motivation 1
1.2 Contributions 2
1.3 Overview 3
2 Related works 5
2.1 C2 link MAC protocol 5
2.2 Coalition formation game 8
2.2.1 Game theory 8
2.2.2 Classical coalition formation games 9
2.2.3 Overlapping coalition formation games 10
2.3 Related works 11
3 Proposed DA-OCFG framework 13
3.1 System model and problem formulation 13
3.1.1 C2 link network model 13
3.1.2 Channel model and time slot reuse 17
3.1.3 Problem formulation 18
3.2 DA-OCFG design 21
3.2.1 DA-OCFG algorithm 22
3.2.2 Convergence and complexity analysis 23
3.3 DA-OCFG operational framework 25
4 Performance evaluation 29
4.1 Simulation setup 29
4.1.1 Simulation settings 29
4.1.2 Key performance indicators (KPIs) 30
4.1.3 Baseline schemes 32
4.2 Results and discussion 32
4.2.1 Convergence analysis 32
4.2.2 Frame length analysis 37
4.2.3 Throughput performance 37
4.2.4 PDR and HDT PDR analysis 39
4.2.5 Latency performance 42
4.2.6 Network energy efficiency 44
5 Conclusion 46
References 48
