基于粒子群优化的协作网络资源分配的博弈策略

Particle swarm optimized game theory for resource allocation in cooperative networks

应用基于竞价机制的斯坦克尔伯格博弈提出协作中继网络中的一种资源分配策略,用以解决单一中继节点对多用户节点协作带宽的分配问题。首先中继根据用户的协作带宽需求对资源定价,然后用户根据价格调整其纳什均衡策略,即获取协作效用最大化的最优带宽购买量。证明了纳什均衡的存在性,提出基于粒子群优化的均衡求解算法,分析了均衡的有效性,仿真给出了粒子群优化的全局最优带宽分配结果。仿真结果表明,所提出的博弈可以激励中继节点参与协作,并协调多用户节点间的资源分配。

A pricing-based Stackelberg game was proposed to perform resource allocation between a relay and multiple user nodes in cooperative relay networks.First,the relay node prices the cooperative bandwidth according to the demand of the user nodes.Then,with the price,the user nodes can adjust their Nash Equilibrium（NE）,i.e.the amount of the optimal bandwidth purchase,to maximize their benefits.The existence of the NE solution was proved.A particle swarm optimization（PSO） algorithm was performed to search for the NE solution,and the efficiency of the obtained NE was analyzed.A global optimal bandwidth allocation solution was given by simulation through the PSO algorithm.Results show that the proposed game can simulate cooperation of the relay node and coordinate the resource allocation among the user nodes.