论文部分内容阅读
针对多个有限理性用户接入多个信道的无线Ad hoc网络中,如何实现系统容量最大化问题,提出了一种基于演化博弈的信道接入机制.在该机制中,为了确保用户以分布式的行为方式实现系统容量最大化,推导并定义了一种新的收益函数,并在此基础上设计了一种能以较快的速度收敛到Nash均衡解的动态信道接入算法和与之对应的动态方程.理论分析和仿真结果表明,所提出的收益函数能在基于博弈的框架下实现系统容量最大化,且与之对应的动态方程具有全局逐步稳定性,当用户发生局部的理性偏移时能保证较快收敛和较小性能偏离.
Aiming at the problem of how to maximize the system capacity in wireless Ad hoc networks with multiple rational users accessing multiple channels, an evolutionary game based channel access mechanism is proposed. In this mechanism, in order to ensure that users are distributed , This paper deduces and defines a new revenue function, and on this basis, designs a dynamic channel access algorithm that converges to a Nash equilibrium solution at a faster rate and corresponds to it The theoretical analysis and simulation results show that the proposed revenue function can maximize the system capacity under the framework of game theory and the corresponding dynamic equations have global gradual stability. When a user has a partial rational offset When to ensure faster convergence and smaller deviations from performance.