4.5 Article

On Cost Minimization for Cache-Enabled D2D Networks with Recommendation

Journal

CHINA COMMUNICATIONS
Volume -, Issue -, Pages -

Publisher

CHINA INST COMMUNICATIONS
DOI: 10.23919/JCC.2022.00.010

Keywords

edge caching; cost minimization; D2D communication; recommendation systems

Funding

  1. Research Grants Council of the Hong Kong Special Administrative Region, China [UGC/FDS16/E09/21]
  2. Hong Kong President?s Advisory Committee on Research and De-velopment (PACRD) [2020/1.6]
  3. National Natural Science Foundation of China (NSFC) [61971239, 92067201]
  4. Jiangsu Provincial Key Research and Development Program [BE2020084-4]
  5. Postgraduate Research & Practice Innovation Program of Jiangsu Province [KYCX20 0714]

Ask authors/readers for more resources

Cache-enabled device-to-device communication is a promising technique to handle the increase in mobile data traffic. A recommendation system can reduce heterogeneity among users and enhance the benefits of edge caching.
To accommodate the tremendous increase of mobile data traffic, cache-enabled device-to-device (D2D) communication has been taken as a promising technique to release the heavy burden of cellular networks since popular contents can be pre-fetched at user devices and shared among subscribers. As a result, cellular traffic can be offloaded and an enhanced system performance can be attainable. However, due to the limited cache capacity of mobile devices and the heterogeneous preferences among different users, the requested contents are most likely not be proactively cached, inducing lower cache hit ratio. Recommendation system, on the other hand, is able to reshape users' request schema, mitigating the heterogeneity to some extent, and hence it can boost the gain of edge caching. In this paper, the cost minimization problem for the social-aware cache-enabled D2D networks with recommendation consideration is investigated, taking into account the constraints on the cache capacity budget and the total number of recommended files per user, in which the contents are sharing between the users that trust each other. The minimization problem is an integer non-convex and non-linear programming, which is in general NP-hard. Therewith, we propose a time efficient joint recommendation and caching decision scheme. Extensive simulation results show that the proposed scheme converges quickly and significantly reduces the average cost when compared with various benchmark strategies.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available