Abstract

Content recommendation based on device-to-device (D2D) multicast communications is expected to become a promising approach to improve local area services. Importantly, two main challenges should be considered: i) user clustering—in order to be tailored to recommend contents, the members in the same cluster should have great similarity in multiple characteristics, and ii) link allocation—we should use as little resource consumption and information exchange as possible while keeping the recommendation accuracy. In this paper, we firstly quantify the degree of the similarity between two target users with regard to multiple characteristics. Guided by such similarity, we define a clustering validity index in terms of between-within proportion (BWP) to characterize the clustering performance. Then, the issue of user clustering is modeled as a sum BWP maximum problem, and a user clustering algorithm based on modified K-means algorithm is designed to solve it in a fast-operating and low-complexity way. After user clustering, we model the issue of link allocation as a weighted aggregate interference minimization problem, and then transform it to an exact potential game. As such, a link allocation algorithm based on stochastic learning algorithm is proposed which helps to obtain the result of this game in a distributed way without complete information. Also, we analyze its convergence and optimality performance. Simulation results demonstrate the effectiveness of our proposed algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.