%0 Journal Article
%A LIU Shu
%A SUN Yan-fei
%A ZHANG Hui
%A ZHAO Hai-tao
%T Power Matching Algorithm Considering Service Dynamics in Ultra-Dense Scenarios
%D 2019
%R 10.13190/j.jbupt.2019-002
%J Journal of Beijing University of Posts and Telecommunications
%P 48-53
%V 42
%N 5
%X 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.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2019-002