基于内容感知的超密集网络移动性管理算法研究  

Mobility management algorithm based on content awareness for ultra-dense networks

作　　者：徐秋 朱晓荣[1] 赵夙[1] XU Qiu;ZHU Xiaorong;ZHAO Su(College of Telecommunications&Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003

出　　处：《南京邮电大学学报（自然科学版）》2020年第1期89-96,共8页Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition

基　　金：国家自然科学基金(61871237);江苏省高校自然科学研究重大项目(16KJA510005)资助项目。

摘　　要：近年来超密集网络已经成为解决系统容量增长的重要方法之一,但是由于其小站数量很大、干扰复杂等特点,给超密集网络的移动性管理带来巨大挑战。文中提出了一种基于内容感知的超密集网络移动性管理算法。首先通过预测得到下一时刻切换基站集合,然后优先选择集合中的所需内容并接入时延最短的基站,如果没有,则在集合中选择基站存储为空且时延最短的基站接入。若以上两种情况都不存在,则选择从上层内容服务器获取内容时延最短的基站作为下一时刻的服务基站。仿真实验结果表明,该方法有效降低了用户时延和内容服务器的网络流量。In recent years,an ultra-dense network has become one of the most important methods to solve the problem of system capacity growth.However,due to the large number of small stations and complex interference,the mobility management of the ultra-dense network is facing great challenges.This paper proposes a content-aware-based mobility management algorithm for ultra-dense networks.Firstly,the set of possible service small cells at the next moment is obtained by a prediction algorithm.Then,the small cell with the required content is preferentially selected in the set to access with the shortest delay in the set.If not,the small cell accesses with the shortest access delay and the empty storage in the set is selected.If neither of the above two cases exists,the small cell with the shortest delay is chosen as the service small cell at the next moment when the content is acquired from the upper content server.The simulation results show that the method can reduce the user delay and the network traffic rate of content server.

关 键 词：超密集网络 移动性管理 内容感知 时延 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]