一种基于不完美信息博弈的多冲突域信道分配算法

A Multiple Collision Channel Assignment Based on Imperfect Game Theory

无线网络中信道分配的好坏将极大地影响网络整体性能,为了解决和优化此问题,提出了一种基于不完美信息博弈的信道分配算法。假设网络场景为多跳Ad Hoc网络,因此对其采用多冲突域建模更符合实际。算法通过不断循环改变各用户无线电的信道试图接近纳什均衡点,仿真结果表明算法能够使信道分配策略接近纳什均衡信道分配,同时相比单冲突域情况在多冲突域中更能最大化信道使用率。

The channel allocation in wireless network will greatly affect the whole performance of the network. In order to solve this optimization problem, a kind of non cooperation channel allocation algorithm based on imperfect information was put forward. The network scene was assumed to be multihop Ad Hoc networks. So the multi-domain modeling conflict was more realistic. The algorithm constantly cyclically changed radio channel for each user to attempt to close to the Nash equilibrium point. The simulation results show that the algorithm can make the channel allocation strategy close to Nash equilibrium. At the same time, it can better maximize utilization.