无线局域网中业务流接入控制的博弈论算法

Non-cooperative game theoretical admission control algorithm for traffic flows in wireless LANs

提出一种IEEE 802.11无线局域网中的用户流接入控制(AC)算法.通过建立用户流的QoS满意度(UQS)函数,将用户与接入点(AP)之间的接入控制决策过程建模为UQS最大化下的非协作博弈;根据此博弈的纳什均衡解,在不同的网络负载条件下,给出AP的最优接入控制策略(G-AC).仿真结果表明:G-AC算法能够为接入的用户流提供定量的QoS保证;并且,同传统的截止优先权AC算法(CP)相比,G-AC算法可以根据网络负载状况自适应的改变接纳策略,从而获取更高的带宽资源利用率(平均吞吐量高于CP算法10%),并为服务商带来更高的网络收益.

An admission control （AC） algorithm based on the non-cooperative game theory is presented for IEEE 802.11 WLANs. By setting the user QoS satisfaction ratio （UQS） function, the AC procedure between the wireless users and the Access Points （APs） is modeled as a non-cooperative game where the users and the ACs want to maximize their UQS function based utilities. According to the Nash equilibria of the game, an adaptive AC alogrithm called the G-AC is then developed. Simulation results indicate that the QoS of the ongoing user flows is guaranteed by the G-AC algorithm. And since the G-AC algorithm can adjust the admission strategy in accord with the current system load, it has notable advantages over other AC algorithms in both bandwidth utilization and network revenue.