arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.00209cs.NI
收藏

D2D辅助卸载中的内容偏好和共享意愿考虑

On Consideration of Content Preference and Sharing Willingness in D2D Assisted Offloading

Yijin Pan, Cunhua Pan, Huiling Zhu, Qasim Zeeshan Ahmed, Ming Chen, Jiangzhou Wang

摘要:

设备到设备(D2D)辅助卸载在很大程度上取决于人类用户的参与。人类用户的内容偏好和共享意愿是D2D辅助卸载中的两个关键因素。在本文中,考虑到这两个因素,最佳的内容推送策略进行了研究,制定一个优化问题,以最大限度地提高卸载流量测量的卸载增益。根据用户的内容偏好将用户分组,并以不同的共享概率与组间和组内用户共享内容。虽然优化问题是非凸的,封闭形式的最优解的特殊情况下,组间和组内用户的共享概率是相同的。在此基础上,提出了一种替代群优化算法(AGO)来解决一般情况下的优化问题。最后,通过仿真实验验证了特殊情况下的最优推送策略和AGO算法的卸载性能。得出的一个有趣的结论是,具有最大数量的感兴趣的用户的组不一定被给予最高的推送概率。对分享意愿高的用户给予高推送概率更为重要。

英文摘要:

Device-to-device (D2D) assisted offloading heavily depends on the participation of human users. The content preference and sharing willingness of human users are two crucial factors in the D2D assisted offloading. In this paper, with consideration of these two factors, the optimal content pushing strategy is investigated by formulating an optimization problem to maximize the offloading gain measured by the offloaded traffic. Users are placed into groups according to their content preferences, and share content with intergroup and intragroup users at different sharing probabilities. Although the optimization problem is nonconvex, the closed-form optimal solution for a special case is obtained, when the sharing probabilities for intergroup and intragroup users are the same. Furthermore, an alternative group optimization (AGO) algorithm is proposed to solve the general case of the optimization problem. Finally, simulation results are provided to demonstrate the offloading performance achieved by the optimal pushing strategy for the special case and AGO algorithm. An interesting conclusion drawn is that the group with the largest number of interested users is not necessarily given the highest pushing probability. It is more important to give high pushing probability to users with high sharing willingness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑