超密集场景下考虑业务动态的功率匹配算法

Power Matching Algorithm Considering Service Dynamics in Ultra-Dense Scenarios

提出了一种面向超密集场景的考虑业务动态的无线网络功率资源匹配算法.首先,根据网络异构和业务动态变化特征,建立双层动态博弈模型.针对不同博弈层参与者的需求特性,以最大化效用函数为准则,设计不同的效益模型,并通过对网络中业务动态性的预测调整定价因子,以更准确地反映网络环境的变化;其次,根据双层非合作博弈的特性进行分层功率博弈求解,通过宏蜂窝用户与微基站以及微蜂窝用户之间的多次非合作功率博弈达到均衡;最后,通过与现有功率资源匹配算法仿真比较,所提算法具有优越的性能.

A wireless network resource matching algorithm considering service dynamics in ultra-dense scenarios is proposed.Firstly,according to heterogeneous characteristics of networks and dynamic changes of services,a two-layer dynamic game model was established.In particular,different benefit models were designed to maximize the utility function based on the demand characteristics of different game layer participants,and a pricing factor was dynamically adjusted by predicting service dynamics more accurately to reflect the network environment.Secondly,according to the characteristics of the two-tier non-cooperative game model,a layered power game was solved,so that an equilibrium was achieved through multiple non-cooperative power games among macro cell users,micro base stations and micro cell users.Finally,compared with several existing resource matching algorithms,the simulation results of our algorithm showed superior performances.