基于平均场均衡的Ad hoc网络路由协议  

Ad hoc network routing protocol based on the mean field equilibrium

作　　者：张旭[1] 钱志鸿[1] 刘影[2] 王雪[1] 

机构地区：[1]吉林大学通信工程学院,吉林长春130012 [2]辽宁工程技术大学电子与信息工程学院,辽宁葫芦岛125105

出　　处：《哈尔滨工程大学学报》2014年第4期504-509,共6页Journal of Harbin Engineering University

基　　金：国家自然科学基金资助项目(61071073);教育部高等学校博士学科点专项科研基金资助项目(20090061110043)

摘　　要：为了简化使用完美马尔科夫均衡方法可能引起的复杂计算过程,本文依据博弈论方法,提出一种平均场均衡的无线自组织网络路由协议(mean field equilibrium AODV,MFEA)。该方法要求每个节点利用所有其他节点的信息来分析自己的最优策略,而不需要知道每一个局中人的信息,并且在足够大的局中人数目情况下性能更加近似马尔科夫均衡。仿真实验显示:提出的MFEA路由协议在包投递率、时延和归一化开销方面均优于AODV(Ad hoc on-demand distance vector routing)协议,在节点密集的无线自组织网络中仍可获得比较好效果。In order to simplify the complex computing process possibly caused by using the standard solution of the Markov perfect equilibrium, on the basis of game theory, a wireless Ad hoc network routing protocol which is called the mean field equilibrium （ MFE） was proposed. With this method, it is required that each node analyzes its own optimal strategy by utilizing the information of other nodes, while it does not need to know the information of each player in the circle. In addition, when the quantity of players in the circle is large enough, the performances are more approximate to the Markov equilibrium. The results of a simulation experiment show that the proposed MFEA （ mean field equilibrium AODV ） routing protocol outperformed AODV（ Ad hoc on-demand distance vector routing） with such aspects as the delivery rate of the packets, time delay and normalized overhead. With the wireless ad hoc network utilizing the dense nodes, excellent results may still be attained.

关 键 词：平均场均衡 无线自组织网络 博弈论 收敛性分析 路由协议 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]