Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2019, Vol. 42 ›› Issue (5): 48-53.doi: 10.13190/j.jbupt.2019-002

Previous Articles     Next Articles

Power Matching Algorithm Considering Service Dynamics in Ultra-Dense Scenarios

ZHANG Hui1,2,3, LIU Shu1, ZHAO Hai-tao1, SUN Yan-fei2   

  1. 1. Jiangsu Key Laboratory of Wireless Communications, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;
    2. National Engineering Research Center of Communications and Networking, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;
    3. Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Jiangsu Suzhou 215006, China
  • Received:2019-02-22 Online:2019-10-28 Published:2019-11-25

Abstract: 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.

Key words: hot-spot high-capacity scenario, two-layer dynamic game, service forecast, resource matching

CLC Number: