TY - GEN
T1 - Socially-Aware Joint Recommendation and Caching Policy Design in Wireless D2D Networks
AU - Lee, Ming-Chun
AU - Hong, Yao Win Peter
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/6/14
Y1 - 2021/6/14
N2 - As user preferences can be influenced by the recommendation system, it has been shown that the joint recommendation and caching policy design can significantly improve the caching networks where caching is at the BSs. However, whether and how the joint recommendation and caching policy design can provide benefits to cache-aided device-to-device (D2D) networks have not been well-understood. This paper thus contributes in this direction by modeling the offloading probability of the cache-aided D2D network and proposing a social-aware joint recommendation caching policy design. Specifically, considering the preferences and social relationship of users as well as the caching and recommendation policies of the network, we formulate an offloading probability optimization problem which is non-convex. Then, an iterative algorithm with monotonicity and convergence property is proposed to solve the problem. By simulations, we show that the proposed joint recommendation and caching policy design can significantly outperform designs that only optimize the caching policy and other reference designs.
AB - As user preferences can be influenced by the recommendation system, it has been shown that the joint recommendation and caching policy design can significantly improve the caching networks where caching is at the BSs. However, whether and how the joint recommendation and caching policy design can provide benefits to cache-aided device-to-device (D2D) networks have not been well-understood. This paper thus contributes in this direction by modeling the offloading probability of the cache-aided D2D network and proposing a social-aware joint recommendation caching policy design. Specifically, considering the preferences and social relationship of users as well as the caching and recommendation policies of the network, we formulate an offloading probability optimization problem which is non-convex. Then, an iterative algorithm with monotonicity and convergence property is proposed to solve the problem. By simulations, we show that the proposed joint recommendation and caching policy design can significantly outperform designs that only optimize the caching policy and other reference designs.
UR - http://www.scopus.com/inward/record.url?scp=85115730281&partnerID=8YFLogxK
U2 - 10.1109/ICC42927.2021.9500378
DO - 10.1109/ICC42927.2021.9500378
M3 - Conference contribution
AN - SCOPUS:85115730281
T3 - IEEE International Conference on Communications
BT - ICC 2021 - IEEE International Conference on Communications, Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE International Conference on Communications, ICC 2021
Y2 - 14 June 2021 through 23 June 2021
ER -