一种基于双层干扰图着色的资源分配算法  

An algorithm of resource allocation based on double layer interference graph coloring

作　　者：张家波[1] 陈美铃 余攀[1] 

机构地区：[1]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065

出　　处：《重庆邮电大学学报（自然科学版）》2015年第1期12-19,共8页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家重大科技专项(2013ZX03001004-003);重庆市自然科学重点基金(CSTC2013jj B40001)~~

摘　　要：针对长期演进(long term evolution,LTE)系统中蜂窝链路和短距离链路中的同频干扰问题,提出一种基于双层同频干扰图着色的信道资源分配算法。该算法通过引入排队理论和终端服务等级要求,分析蜂窝移动通信网和短距离通信网的双层同频干扰,构造一种异构网络的双层同频干扰图。基于系统信道资源占用情况和信道资源分配优先级的考虑,对双层同频干扰图进行着色资源分配。仿真表明,该算法提高了系统平均吞吐量和满意度。A channel resource allocation algorithm with graph coloring is proposed for the double tier co-channel interference,which mainly deals with the co-channel interference among wireless cellular links and short distance links in LTE systems. The algorithm analyses the double tier co-channel interference arising in cellular mobile communication networks and short-distance communication networks along with introducing queuing theory and grade of service requirements of terminals; a double tier co-channel interference graph is established for heterogeneous networks,and the coloring channel resource is allocated according to the real channel resource occupation situation and the priority access channel resource assignment. Stimulation results show that the proposed algorithm can improve the system average throughput and satisfaction degree.

关 键 词：移动通信 异构网络 资源分配 图着色 

分 类 号：TN929.5[电子电信—通信与信息系统]