摘要： 广播调度是目前认知无线电网络中的研究热点之一,现有广播调度算法主要为近似算法,存在方案性能与最优解方案差距太大的问题。为此,提出一种基于单位圆盘图模型的广播调度算法BS-UDGM。构建一棵基于连通支配集的广播树,作为调度的基础结构,采用平面细分和着色技术对广播树进行优化,通过混合使用单播和广播通信模式,完成广播任务。仿真实验结果表明,相比其他调度算法,该算法在延时和冗余方面的性能明显提高。

关键词: 认知无线网络, 广播调度, 连通支配集, 单位圆盘图模型, 延时

Abstract: Broadcasting scheduling problem is a hot research problem in Cognitive Radio Networks(CRN),and existing works for the broadcast scheduling issue in CRN are either heuristic solutions without performance guarantee or with performance far from the optimal solution. This paper proposes a Broadcasting Scheduling Algorithm Based on Unit Disk Graph Model(BS-UDGM). It constructs a Connected Dominating Set(CDS) based broadcasting tree,which serves as the scheduling infrastructure,and subsequently,the broadcasting tree is optimized by using the tessellation and coloring of a plane. The broadcast task is finished by employing mixed unicast and broadcast communication modes. Simulation results show that compared with the existing algorithms,the performance of the proposed algorithm is improved with respect to both latency and redundancy.

Key words: Cognitive Radio Networks(CRN), broadcasting scheduling, Connected Dominating Set(CDS), unit disk graph model, latency

中图分类号: 

• TP393