一种联合优化内容获取与容量的蜂窝关联方案  

A cell association scheme for jointly optimizing content acquisition and capacity

作　　者：张文天 王禄生[1] 林海[2] 方超 ZHANG Wentian;WANG Lusheng;LIN Hai;FANG Chao(School of Computer and Information,Hefei University of Technology,Hefei 230601,China;School of Cyber Science and Engineering,Wuhan University,Wuhan 430072,China)

机构地区：[1]合肥工业大学计算机与信息学院,安徽合肥230601 [2]武汉大学国家网络安全学院,湖北武汉430072

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

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

摘　　要：在未来高密度网中,随着移动终端的大规模流行和低功率小蜂窝的密集部署,无线多媒体数据业务将被广泛应用且业务流量将呈高速增长,因此,终端如何选择最合适的基站接入并快速获取所需媒体信息内容成为一个重要的科学问题。文章提出一种联合优化内容获取路径与系统容量的蜂窝关联方案,在基于容量最大化的蜂窝关联方案中融入考虑内容获取跳数,从而使得终端在关联到相应蜂窝后能快速获取所需内容;借助虚拟基站的方法,将效用函数最大化问题转化为基于二部图的最优匹配,并使用匈牙利算法求得最优解。仿真结果表明,该方案使得两者联合组成的效用函数最大化的同时极大地减少了内容获取跳数。In future dense networks,low-power picocells and femtocells will be densely and massively deployed,while traffic flows will be growing rapidly due to the large-scale popularization of mobile terminals and the widespread applications of multimedia data services.Therefore,how to select the most appropriate base station for quickly accessing the required content becomes a key problem.This paper proposes a cell association scheme jointly optimizing the content acquisition path and the system capacity,which adds content acquisition hops into the cell association scheme toward maximum capacity so as to access the required content quickly.Via a method of virtual base stations,the optimization issue is transformed into optimal matching on the bipartite graph and the optimal solution is reached by Hungarian algorithm.Simulation results show that the scheme maximizes the utility function and greatly reduces the number of hops for content acquisition.

关 键 词：高密度网络 蜂窝关联 内容获取 匈牙利算法 异构蜂窝网络 

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