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}
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.