无线Ad hoc网络中一种基于演化博弈的信道接入机制

摘要 针对多个有限理性用户接入多个信道的无线Ad hoc网络中,如何实现系统容量最大化问题,提出了一种基于演化博弈的信道接入机制. 在该机制中,为了确保用户以分布式的行为方式实现系统容量最大化,推导并定义了一种新的收益函数,并在此基础上设计了一种能以较快的速度收敛到Nash均衡解的动态信道接入算法和与之对应的动态方程. 理论分析和仿真结果表明,所提出的收益函数能在基于博弈的框架下实现系统容量最大化,且与之对应的动态方程具有全局逐步稳定性,当用户发生局部的理性偏移时能保证较快收敛和较小性能偏离.
How to realize the problem of maximizing system throughput for multiple bounded rationality users accessing multiple channels in wireless Ad hoc networks, a channel access mechanism based on evolutionary game was proposed. In the mechanism, in order to ensure realizing the maximization of system throughput for users in a distributed behavior manner, a new reward function was deduced and defined, on this basis a dynamic channel access algorithm and corresponding dynamic equation were designed for the mechanism, which converged to Nash equilibrium with faster speed. Theoretical analysis and simulation results show that the proposed reward function can realize the maximization of system throughput under the framework of game, and the corresponding dynamic equation was globally asymptotically stable, and when user deviated because of bounded rationality, it was still able to guarantee faster convergence and smaller performance deviation.