D2D内容共享的持续激励机制:一种深度强化学习方法

Min Chen, Haibo Wang, Xiaoli Chu
{"title":"D2D内容共享的持续激励机制:一种深度强化学习方法","authors":"Min Chen, Haibo Wang, Xiaoli Chu","doi":"10.1109/ICCWorkshops49005.2020.9145226","DOIUrl":null,"url":null,"abstract":"Device-to-device (D2D) communication-based content sharing is regarded as a promising way to offload traffic from cellular networks, where incentive mechanisms are required to motivate mobile user equipment (UE) to participate in content sharing. In this paper, we firstly propose an improved scoring mechanism to provide continuous incentive and then study the impact of historical behavior on continuous motivation. Furthermore, to maintain continuous motivation while keeping the service quality of content sharing, we investigate the weights setting of historical behavior and current status in scores calculating, which is formulated as a stochastic dynamic programming (SDP) problem due to the long-term performance and the randomness of the network. To tackle the curse of dimensionality, a deep reinforcement learning (DRL) algorithm is employed for optimization. Simulation results show that with DRL, the mechanism is effective in motivating content-sharing continuously, improving the quality of service (QoS), and cutting down the sharing cost as well.","PeriodicalId":254869,"journal":{"name":"2020 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Continuous Incentive Mechanism for D2D Content sharing: A Deep Reinforcement Learning Approach\",\"authors\":\"Min Chen, Haibo Wang, Xiaoli Chu\",\"doi\":\"10.1109/ICCWorkshops49005.2020.9145226\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Device-to-device (D2D) communication-based content sharing is regarded as a promising way to offload traffic from cellular networks, where incentive mechanisms are required to motivate mobile user equipment (UE) to participate in content sharing. In this paper, we firstly propose an improved scoring mechanism to provide continuous incentive and then study the impact of historical behavior on continuous motivation. Furthermore, to maintain continuous motivation while keeping the service quality of content sharing, we investigate the weights setting of historical behavior and current status in scores calculating, which is formulated as a stochastic dynamic programming (SDP) problem due to the long-term performance and the randomness of the network. To tackle the curse of dimensionality, a deep reinforcement learning (DRL) algorithm is employed for optimization. Simulation results show that with DRL, the mechanism is effective in motivating content-sharing continuously, improving the quality of service (QoS), and cutting down the sharing cost as well.\",\"PeriodicalId\":254869,\"journal\":{\"name\":\"2020 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCWorkshops49005.2020.9145226\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCWorkshops49005.2020.9145226","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

基于设备到设备(D2D)通信的内容共享被认为是一种很有前途的方式,可以从蜂窝网络中卸载流量,在蜂窝网络中,需要激励机制来激励移动用户设备(UE)参与内容共享。本文首先提出了一种改进的评分机制来提供持续激励,然后研究历史行为对持续激励的影响。此外,为了在保持内容共享服务质量的同时保持持续动力,我们研究了分数计算中历史行为和当前状态的权重设置,由于网络的长期性能和随机性,我们将其表述为随机动态规划(SDP)问题。为了解决维数问题,采用深度强化学习(DRL)算法进行优化。仿真结果表明,在DRL机制下,该机制在激励内容持续共享、提高服务质量(QoS)和降低共享成本方面是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Continuous Incentive Mechanism for D2D Content sharing: A Deep Reinforcement Learning Approach
Device-to-device (D2D) communication-based content sharing is regarded as a promising way to offload traffic from cellular networks, where incentive mechanisms are required to motivate mobile user equipment (UE) to participate in content sharing. In this paper, we firstly propose an improved scoring mechanism to provide continuous incentive and then study the impact of historical behavior on continuous motivation. Furthermore, to maintain continuous motivation while keeping the service quality of content sharing, we investigate the weights setting of historical behavior and current status in scores calculating, which is formulated as a stochastic dynamic programming (SDP) problem due to the long-term performance and the randomness of the network. To tackle the curse of dimensionality, a deep reinforcement learning (DRL) algorithm is employed for optimization. Simulation results show that with DRL, the mechanism is effective in motivating content-sharing continuously, improving the quality of service (QoS), and cutting down the sharing cost as well.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信