Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

D2D probabilistic cache placement method based on user group preference concentration difference

A technology of concentration and user groups, applied in the field of mobile communication, can solve the problems of incomplete packet popularity modeling, not considering the limitation of user cache capacity, etc.

Active Publication Date: 2020-10-30
SUN YAT SEN UNIV
View PDF6 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] In order to overcome the existing research, the present invention lacks a solution for combining probabilistic cache placement with user multi-preference attributes, only one data packet is considered, the modeling of data packet popularity is not perfect, and the user is not considered There are technical defects in the objective situation of limited cache capacity, and a D2D probabilistic cache (Multi-popularity Grouped Probabilistic Caching for D2D, MGPC-D2D) placement method based on the difference in user group preference concentration is provided.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • D2D probabilistic cache placement method based on user group preference concentration difference
  • D2D probabilistic cache placement method based on user group preference concentration difference
  • D2D probabilistic cache placement method based on user group preference concentration difference

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0105] Such as figure 1 As shown, a D2D probabilistic cache placement method based on the concentration difference of user group preference includes the following steps:

[0106] S1: Construct a scene model with multiple HUEs;

[0107] S2: On the basis of the scene model, construct a data packet popularity model, and calculate the sharing probability of each data packet;

[0108] S3: Calculate the cache according to the sharing probability of each data packet and be willing to share the HUE density of the data packet, and build a transmission model;

[0109] S4: On the basis of taking into account the request probability of the data packet and the transmission success probability of the transmission model, construct a probabilistic cache placement optimization problem;

[0110] S5: Solve the probabilistic cache placement optimization problem through an iterative grouping optimization algorithm to obtain the optimal cache placement probability;

[0111] S6: The optimized cac...

Embodiment 2

[0114] More specifically, on the basis of Example 1, the present invention is further described.

[0115] A. Scene model

[0116] The present invention considers the scenario that there are multiple HUEs in the system, and these HUEs can provide the service of pre-storing or forwarding packet requests for multiple VUEs. Among them, a device with strong functions (such as high battery power and extensive social interaction, etc.) and selfishness (willing to share data packets with high request probability) is selected from UE devices as the HUE. In the design solution of the present invention, the situation that different HUEs have different preferences for data packets is specially considered; the greater the preference probability of a HUE for a data packet, the greater the sharing probability.

[0117] To facilitate the description of the spatial distribution of D2D UEs, the present invention adopts a Poisson Point Process (Poisson Point Process, PPP) model in random geomet...

Embodiment 3

[0209] In order to more fully illustrate the beneficial effects of the present invention, the effectiveness and advancement of the present invention will be further described below in conjunction with specific embodiments and related simulation results and analysis.

[0210]Table 1 System simulation parameter settings

[0211]

[0212] The simulation platform selected for this experiment is In 2018a, the number of random simulations is 1000. Unless otherwise specified below, the typical parameter values ​​selected in the simulation are given in Table 1. This section selects two existing schemes for performance comparison, namely:

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a D2D probabilistic cache placement method based on user group preference concentration difference. The method comprises the following steps of: constructing a scene model and adata packet popularity model, and calculating the sharing probability of each data packet; calculating the density of HUEs which cache the data packet and are willing to share the data packet according to the sharing probability of each data packet, and constructing a transmission model; constructing a probabilistic cache placement optimization problem on the basis of considering the request probability of each data packet and the transmission success probability of the transmission model; solving the probabilistic cache placement optimization problem through an iterative grouping optimization algorithm to obtain an optimized cache placement probability; and converting the optimized cache placement probability into a specific cache placement method for the data packet through a probabilistic random scribing method. According to the method, a multi-popularity model of the user data packets is improved, a cache user sharing model based on topic concentration and different user proportions is provided for the sharing preference of the users, and the objective problem that the cache capacity of the users is limited is comprehensively considered.

Description

technical field [0001] The present invention relates to the field of mobile communication, and more specifically, to a D2D probabilistic cache placement method based on differences in user group preference concentration. Background technique [0002] The emergence of D2D communication technology has broken the technical gap that is not easy to connect and share between adjacent cache users. It can support the direct establishment of communication links between two adjacent terminal devices without transferring business data through the base station, thereby reducing the load on the base station. and transmission delay, improving the spectral efficiency of the system. The wireless edge caching technology places data packets with a high probability of user requests in its adjacent caching terminals, and data packets can be exchanged and shared between terminals to improve the diversity of local caching, thereby reducing the backhaul required in conventional communication syste...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04W28/14H04W4/70
CPCH04W28/14H04W4/70
Inventor 江明黄玲吴宽徐建勋
Owner SUN YAT SEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com