期刊文献+

分枝定界在多级动态频谱分配中的应用 被引量:1

Application of Branch and Bound Theory to the Multi-level Dynamic Spectrum Allocation
下载PDF
导出
摘要 针对认知无线电动态频谱分配中认知用户较多,传统优化算法收敛时间较长的问题,本文结合分枝定界原理提出一种多级动态频谱分配算法。首先建立基于用户需求的多级动态频谱分配模型,然后借助图着色理论,将问题转化为函数优化问题,最后借助分枝定界算法,通过把全部可行的解空间不断分割为越来越小的子集,从而实现了对该多级模型的频谱分配。仿真实验采用与遗传算法比较,通过对二者认知用户接入量和系统网络效益的分析比较,表明该算法对处理多级DSA分配问题的优越性,且所提算法具有较小的计算复杂度,具有较高的应用价值。 Aiming at the problems that there are many cognitive users in the dynamic spectrum assignment issue in cognitive radio,and the traditional optimization algorithms cost amounts of convergence time.A multi-level dynamic spectrum allocation algorithm is presented based on branch and bound theory.This paper first build a model of DSA system with multilevel based on user demand,and then the problem was formulated as a functional optimizing by means of the graph-coloring theory,finally The branch and bound optimization algorithm is introduced to the model,the algorithm put all the practicable solution space constantly dividing into smaller and smaller subsets,by this way the dynamic spectrum allocation is implemented to the model of DSA system with multi-level.The simulation experiment is taken with comparison on the basic genetic algorithms,through the analysis of the amount of the cognitive user access and the system profits,the simulation results show the superiority of the classification model in dealing with the problem of DSA with multi-level.And the algorithm proposed has an relatively small computation complexity,which is of a relatively high application value.
机构地区 电子工程学院
出处 《信号处理》 CSCD 北大核心 2014年第3期321-327,共7页 Journal of Signal Processing
关键词 认知无线电 动态频谱分配 图论 分枝定界 cognitive radio(CR) dynamic spectrum allocation(DSA) graph-coloring theory branch and bound
  • 相关文献

参考文献14

二级参考文献63

  • 1李维英,陈东,邢成文,王宁.认知无线电系统中OFDM多用户资源分配算法[J].西安电子科技大学学报,2007,34(3):368-372. 被引量:15
  • 2Haykin S. Cognitive radio: brain-empowered wireless communications[ J]. IEEE Journal on Selected Areas in Communications, 2005, 23 (2) : 201-220.
  • 3Ji Z, Liu K. J. R. Dynamic spectrum sharing: a game theoretical overview [ J ]. IEEE Communications Magazine, 2007, 45(5) : 88-94.
  • 4Tian F, Yang Z. A new algorithm for weighted proportional fairness based spectrum allocation of cognitive radios [ C ]. Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/ Distributed Computing, Tsingtao, China, 2007: 531-536.
  • 5Kivanc D, Li G, Liu H. Computationally efficient bandwidth allocation and power control for OFDMA [ J ]. IEEE Transactions on Wireless Communications, 2003, 2 (6) : 1150-1158.
  • 6Hughes-Hartogs D. Ensemble modem structure for imperfect transmission media [P]. U.S. Patent No. 4,679,227, July 1987.
  • 7Kivanc D, Liu H. Subcarrier allocation and power control for OFDMA [ C ]. Proceedings of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers, Piscatatway, USA, 2000: 147-151.
  • 8Schrijver A. Theory of linear integer programming [ M ]. New York: John Wiley and Sons, 1986. 229-236.
  • 9Chow P. S, Cioffi J. M, Bingham J. A. C. A practical discrete muhitone transceiver loading algorithm for data transmission over spectrally shaped channels [ J ]. IEEE Transactions on Communications, 1995, 43 (234) : 773-775.
  • 10Krongold B. S, Ramchandran K. Computationally efficient optimal power allocation algorithms for muhicarrier communication systems [ J]. IEEE Transactions on Communications, 2000, 48(1): 23-27.

共引文献75

同被引文献3

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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