干扰信道中基于竞争博弈的准最佳功率分配方案.pdfVIP

西安电f科技大学字报(自然科学版} Feb.2010 2010 年2 月 第 37 卷第1 赈 JOURNAL OF XIDIA到 UNIVERSITY VoL 37 No.l doi: 10. 3969/j. issn. 1001-2400.2010.01.005 干扰信道中基于竞争博弈的准后佳功率分配方案 景援海13 ，自宝明1 (1.西安电子科技大学综合业务网理论及关键技末国家重点实输室，陕西西安 710071; 2. 中雷电子科技集团公司第 36 研究所，远信系统信息拉剁技术民家级重点实栓室，浙江嘉兴 314000) 摘要:频率选择性高条子扰信道下多用户总速率最大化的问题被建模成一个带有补偿函数约非合作博 弈模型.补偿函数也近似成子信道之间进行博弈的模型〈子信道博弈).通过子信道之间的迭代计算，子 信道溥弈能够达到一个纳什均衡，也就是渐近最佳补偿.接着提出了多领导斯坦克尔伯格均衡的概念， 来描述带有渐远最佳补偿函数的非合作博弈的均衡点.利用凸优化技术，开发了一种迭代多水平百功率 注水算法，来达到斯坦克尔伯格均衡.在该均衡点上，所有用户都会工作在准最佳速率区域边界上.仿真 结果表明，迭代多水平面功率注水算法所能达到约总速率比迭代功率注水算法有明显的提高，并且钱达 到一个准最佳的霄达速率区最主. 关键词:子找信道;迭代注水5 分布式功率分配手溥弈论 中图分类号:TN929.5 文献标识码:A 文章编号:1001-2400(2010)01-0023-05 Near-optimal power allocation scheme based on the competitive game in the interference channel ] 1NG Zhen-haí 1.2 , BAI Ba o-ming 1 (1. State Key Lab. of Integrated Service Networks , Xidian Univ. , Xi在n 710071. China; 2. The 36th Research Institute of CETC , Jiaxing 314000 , China) Abstract: This paper ∞nsiders an optimization problem of sum-rate in the Gaussian frequency-selective channel. This problem can be modeled as a competitive game model with a compensation function. We find that the compensation function can also be modeled as a game among sub-channels (called sub- channel game in this paper). In an íterative fashion , the Nash equilibrium of the sub-channel game can be reached , which is the asymptotically optimal compensation term. Stackelberg equil池rium with multiple leaders is introduced to represent the equilibrium point of the competitive g臼ne model WÎ