On the design of cost minimization for D2D‐enabled wireless caching networks: A joint recommendation, caching, and routing perspective
Abstract Cache‐enabled device‐to‐device (D2D) network has been deemed as an effective technique to offload the data traffic. However, the gain of the caching schemes is closely related to the homogeneity among users' preference distribution. To tackle this issue, recommendation is a promising p...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | IET Communications |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cmu2.12716 |
| _version_ | 1797347176469233664 |
|---|---|
| author | Yu Hua Yaru Fu Qi Zhu |
| author_facet | Yu Hua Yaru Fu Qi Zhu |
| author_sort | Yu Hua |
| collection | DOAJ |
| description | Abstract Cache‐enabled device‐to‐device (D2D) network has been deemed as an effective technique to offload the data traffic. However, the gain of the caching schemes is closely related to the homogeneity among users' preference distribution. To tackle this issue, recommendation is a promising proactive approach. It increases the request probability of recommended contents, reshaping users' contents demand patterns, and improving caching performance. Moreover, considering the heterogeneous network settings, i.e. content retrieval costs vary, the routing design becomes a non‐negligible factor on caching performance optimization. On these grounds, the average system cost of D2D‐enabled wireless caching networks with multiple BSs is first described. Then the routing strategies are designed together with caching and recommendation policies by minimizing the average cost of these networks. The optimization problem is proven as NP‐hard. To facilitate the analysis, the original problem is decoupled into two sub‐problems and solve them respectively. Afterwards, all the variables are optimized in an alternating manner until the convergence is achieved. The proposed algorithm's convergence performance and benefits over benchmark strategies in terms of total cost and cache hit ratio are supported by Monte‐Carlo simulation results. |
| first_indexed | 2024-03-08T11:43:54Z |
| format | Article |
| id | doaj.art-dcaac52e0d1c4856a03c3fc74a26792f |
| institution | Directory Open Access Journal |
| issn | 1751-8628 1751-8636 |
| language | English |
| last_indexed | 2024-03-08T11:43:54Z |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Communications |
| spelling | doaj.art-dcaac52e0d1c4856a03c3fc74a26792f2024-01-25T02:51:53ZengWileyIET Communications1751-86281751-86362024-01-0118212914410.1049/cmu2.12716On the design of cost minimization for D2D‐enabled wireless caching networks: A joint recommendation, caching, and routing perspectiveYu Hua0Yaru Fu1Qi Zhu2Key Wireless Laboratory of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing ChinaSchool of Science and Technology Hong Kong Metropolitan University Hong Kong ChinaKey Wireless Laboratory of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing ChinaAbstract Cache‐enabled device‐to‐device (D2D) network has been deemed as an effective technique to offload the data traffic. However, the gain of the caching schemes is closely related to the homogeneity among users' preference distribution. To tackle this issue, recommendation is a promising proactive approach. It increases the request probability of recommended contents, reshaping users' contents demand patterns, and improving caching performance. Moreover, considering the heterogeneous network settings, i.e. content retrieval costs vary, the routing design becomes a non‐negligible factor on caching performance optimization. On these grounds, the average system cost of D2D‐enabled wireless caching networks with multiple BSs is first described. Then the routing strategies are designed together with caching and recommendation policies by minimizing the average cost of these networks. The optimization problem is proven as NP‐hard. To facilitate the analysis, the original problem is decoupled into two sub‐problems and solve them respectively. Afterwards, all the variables are optimized in an alternating manner until the convergence is achieved. The proposed algorithm's convergence performance and benefits over benchmark strategies in terms of total cost and cache hit ratio are supported by Monte‐Carlo simulation results.https://doi.org/10.1049/cmu2.127165G mobile communicationcache storage |
| spellingShingle | Yu Hua Yaru Fu Qi Zhu On the design of cost minimization for D2D‐enabled wireless caching networks: A joint recommendation, caching, and routing perspective IET Communications 5G mobile communication cache storage |
| title | On the design of cost minimization for D2D‐enabled wireless caching networks: A joint recommendation, caching, and routing perspective |
| title_full | On the design of cost minimization for D2D‐enabled wireless caching networks: A joint recommendation, caching, and routing perspective |
| title_fullStr | On the design of cost minimization for D2D‐enabled wireless caching networks: A joint recommendation, caching, and routing perspective |
| title_full_unstemmed | On the design of cost minimization for D2D‐enabled wireless caching networks: A joint recommendation, caching, and routing perspective |
| title_short | On the design of cost minimization for D2D‐enabled wireless caching networks: A joint recommendation, caching, and routing perspective |
| title_sort | on the design of cost minimization for d2d enabled wireless caching networks a joint recommendation caching and routing perspective |
| topic | 5G mobile communication cache storage |
| url | https://doi.org/10.1049/cmu2.12716 |
| work_keys_str_mv | AT yuhua onthedesignofcostminimizationford2denabledwirelesscachingnetworksajointrecommendationcachingandroutingperspective AT yarufu onthedesignofcostminimizationford2denabledwirelesscachingnetworksajointrecommendationcachingandroutingperspective AT qizhu onthedesignofcostminimizationford2denabledwirelesscachingnetworksajointrecommendationcachingandroutingperspective |