论文部分内容阅读
文章研究了动态网络下中继选择问题。从博弈论的角度,将问题建模成非合作博弈模型。分析表明该博弈模型属于拥塞博弈且拥有纳什均衡。纳什均衡是非合作博弈中常用的稳态解。利用SLA(Stochastic Learning Automata)算法能在信息受限的情况下获该稳态解。仿真结果表明,文中提出方法能够收敛,并且在平均网络容量上接近最优。
The article studies the problem of relay selection under dynamic network. From the perspective of game theory, the problem is modeled as a non-cooperative game model. Analysis shows that the game model belongs to congested game with Nash equilibrium. Nash equilibrium is a steady state solution commonly used in non-cooperative games. The SLA (Stochastic Learning Automata) algorithm can be used to obtain the steady state solution with limited information. The simulation results show that the proposed method converges and approaches the optimal average network capacity.