基于用户兴趣和分享意愿,通过D2D通信进行内容卸载

Yijin Pan, Cunhua Pan, Huiling Zhu, Q. Ahmed, Ming Chen, Jiangzhou Wang
{"title":"基于用户兴趣和分享意愿,通过D2D通信进行内容卸载","authors":"Yijin Pan, Cunhua Pan, Huiling Zhu, Q. Ahmed, Ming Chen, Jiangzhou Wang","doi":"10.1109/ICC.2017.7996627","DOIUrl":null,"url":null,"abstract":"As a promising solution to offload cellular traffic, device-to-device (D2D) communication has been adopted to help disseminate contents. In this paper, the D2D offloading utility is maximized by proposing an optimal content pushing strategy based on the user interests and sharing willingness. Specifically, users are classified into groups by their interest probabilities and carry out D2D communications according to their sharing willingness. Although the formulated optimization problem is nonconvex, the optimal solution is obtained in closed-form by applying Karush-Kuhn-Tucker conditions. The theoretical and simulation results show that more contents should be pushed to the user group that is most willing to share, instead of the group that has the largest number of interested users.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"17 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Content offloading via D2D communications based on user interests and sharing willingness\",\"authors\":\"Yijin Pan, Cunhua Pan, Huiling Zhu, Q. Ahmed, Ming Chen, Jiangzhou Wang\",\"doi\":\"10.1109/ICC.2017.7996627\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As a promising solution to offload cellular traffic, device-to-device (D2D) communication has been adopted to help disseminate contents. In this paper, the D2D offloading utility is maximized by proposing an optimal content pushing strategy based on the user interests and sharing willingness. Specifically, users are classified into groups by their interest probabilities and carry out D2D communications according to their sharing willingness. Although the formulated optimization problem is nonconvex, the optimal solution is obtained in closed-form by applying Karush-Kuhn-Tucker conditions. The theoretical and simulation results show that more contents should be pushed to the user group that is most willing to share, instead of the group that has the largest number of interested users.\",\"PeriodicalId\":6517,\"journal\":{\"name\":\"2017 IEEE International Conference on Communications (ICC)\",\"volume\":\"17 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2017.7996627\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2017.7996627","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

设备到设备(D2D)通信作为一种很有前途的蜂窝流量卸载解决方案,已被用于帮助传播内容。本文提出了一种基于用户兴趣和分享意愿的最优内容推送策略,使D2D卸载效用最大化。具体而言,根据用户的兴趣概率将其分组,并根据用户的分享意愿进行D2D通信。虽然所建立的优化问题是非凸的,但通过应用Karush-Kuhn-Tucker条件,得到了闭型的最优解。理论和仿真结果表明,更多的内容应该推送到最愿意分享的用户群,而不是兴趣用户数量最多的用户群。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Content offloading via D2D communications based on user interests and sharing willingness
As a promising solution to offload cellular traffic, device-to-device (D2D) communication has been adopted to help disseminate contents. In this paper, the D2D offloading utility is maximized by proposing an optimal content pushing strategy based on the user interests and sharing willingness. Specifically, users are classified into groups by their interest probabilities and carry out D2D communications according to their sharing willingness. Although the formulated optimization problem is nonconvex, the optimal solution is obtained in closed-form by applying Karush-Kuhn-Tucker conditions. The theoretical and simulation results show that more contents should be pushed to the user group that is most willing to share, instead of the group that has the largest number of interested users.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic control of NFV forwarding graphs with end-to-end deadline constraints New sensing technique for detecting application layer DDoS attacks targeting back-end database resources Using the pattern-of-life in networks to improve the effectiveness of intrusion detection systems On the two time scale characteristics of wireless high speed railway networks Secrecy outage analysis of buffer-aided multi-antenna relay systems without eavesdropper's CSI
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1