CN108541025B - Wireless heterogeneous network-oriented base station and D2D common caching method - Google Patents
Wireless heterogeneous network-oriented base station and D2D common caching method Download PDFInfo
- Publication number
- CN108541025B CN108541025B CN201810360143.1A CN201810360143A CN108541025B CN 108541025 B CN108541025 B CN 108541025B CN 201810360143 A CN201810360143 A CN 201810360143A CN 108541025 B CN108541025 B CN 108541025B
- Authority
- CN
- China
- Prior art keywords
- base station
- file
- cache
- user
- new
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000002922 simulated annealing Methods 0.000 claims abstract description 9
- 230000005540 biological transmission Effects 0.000 claims description 5
- 230000003139 buffering effect Effects 0.000 claims description 5
- 238000004891 communication Methods 0.000 claims description 4
- 239000000126 substance Substances 0.000 claims description 2
- 238000004088 simulation Methods 0.000 abstract description 2
- 238000011161 development Methods 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000001413 cellular effect Effects 0.000 description 2
- 238000007405 data analysis Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000010267 cellular communication Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
- H04W28/14—Flow control between communication endpoints using intermediate storage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a base station and D2D common caching method facing a wireless heterogeneous network, which comprises the steps of firstly establishing a system model of the common work of a D2D cache and a base station cache, dividing users into two types of D2D and base station users, preferentially obtaining the D2D user from an adjacent D2D server when the D2D user requests a file in the system, requesting the base station if no corresponding file is found, directly requesting the base station by the base station user, and turning to a core network to request files which are not cached by the base station and the D2D server. In order to reduce the system flow of the scene where the two work together, a cache content determination method based on a simulated annealing method is designed. Simulation results show that compared with the existing caching method, the method can effectively reduce the system flow, reduce the load of the base station and the backhaul link and improve the cache hit rate.
Description
Technical Field
The invention belongs to the technical field of wireless network caching, and particularly relates to a base station and D2D common caching method for a wireless heterogeneous network.
Background
In recent years, with the development of smart phones, the traffic load of a wireless cellular network shows an exponential increase situation, and huge bearing pressure is brought to a mobile communication network. In a large amount of mobile internet data, a small amount of hot data occupies a great traffic load, and the hot content transmission has great redundancy, which brings great burden to a backhaul link. With the development of big data analysis technology, the prediction of hot content becomes possible. And many side information from social networks and the like can also help us to know the daily movement characteristics, social characteristics, preference characteristics and the like of the user. The development of cloud computing and edge computing has also enabled real-time data analysis to be applied. The cost of deploying the cache is also greatly reduced by the price reduction of the fast storage medium. The development of D2D communication has made it possible for mobile terminals to share content with each other. Therefore, many scholars propose to cache hot contents to wireless network edge devices (base stations, mobile terminals and the like) in advance at the idle time of the network, and the method not only relieves the pressure of backhaul network load, but also reduces service request delay, thereby having great research potential.
The study on caching in wireless networks was initiated in 2012, and it was proposed by some scholars to introduce small base stations with certain caching functions in traditional cellular communication networks, with which users can obtain content with their assistance. From this, a great deal of research on wireless network caching has begun to be developed. A complete wireless network cache system mainly comprises three parts, namely: with content prediction, cache placement policy, and cache distribution policy in mind, existing research on this system has also focused on these three components. The existing research focuses on the optimization of the buffer performance when the base station and the D2D work independently, and focuses little on the system performance and the cooperative buffer method when the base station and the D2D work together, but the base station and the D2D device work together in a wireless heterogeneous network is a typical scenario.
Disclosure of Invention
The invention aims to provide a base station and D2D common caching method facing a wireless heterogeneous network, which aims to overcome the problems in the prior art, and achieves the purposes of reducing system load and relieving the load pressure of a mobile network backhaul link and a base station by introducing a D2D caching technology into a wireless network cache and optimizing the common working scene of the two, thereby improving the user experience.
In order to achieve the purpose, the invention adopts the following technical scheme:
a method for jointly caching a base station and D2D facing a wireless heterogeneous network comprises the following steps:
step 1: establishing a system model of the cooperative work of a D2D cache and a base station cache, dividing users into two types of D2D users and base station users, preferentially obtaining the D2D users from adjacent D2D servers when the D2 users request files in the system, requesting the base station if no corresponding file is found, directly requesting the files from the base station by the base station users, and turning to a core network to request the files which are not cached by the base station and the D2D servers;
step 2: and determining the cache content by adopting a simulated annealing method with the aim of minimizing the system flow.
Further, the step 1 of establishing a system model in which the D2D cache and the base station cache work together is specifically as follows:
user U ═ { U ═ U1,u2…ukDistributed in the coverage area of the base station by the process of Poisson points, and the density is lambdauNumber k, where m users
For D2D service provider, density is λdSince the D2D communication is D as an effective radius of the D2D cache service provider, which caches content in advance and provides content sharing to surrounding users, the set of users who can obtain the D2D service is UdThe set of users that can only be served by the base station is CUUDThe probability that the user belongs to the base station user set is PBProbability of belonging to D2D user set is PDD2D device and base station buffer vector are F respectivelyD＝{f1,D,f2,D…fn,D}、FB＝{f1,B,f2,B…fn,B}；
The file library F of the system comprises n files, each file is equal in size and is a { mb }, and the storage capacity of D2D equipment is SDCan store SDFor one file, all D2D devices cache the same SDA file; the storage capacity of the base station is SBCan store SBThe popularity of the file obeys Zipf distribution, the parameter is gamma, and the following formula represents the probability that the user requests the ith file:
further, the minimization of the system flow in step 2 is specifically as follows:
the system flow generated by file transmission when a user requests a file is c0,c1,c2From the process of requesting the file by the user, it can be seen that the system traffic is not occupied when the file is obtained on the D2D server, so c0When the base station obtains the file, the flow c is generated as 01A traffic is generated at the backhaul link when a file is obtained through the backhaul link, and a traffic is also generated at the base station when the file is transmitted to the user, so c2When a user requests a file, if the user belongs to the base station user set, the average traffic is:
if the user belongs to the D2D user set, the average flow is:
the average system flow when any user in the system requests a file is as follows:
wherein the content of the first and second substances,
namely, the minimization of the system flow is a 0-1 integer programming problem and is an NP-hard problem.
Further, the step 2 of determining the cache content by using the simulated annealing method specifically includes:
1) initialization: setting an initial termination condition T, a minimum termination condition TminUpdating parameter α, initial cache contents FB，current，FD，currentInitial system flow Cbest(FB，best，FD，best) The number of iterations L of each cycle;
2) repeating the steps 3) to 6) for L times;
3) for the existing cache contents FB，current，FD，currentGenerating random disturbance and generating new buffer content FB，new，FD，new；
4) If the content F is newly cachedB，new，FD，newIf the buffer capacity of the base station is satisfied, calculating the system gain delta t caused by the new buffer state as Cbest(FB，best，FD，best)-Cnew(FB，new，FD，new) Otherwise, returning to the step 2);
5) if Δ t < 0, then state F will be cached newlyB，new，FD，newAccepting the current cache content and storing the current cache content as the optimal cache content FB，best，FD，bestOtherwise, the current cache content is accepted as the probability exp (-delta T/T), but the optimal cache content is not changed;
6) reducing T to alpha times of the original value to obtain a new termination condition, and if the new termination condition is less than or equal to the minimum termination condition TminThen terminate the algorithm and output FB，best，FD，bestIf so, the obtained optimal cache content is obtained, otherwise, the step 2) is carried out continuously.
Compared with the prior art, the invention has the following beneficial technical effects:
according to the invention, the base station and the D2D are used for buffering together, so that the buffering efficiency is improved, the load pressure of the base station and a return link is reduced by introducing the D2D buffering into the base station buffering, and the purpose of shunting file transmission is achieved. And the buffer space of the base station and the D2D equipment is reasonably planned by the buffer content determination method based on the simulated annealing method, so that the hot content can be reasonably buffered by the base station and the D2D equipment. Simulation results show that the method effectively improves the cache hit rate; the method can effectively reduce the system traffic, reduce the base station and backhaul link load, and reduce the system traffic by 10% to 25% as the D2D user density is increased.
Drawings
FIG. 1 is a diagram of a model of a base station and D2D co-caching network;
FIG. 2 is a process diagram of a method for determining cache contents based on a simulated annealing method;
FIG. 3 is a graph of the impact of D2D server density on system traffic;
fig. 4 is a timing diagram of a signaling interaction procedure of D2D multiplexing cellular resources;
FIG. 5 is a graph of the effect of a zipf distribution parameter on system traffic.
Detailed Description
The invention is described in further detail below with reference to the accompanying drawings:
see FIG. 1
The invention provides a base station and D2D common caching method facing a wireless heterogeneous network, which achieves the purposes of reducing system load and relieving the load pressure of a mobile network backhaul link and a base station by introducing a D2D caching technology into a wireless network cache and optimizing the common working scene of the two, thereby improving user experience.
Constructing a system model:
user U ═ { U ═ U1,u2…ukDistributed in the coverage area of the base station by the process of Poisson points, and the density is lambdauAnd the number is k. Where m users
For D2D service provider, density is λdAs a provider of the D2D caching service, content is cached in advance and content sharing is provided to surrounding users. The effective radius of the D2D communication is D, so the set of users that can obtain the D2D service is Ud. Set of users served only by the base station is CUUD. The probability that the user belongs to the base station user set is PBProbability of belonging to D2D user set is PD. D2D device and base station buffer vector FD＝{f1,D,f2,D…fn,D}、FB＝{f1,B,f2,B…fn,B}。
The file library F of the system comprises n files, and each fileAre all a (mb) with equal size. The storage capacity of the D2D device is SDCan store SDFor one file, all D2D devices cache the same SDAnd (4) a file. The storage capacity of the base station is SBCan store SBAnd (4) a file. The popularity of a file follows a Zipf distribution with a parameter of γ, and the following formula represents the probability that the user requests the ith file:
the process of a user requesting a file in the system is described as follows:
1) when the user in the base station set requests the file, directly inquiring whether the cache of the base station has proper content, if so, directly sending the content back to the equipment, and if not, sending the content by the core network through a return link.
2) When the D2D centralized user requests the file, firstly, it is inquired whether the adjacent D2D server has the proper content, if so, the content is directly returned, otherwise, the base station is inquired. The base station directly communicates with the equipment through the base station to return corresponding content if the base station has the required content, and the corresponding content is sent by the core network through a backhaul link if the base station does not have the required content.
Constructing an optimization problem:
the system flow generated by file transmission is c0,c1,c2From the process of requesting the file by the user, it can be seen that the system traffic is not occupied when the file is obtained on the D2D server, so c 00, c is generated when the base station obtains the file1A traffic is generated in the backhaul link when a file is acquired through the backhaul link, and a traffic is also generated when the base station transmits the file to the user, so c22 a. Therefore, when a user requests a file, if the user belongs to the base station user set, the average flow is:
if the user belongs to the D2D user set, the average flow is:
the average system flow when any user in the system requests a file is as follows:
fi，B∈{0，1}，fi，D∈{0，1}，i＝1，2…n
minimizing system traffic becomes a 0-1 integer programming problem and is an NP-hard problem. We design a cache content decision method based on a simulated annealing method.
The method comprises the following steps of:
1) and (5) initializing. Setting an initial termination condition T, a minimum termination condition TminUpdating parameter α, initial cache contents FB，current，FD，currentInitial system flow Cbest(FB，best，FD，best) The number of iterations L per cycle, T being typically 100, TminIs a smaller number, α is 0.9 and L is 100 n.
2) Repeating the steps 3) to 6) for L times.
3) For the existing cache contents FB，current，FD，currentGenerating random disturbance and generating new buffer content FB，new，FD，new。
4) If the content F is newly cachedB，new，FD，newIf the buffer capacity limit of the base station is met, calculating newSystem gain Δ t ═ C due to buffer statusbest(FB，best，FD，best)-Cnew(FB，new，FD，new). Otherwise, returning to the step (2).
5) If Δ t < 0, then state F will be cached newlyB，new，FD，newAccepting the current cache content and storing the current cache content as the optimal cache content FB，best，FD，best. Otherwise, the current cache content is accepted as the probability exp (-delta T/T), but the optimal cache content is not changed.
6) Reducing T to alpha times of the original value to obtain a new termination condition, and if the new termination condition is less than or equal to the minimum termination condition TminThen terminate the algorithm and output FB，best，FD，bestNamely the obtained optimal cache content. Otherwise, the step (2) is carried out continuously.
As can be seen from fig. 1, when a user requests a file, the user first searches for the corresponding file in the nearby D2D server, and then searches for the corresponding file in the base station if the corresponding file is not found.
As can be seen from fig. 2, the complete work flow of the cache content determination method based on the simulated annealing method is shown.
As can be seen from fig. 3, as the density of the D2D servers increases, the caching policy proposed by the present invention has the smallest system traffic, and when the density of the D2D servers is smaller, the performance gap of the three common caching policies is still not large, but as the density of the D2D servers increases, the caching policy proposed by the present invention significantly reduces the system traffic, and when the density of the D2D servers is 0.005, the system traffic is reduced by about 8% compared to the less-than-best caching policy, and when the density of the D2D servers is 0.008, the system traffic is reduced by about 11%, so as to achieve the purpose of reducing the system load pressure.
As can be seen from fig. 4, when the method of the present invention is used, the local service probability, i.e. the probability that the user obtains the file through the base station or D2D server, is also maintained at a relatively large level.
As can be seen from fig. 5, the caching method provided by the present invention is closer to the performance of the policy with the maximum local hit rate when the zipf parameter is lower, and reduces the system traffic by about 11% compared with the most popular policy. At higher zipf parameters, the performance is closer to the most popular policy, but the system traffic is reduced by about 25% compared to the local hit rate maximum policy. A higher traffic reduction is always maintained compared to the base station only caching strategy.
Therefore, it can be seen that the base station and D2D co-caching method provided by the present invention can effectively reduce the system traffic and reduce the base station and backhaul link loads.
While the invention has been described in further detail with reference to specific preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (1)
1. A method for jointly buffering a base station and D2D facing a wireless heterogeneous network is characterized by comprising the following steps:
step 1: establishing a system model of the cooperative work of a D2D cache and a base station cache, dividing users into two types of D2D users and base station users, preferentially obtaining the D2D users from adjacent D2D servers when the D2 users request files in the system, requesting the base station if no corresponding file is found, directly requesting the files from the base station by the base station users, and turning to a core network to request the files which are not cached by the base station and the D2D servers;
specifically, the establishment of the system model in which the D2D cache and the base station cache work together is as follows:
user U ═ { U ═ U1,u2…ukDistributed in the coverage area of the base station by the process of Poisson points, and the density is lambdauNumber k, where m users
For D2D service provider, density is λdAs a provider of the D2D cache service, caching content in advance and providing content sharing to surrounding usersSince the effective radius of D2D communication is D, the set of users who can obtain D2D service is UdThe set of users that can only be served by the base station is CUUDThe probability that the user belongs to the base station user set is PBProbability of belonging to D2D user set is PDD2D device and base station buffer vector are F respectivelyD＝{f1,D,f2,D…fn,D}、FB＝{f1,B,f2,B…fn,B}；
The file library F of the system comprises n files, each file is equal in size and is a { mb }, and the storage capacity of D2D equipment is SDCan store SDFor one file, all D2D devices cache the same SDA file; the storage capacity of the base station is SBCan store SBThe popularity of the file obeys Zipf distribution, the parameter of the Zipf distribution is gamma, and the following formula represents the probability that the user requests the ith file:
step 2: with the minimized system flow as a target, determining cache content by adopting a simulated annealing method;
the minimized system flow is specifically as follows:
the system flow generated by file transmission when a user requests a file is c0，c1，c2From the process of requesting the file by the user, it can be seen that the system traffic is not occupied when the file is obtained on the D2D server, so c0When the base station obtains the file, the flow c is generated as 01A traffic is generated at the backhaul link when a file is obtained through the backhaul link, and a traffic is also generated at the base station when the file is transmitted to the user, so c2When a user requests a file, if the user belongs to the base station user set, the average traffic is:
if the user belongs to the D2D user set, the average flow is:
the average system flow when any user in the system requests a file is as follows:
wherein the content of the first and second substances,
fi，B∈{0，1}，fi，D∈{0，1}，i＝1，2…n
namely, the minimized system flow is a 0-1 integer programming problem and is an NP-hard problem;
the method for determining the cache content based on the simulated annealing method specifically comprises the following steps:
1) initialization: setting an initial termination condition T, a minimum termination condition TminUpdating parameter α, initial cache contents FB，current，FD，currentInitial system flow Cbest(FB，best，FD，best) The number of iterations L of each cycle;
2) repeating the steps 3) to 6) for L times;
3) for the existing cache contents FB，current，FD，currentGenerating random disturbance and generating new buffer content FB，new，FD，new；
4) If the content F is newly cachedB，new，FD，newSystem for calculating new buffer state brought by meeting buffer capacity of base stationGain Δ t ═ Cbest(FB，best，FD，best)-Cnew(FB，new，FD，new) Otherwise, returning to the step 2);
5) if Δ t < 0, then state F will be cached newlyB，new，FD，newAccepting the current cache content and storing the current cache content as the optimal cache content FB，best，FD，bestOtherwise, the current cache content is accepted as the probability exp (-delta T/T), but the optimal cache content is not changed;
6) reducing T to alpha times of the original value to obtain a new termination condition, and if the new termination condition is less than or equal to the minimum termination condition TminThen terminate the algorithm and output FB，best，FD，bestIf so, the obtained optimal cache content is obtained, otherwise, the step 2) is carried out continuously.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810360143.1A CN108541025B (en) | 2018-04-20 | 2018-04-20 | Wireless heterogeneous network-oriented base station and D2D common caching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810360143.1A CN108541025B (en) | 2018-04-20 | 2018-04-20 | Wireless heterogeneous network-oriented base station and D2D common caching method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108541025A CN108541025A (en) | 2018-09-14 |
| CN108541025B true CN108541025B (en) | 2020-11-10 |
Family
ID=63478019
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810360143.1A Expired - Fee Related CN108541025B (en) | 2018-04-20 | 2018-04-20 | Wireless heterogeneous network-oriented base station and D2D common caching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108541025B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109495865B (en) * | 2018-12-27 | 2021-06-01 | 华北水利水电大学 | D2D-assisted self-adaptive cache content placement method and system |
| CN110062357B (en) * | 2019-03-20 | 2022-02-11 | 重庆邮电大学 | D2D auxiliary equipment caching system and caching method based on reinforcement learning |
| CN111901394B (en) * | 2020-07-07 | 2023-05-02 | 哈尔滨工业大学（深圳） | Method and system for jointly considering user preference and activity level for mobile edge caching |
| CN112437416A (en) * | 2020-11-20 | 2021-03-02 | 中国石油大学(华东) | User unloading object searching method facing D2D wireless cache network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101997889A (en) * | 2009-08-28 | 2011-03-30 | 中国移动通信集团公司 | Method, system and device for optimizing P2P transmission in WLAN |
| CN105791391A (en) * | 2016-01-29 | 2016-07-20 | 西安交通大学 | Method for calculating optimal cooperation distance of D2D fusion network based on file popularity |
| CN107623720A (en) * | 2017-08-18 | 2018-01-23 | 中国科学院上海微系统与信息技术研究所 | A kind of data selectivity caching method based on Cooperative caching |
-
2018
- 2018-04-20 CN CN201810360143.1A patent/CN108541025B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101997889A (en) * | 2009-08-28 | 2011-03-30 | 中国移动通信集团公司 | Method, system and device for optimizing P2P transmission in WLAN |
| CN105791391A (en) * | 2016-01-29 | 2016-07-20 | 西安交通大学 | Method for calculating optimal cooperation distance of D2D fusion network based on file popularity |
| CN107623720A (en) * | 2017-08-18 | 2018-01-23 | 中国科学院上海微系统与信息技术研究所 | A kind of data selectivity caching method based on Cooperative caching |
Non-Patent Citations (3)
| Title |
|---|
| A contextual multi-armed bandit approach to caching in wireless small cell network;Chenxi Zhang,et al;《2017 9th International Conference on Wireless Communications and Signal Processing 》;20171013;全文 * |
| Living on the edge: The role of proactive caching in 5G wireless networks;Ejder Bastug,et al;《 IEEE Communications Magazine 》;20140807;全文 * |
| 异构无线蜂窝网络中面向D2D通信的冗余缓存及资源分配;马双双;《中国优秀硕士学位论文全文数据库》;20180315;正文第三章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108541025A (en) | 2018-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108541025B (en) | Wireless heterogeneous network-oriented base station and D2D common caching method | |
| WO2023168824A1 (en) | Mobile edge cache optimization method based on federated learning | |
| CN108093435B (en) | Cellular downlink network energy efficiency optimization system and method based on cached popular content | |
| CN105791391B (en) | The computational methods of the optimal cooperation distance of D2D converged network based on file popularity | |
| CN106998353B (en) | Optimal caching configuration method for files in content-centric networking | |
| CN107295619B (en) | Base station dormancy method based on user connection matrix in edge cache network | |
| CN108156596B (en) | Method for supporting D2D-cellular heterogeneous network combined user association and content caching | |
| CN108737507B (en) | D2D wireless caching method | |
| CN110312277B (en) | Mobile network edge cooperative cache model construction method based on machine learning | |
| CN108600998B (en) | Cache optimization decision method for ultra-density cellular and D2D heterogeneous converged network | |
| CN112187872B (en) | Content caching and user association optimization method under mobile edge computing network | |
| CN107276788B (en) | Communication model construction method with cache base station based on sleep control | |
| CN104426979A (en) | Distributed buffer scheduling system and method based on social relations | |
| CN111698732A (en) | Time delay oriented cooperative cache optimization method in micro-cellular wireless network | |
| CN115361710A (en) | Content placement method in edge cache | |
| CN110062356B (en) | Cache copy layout method in D2D network | |
| Wan et al. | Deep Reinforcement Learning‐Based Collaborative Video Caching and Transcoding in Clustered and Intelligent Edge B5G Networks | |
| CN109951317B (en) | User-driven popularity perception model-based cache replacement method | |
| CN116916390A (en) | Edge collaborative cache optimization method and device combining resource allocation | |
| Huang et al. | D2D-assisted VR video pre-caching strategy | |
| Ma et al. | Deep reinforcement learning for pre-caching and task allocation in internet of vehicles | |
| CN108551472B (en) | Content cache optimization method based on edge calculation | |
| CN107733949B (en) | Wireless access network caching method and system | |
| CN111556531A (en) | Cooperative cache optimization method in micro-cellular wireless network | |
| CN110139125B (en) | Video sharing method based on demand perception and resource caching in wireless mobile network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20201110 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |