异构网络中基于博弈的多宿主用户带宽分配算法  

Bandwidth allocation algorithm based on game theory for multi-homing users in heterogeneous networks

作　　者：陈磊[1] 张学平[2] 陈晖[2] 王海涛[2] 

机构地区：[1]解放军理工大学通信工程学院,南京210007 [2]解放军理工大学信息管理中心,南京210007

出　　处：《计算机应用》2014年第A02期16-19,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61072043)

摘　　要：针对异构无线网络中的带宽分配问题,将网络间的带宽分配模型转化为非合作博弈模型,提出一种基于非合作博弈论的动态带宽分配(NCRA)算法。首先,根据用户的带宽需求,并充分考虑当前各种不同网络的负载因素,设计一种基于网络能力动态为用户分配带宽的效用函数;然后,通过证明效用函数为凹函数来验证网络间非合作博弈纳什均衡的存在性,并获得网络间的最佳带宽分配策略;最后,通过仿真实验,验证所提出算法的性能。This paper focused on the bandwidth allocation in heterogeneous network for muti-homing users. The bandwidth allocation model between the network was transformed into a non cooperative game model. Then it proposed a dynamic bandwidth allocation of Non-Cooperative Game theory Algorithm（ NCRA）. Firstly, according to the bandwidth requirements of the users, and fully considering the load factor of the current networks, a utility function was designed based on network ability for allocating users bandwidths. Then, by proving the utility function is concave function, the existence of Nash equilibrium between the non-cooperative game of network and acqure bandwidth allocation between networks was verified. Finally, The simulation experiment is done to investigate the performance of the algorithm proposed.

关 键 词：异构网络 带宽分配 动态分配 博弈论 纳什均衡 

分 类 号：TP393.0[自动化与计算机技术—计算机应用技术] TN915.0[自动化与计算机技术—计算机科学与技术]