逼近纳什均衡的动态蜂窝选择方案  

A dynamic cell selection scheme approaching Nash equilibrium

作　　者：王文浩[1] 王禄生[1] 开彩红[1] 刘超[1] WANG Wenhao;WANG Lusheng;KAI Caihong;LIU Chao(School of Computer and Information, Hefei University of Technology, Hefei 230601, China)

机构地区：[1]合肥工业大学计算机与信息学院,安徽合肥230601

出　　处：《合肥工业大学学报（自然科学版）》2020年第5期614-619,共6页Journal of Hefei University of Technology：Natural Science

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

摘　　要：在异构蜂窝选择博弈中,纳什均衡对应终端的蜂窝选择结果可以让系统获得相对较优的性能,然而在动态的网络场景中,终端会不断地移动,导致此前选择的结果偏离原纳什均衡,采用传统搜索纳什均衡的方法无法非常快速地重新逼近新的纳什均衡。文章提出一种逼近纳什均衡的动态蜂窝选择方案,借助设计的经验公式,快速调整终端的蜂窝选择策略,使整个系统始终保持逼近纳什均衡。In a heterogeneous cell selection game,a Nash equilibrium(NE)of the entire system could achieve a high performance.However,in a dynamic network scenario,terminals continuously move,making traditional methods unable to quickly reapproach the new NE when the previous NE does not hold due to the movements of terminals.Therefore,a dynamic cell selection method quickly reapproaching the new NE is proposed.With designed empirical formulas,terminals’cell selection strategies can be quickly adjusted so that the entire system always approaches NE.

关 键 词：异构蜂窝网络 蜂窝选择 纳什均衡 蜂窝间干扰 Q学习 

分 类 号：TN929.53[电子电信—通信与信息系统]