Joint Optimization Method of Content Caching and User Association in Heterogeneous Cellular Networks
A technology of content caching and cellular network, applied in the field of mobile communication, can solve problems such as inability to accurately predict the probability of content requested by a single user, and not optimal matching
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0066] established as figure 2 The two-layer heterogeneous cellular network content service model shown includes a macro base station MBS and N home base stations FBS, and the set of base stations is F={f 0 ,f 1 ,f 2 ,..., f N}, where f 0 Indicates MBS; f 1 ,f 2 ,..., f N represent N FBSs respectively. Let the number of users be M, and the set of users is expressed as U={u 1 ,u 2 ,...,u M}. let f n The available bandwidth of ∈F is B n , the available bandwidth is divided into I n subcarriers, that is, an f n The maximum number of users that can be served at the same time is I n , then the bandwidth b of each subcarriern =B n / I n . It is assumed that subcarriers in each base station and between base stations are mutually orthogonal, and inter-channel interference is not considered. Due to the overlapping coverage between base stations, a user may have one MBS and multiple candidate FBSs to choose from when accessing the network, but is only associated with ...
Embodiment 2
[0099] On the basis of Embodiment 1, the content caching strategy remains unchanged, and step S41 is changed to: step S42, when the user association method adopted is a delayed association method, when the user's request for content in the i-th cycle arrives, let the user Wait for a short time τ m , associating to the base station together with the user arriving later; specifically include: remaining steps remain unchanged, embodiment 2 adopts delay association (Joint optimize content caching and user association with waiting association, JCCA-WA) strategy construction:
[0100] When the user request arrives, let the user wait for a short time τ m , associate with the users who arrive later, and convert the problem of minimizing the average delay of users to obtain content into the problem of solving the optimal matching problem of the bipartite graph between users and base stations. Define weighted undirected bipartite graph G=(F, U, E), two vertex sets F={f of weighted undi...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


