摘要
本文从非合作博弈的角度研究了MIMO认知无线电(MIMO-CR)网络中最大化信息速率的波形自适应问题,证明了在给定条件下Nash均衡的存在与唯一性,并提出了一种求解Nash均衡的带惩罚价格的分布式迭代注水算法———MIMO-CR IWFA,通过价格机制的运用使得MIMO-CR在满足主用户的干扰温度约束时最大化各自的信息速率;同时证明了在给定条件下MIMO-CR IWFA能够收敛到唯一Nash均衡解.仿真结果表明MIMO-CR IWFA具有快速收敛特性且能够很好的满足干扰温度约束;虽然受到主用户的干扰温度约束限制,MIMO-CR IWFA的性能能够随着MI-MO-CR链路之间的同信道干扰的增大而逐渐接近不考虑干扰温度约束的经典MIMO迭代注水算法(MIMO IWFA).
The problem of waveform adaptation to maximize information rate in a multiple-in multiple-out cognitive radio（MIMO-CR） network is investigated from a non-cooperative game theoretic viewpoint.The existence and uniqueness of the Nash equilibrium under certain circumstances is proved and a decentralized iterative water-filling algorithm with punishing price,MIMO-CR IWFA,is proposed to solve the above problem,the pricing mechanism is used to satisfy the interference-temperature constraint while achieving the Nash equilibrium,the conditions for the convergence of MIMO-CR IWFA are also provided.Simulation results show our MIMO-CR IWFA can satisfy the interference-temperature constraint perfectly and is fast convergent;and though constrained by PU＇s interference-temperature,the performance of MIMO-CR IWFA can still approach the classical MIMO IWFA,which does not consider the interference-temperature constraint,with the increase of co-channel interference between MIMO-CRs.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2011年第10期2269-2276,共8页
Acta Electronica Sinica
基金
国家863项目(No.2009AA01Z241)
国家自然科学青年基金(No.61001077)
国家自然科学基金(No.61071092)
关键词
多入多出
迭代注水算法
NASH均衡
博弈论
认知无线电
multiple-in multiple-out（MIMO）
iterative water-filling algorithm（IWFA）
nash equilibrium
game theory
cognitive radio
