摘要：In order to improve the resource utilization in asymmetric wireless networks, a novel dynamic resource access algorithm was presented. As the asymmetry of information and the locality of users' actions in distributed wireless networks, the resource access problem was expressed as a simple graphical game model. Let the graphic topology indicate the internal game structure of the realistic environment. Then the Nash equilibrium was got by minimizing the individual regret instead of the system regret. The proposed algorithm realized efficient resource access through exchanging the active information and regret in the competitive community. Theoretical analysis and simulation results show that the algorithm can converge to a suitable pure strategy Nash equilibrium point quickly with less amount of calculation, avoids conflict effectively, and improves the system capacity and power utilization especially in the condition of insufficient resources
