Abstract:

Due to randomness of user request, limitation of storage space and transmission capacity, it is still a challenge for channel allocation to optimize the successful delivery ratio of contents. Thus, in this paper, we first consider the link selection problem for mobile users in MultiD2D (MD2D) based content delivery networks. We establish a content delivery utility that combines physical and social aspects, taking into account energy consumption, user mobility, and trust relationships. Second, we model the content delivery link selection as the maximum weighted matching problem. For this NP-hard problem, by relaxing the integer constraints, we propose a BnB-CDLS algorithm based on the branch-and-bound method for the proposed content delivery scheme. Furthermore, we prove that the problem can be computationally reduced to a monotone submodular problem subject to matroid and knapsack constraints, which can be solved by a greedy GA-CDLS algorithm. Numerical results show that as compared with the existing schemes, the proposed scheme can significantly improve the successful delivery ratio of contents.