Abstract
The 5th generation (5G) mobile communication system demands low delay and high user rate of experience for mobile data services, which contradicts with the explosive growth of global mobile data traffic. The explosive growth of data traffic brings serious burden of backhaul links and deteriorates the performance of backhaul delay, and the performance of backhaul delay determines the user rate of experience and average downloading delay of users to a great extent. Cooperative content caching and delivery technique in edge caching entities is an effective method to solve the above problems. This paper proposes an extensive cooperative content caching and delivery scheme based on multicast for device-to-device(D2D)-enabled heterogeneous cellular networks (HetNets). We firstly design an extensive cooperative content caching ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${E}{C^{3}}$ </tex-math></inline-formula> ) scheme for D2D-enabled HetNets, which does not only consider the cooperative caching among D2D user, small base station (SBS) and macro base station (MBS) levels, but also considers the cooperative caching within each level. Moreover, our proposed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${E}{C^{3}}$ </tex-math></inline-formula> scheme also considers the influence of the backhaul links and remote server caching for cooperative caching. By introducing a content request probability (CRP) for each user predicted by context information, the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${E}{C^{3}}$ </tex-math></inline-formula> is formulated as an integer linear programming (ILP) problem. A hybrid genetic algorithm (HGA) is proposed for solving the problem, which combines genetic algorithm (GA), simulated annealing algorithm (SA) and local content request probability priority algorithm (LCRPPA). Furthermore, we design a scheme of content delivery based on multicast (CDBM), which is solved by a suboptimal edge priority algorithm based on multicast (EPABM). Simulation results show that the proposed extensive cooperative content caching and delivery scheme based on multicast can significantly improve the system performance compared with the existing cooperative content caching and delivery schemes.
Highlights
With the large-scale application of mobile terminals and the continuous emergence of new application services, the global mobile data traffic appears explosive growth
SIMULATION RESULTS we evaluate the performance of our proposed extensive cooperative content caching and delivery scheme based on multicast
The above content delivery is formulated as an optimal content delivery scheme that is solved by Hungarian algorithm [9]
Summary
With the large-scale application of mobile terminals and the continuous emergence of new application services, the global mobile data traffic appears explosive growth. Most of above works assume that all content items that users demand can be fetched from MBS, which ignores the constraint of MBS’ caching capacity and the influence of backhaul links and remote server caching for caching scheme. The reduction of caching hit rate and the neglect for MBS’s caching capacity make a large number of content items be fetched from remote servers via MBS, which further aggravates the backhaul burden and results in a sharp increase of backhaul delay. We design an extensive cooperative content caching and delivery scheme based on multicast to solve the contradiction between explosive growth of mobile traffic and the demand for low delay and high user rate of experience in 5G HetNets.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
