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

Near-optimal power allocation scheme based on the competitive game in the interference channel

作　　者：景振海[1,2] 白宝明[1] 

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071 [2]中国电子科技集团公司第36研究所,通信系统信息控制技术国家级重点实验室,浙江嘉兴314000

出　　处：《西安电子科技大学学报》2010年第1期23-27,48,共6页Journal of Xidian University

基　　金：国家自然科学基金资助项目(U0635003)

摘　　要：频率选择性高斯干扰信道下多用户总速率最大化的问题被建模成一个带有补偿函数的非合作博弈模型.补偿函数也近似成子信道之间进行博弈的模型(子信道博弈).通过子信道之间的迭代计算,子信道博弈能够达到一个纳什均衡,也就是渐近最佳补偿.接着提出了多领导斯坦克尔伯格均衡的概念,来描述带有渐近最佳补偿函数的非合作博弈的均衡点.利用凸优化技术,开发了一种迭代多水平面功率注水算法,来达到斯坦克尔伯格均衡.在该均衡点上,所有用户都会工作在准最佳速率区域边界上.仿真结果表明,迭代多水平面功率注水算法所能达到的总速率比迭代功率注水算法有明显的提高,并且能达到一个准最佳的可达速率区域.This paper considers 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 subchannel game in this paper）. In an iterative fashion, the Nash equilibrium of the sub-channel game can be reached, which is the asymptotically optimal compensation term. Stackelberg equilibrium with multiple leaders is introduced to represent the equilibrium point of the competitive game model with a compensation function. At the equilibrium point, all users operate on the optimal rate region frontier. Then, an iterative multiple water-levels water filling algorithm is proposed to efficiently reach the Stackelberg equilibrium. Simulation results show that our proposed algorithm has a significant improvement on the sum-rate compared with IWFA and exhibits the quasi-to-optimal performance.

关 键 词：干扰信道 迭代注水 分布式功率分配 博弈论 

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