期刊文献+

CRN中基于单位圆盘图模型的广播调度算法

Broadcasting Scheduling Algorithm Based on Unit Disk Graph Model in Cognitive Radio Networks
下载PDF
导出
摘要 广播调度是目前认知无线电网络中的研究热点之一,现有广播调度算法主要为近似算法,存在方案性能与最优解方案差距太大的问题。为此,提出一种基于单位圆盘图模型的广播调度算法BS-UDGM。构建一棵基于连通支配集的广播树,作为调度的基础结构,采用平面细分和着色技术对广播树进行优化,通过混合使用单播和广播通信模式,完成广播任务。仿真实验结果表明,相比其他调度算法,该算法在延时和冗余方面的性能明显提高。 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.
作者 祝青 何建新
出处 《计算机工程》 CAS CSCD 2014年第11期101-105,共5页 Computer Engineering
基金 湖南省科技计划基金资助项目(2014FJ3111)
关键词 认知无线网络 广播调度 连通支配集 单位圆盘图模型 延时 Cognitive Radio Networks (CRN) broadcasting scheduling Connected Dominating Set ( CDS ) unit diskgraph model latency
  • 相关文献

参考文献12

二级参考文献74

  • 1田春岐,邹仕洪,田慧蓉,王文东,程时端.一种基于信誉和风险评价的分布式P2P信任模型[J].电子与信息学报,2007,29(7):1628-1632. 被引量:47
  • 2Mitola III J.Cogultive radio for flexible mobile multimedia communications[C]//Sixth International Workshop on Mobile Multimedia Communications, MoMuC' 99, San Diego, CA, 1999: 3-10.
  • 3Nie N, Comaniciu C.Adaptive channel allocation spectrum etiquette for cognitive radio networks[C]//Proc IEEE DySPAN 2005, November 2005: 3132-3136.
  • 4Zheng H,Peng C.Collaboration and fairness in opportunistic spectrum access[C]//Proc of IEEE International Conference on Communications, Seoul, Korea, May 2005.
  • 5Peng C,Zheng H,Bcn Y.Utilization and fairness in spectrum assignment for opportunistic spectrum access[J].Mobile Networks and Applications (MONET), 2006,11 (4).
  • 6Cao L, Zheng H.Distributed spectrum allocation via local bargaining[C]//IEEE SECON, Santa Clara, California,USA, Sept 2005.
  • 7Wang Q.Route and spectrum selection in dynamic spectrum networks[C]//3rd IEEE Consumer Communications and Networking Conference, CCNC 2006,2006,2.
  • 8Chunsheng X, Bo X, Chien-Chlmg S.A novel layered graph model for topology formation and routing in dynamic spectrum access networks[C]//Proc IEEE DySPAN'05,Baltimore,USA,November 2005: 308-317.
  • 9Wiesclthier J, Nguycn G, Ephremides A.On the construction of energy-efficient broadcast and multicast trees in wireless networks[C]//IEEE INFORCOM 2000,2000:585-594.
  • 10Ozaki T, Kim J B, Suda T.Bandwidth-efficient multieast routing protocol for ad-hoc networks[C]//Proeeedings of IEEE ICCCN' 99,1999:10-17.

共引文献27

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部