基于非完全信息动态博弈论的无线局域网MAC协议  

A Novel MAC Scheme for Wireless LANs Based on Incomplete Information Dynamic Game Theory

作　　者：吕娜 徐德民[1] 徐浩翔[3] 张国鹏[4] 

机构地区：[1]西北工业大学航海学院,陕西西安710072 [2]空军工程大学电讯工程学院,陕西西安710077 [3]空军工程大学科研部,陕西西安710051 [4]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071

出　　处：《西北工业大学学报》2008年第5期556-560,共5页Journal of Northwestern Polytechnical University

基　　金：国家自然科学基金(60772317);陕西省自然科学基础研究计划(2006F30)资助

摘　　要：为提高802.11 DCF协议性能,文章提出了一种基于博弈论的无线局域网MAC协议G-DCF。将站点间的信道竞争过程建模为非完全信息动态博弈,并求解站点竞争信道的均衡策略;依据此均衡策略提出G-DCF。站点首先监测、收集信道的状态信息,对当前博弈状态(竞争站点数n)进行计算;然后根据n调整其均衡策略。同时,为使空闲站点准确估计n,提出一种基于站点MAC地址的博弈状态估计算法,当空闲站点转换到发送状态后可以快速调整到其均衡策略。仿真表明:G-DCF能够有效提高系统的吞吐量(30%)、降低分组发送时延(20%)。A novel MAC（Media Access Control） scheme based on game theory is presented to improve the performance of IEEE 802.11 DCF（Distributed Coordination Function） in wireless LANs. The channel contention process between the nodes is modelled as a dynamic game with incomplete information. According to the Nash equilibrium of the game, a novel MAC scheme, called G-DCF（Game-theory-based DCF）, is proposed. Using the G-DCF, each node adjusts its local contention parameters for data transmission to the current game state （i. e. the number of competing nodes）, and then updates the game state through the transmission feedbacks. This process is repeated for a limited times to get the optimal performance. In addition, to help the idle nodes estimate the game state accurately, a fast algorithm for estimating the game state is developed. It is based on each node＇s MAC address,and is incorporated into the G-DCF, so that an idle node can obtain its equilibrium strategy when it gets ready to transmit real frames. Simulation results show that G-DCF can increase the system throughput by 30° and decrease the delay bound by 20°.

关 键 词：无线局域网 IEEE 802.11 DCF 博弈论 纳什均衡 

分 类 号：TN915.04[电子电信—通信与信息系统]