Research On D2D Caching Algorithm Based On Replicas And Social

Nowadays,the request and distribution of content occupies a large part of the demand for Internet traffic.As the amount of commercial mobile data grows year by year,how to enable users to obtain high-rate,low-latency traffic services and effectively reduce the traffic pressure on the communication network becomes a hot topic in mobile communication network research.In order to meet the requirements of high-experience rate,connection density and low service delay of next-generation communication networks,D2D(Device-to-Device)technology,also known as terminal pass-through technology,has emerged,which can direct communication between devices under the control of base stations.Direct communication with the device.In the cellular D2 D network,along with the continuous requesting data service of user node,a large number of files in the network will be repeatedly requested and acquired,which greatly increases the network overhead and wastes resources.The introduction of the caching technology into the cellular D2 D network can can avoid the wasting of system resources to a large extent.Due to the good characteristics of D2 D technology itself,the cache technology based on cellular D2 D network will effectively unload the traffic pressure of the base station and improve the user content acquisition experience.Firstly,this paper introduces the current status of caching technology in communication networks,and makes a detailed analysis of D2 D caching technology from two aspects: cache deployment algorithm and cache replacement algorithm.Since the cache design often needs to provide an incentive mechanism for caching between users,the paper also elaborates on the D2 D caching technology based on social relationships.Based on the current research status of caching technology in cellular D2 D networks by domestic and foreign scholars,this paper firstly proposes a replica number routing algorithm in D2 D cache network.The proposed algorithm is aimed at the layout of D2 D cache network replicas,aiming at maximizing the cache hit rate of the system.Using the convex programming theory,a layout scheme of cache file replicas number is proposed.The simulation tool can be used to observe the good performance of the cached replicas layout algorithm under the parameters.At the same time,the system performance of the proposed algorithm and some existing cache layout algorithms are compared.It can be observed that the proposed algorithm is in various parameter scenarios.The performance advantages with different parameters.Secondly,considering the social relationship between users,the paper proposes a cache benefit function based on trust between users,interest preference and physical distance.It is used to judge the cache value of files,and the cache replicas layout algorithm proposed in the paper is designed to provide a heuristic.Algorithm,which is used to solve the cache replacement problem after the successful request of user files.According to the simulation results,the cache replacement algorithm is superior to the existing common cache replacement algorithm in terms of system average service delay,unloading gain,and cache hit performance.