移动通信2025，Vol.49Issue(5)：90-97,8.DOI:10.3969/j.issn.1006-1010.20250314-0003
基于染色理论的数据时隙复用分配算法
Data Time Slot Reuse Allocation Algorithm Based on Graph Coloring Theory
宋昆宇 1吴俊晨1
作者信息
- 1. 中国电子科技集团公司第五十四研究所,河北 石家庄 050081
- 折叠
摘要
Abstract
Compared with omnidirectional antenna-based ad hoc systems,directional antenna ad hoc networks with phased array technology offer longer communication ranges,stronger spatial reuse,and enhanced interference resistance.To improve resource allocation efficiency in such networks,this paper proposes a data time slot reuse allocation algorithm based on graph coloring theory.By combining network topology information with graph coloring principles,the algorithm identifies interfering links that cannot be scheduled concurrently and non-interfering links that support parallel transmission.Shared time slots are then assigned to non-interfering links to enable simultaneous communication.Simulation results show that in multi-hop scenarios,the proposed method enables concurrent transmissions across multiple communication pairs within the same slot,significantly improving slot utilization and throughput while reducing end-to-end latency.关键词
自组网/染色理论/资源调度/时隙复用Key words
ad hoc networking/graph coloring theory/resource scheduling/time slot reuse分类
信息技术与安全科学引用本文复制引用
宋昆宇,吴俊晨..基于染色理论的数据时隙复用分配算法[J].移动通信,2025,49(5):90-97,8.
