D2D网络中基于用户满意度的组播资源分配方案

R. Jagadeesha, J. Sheu, W. Hon
{"title":"D2D网络中基于用户满意度的组播资源分配方案","authors":"R. Jagadeesha, J. Sheu, W. Hon","doi":"10.1109/EuCNC.2017.7980717","DOIUrl":null,"url":null,"abstract":"The D2D communication has high potential to serve multiple users with high data rate within a proximity in the next generation cellular networks. In this paper, we consider a multicast scenario of D2D users where each user wishes to receive the same multicast data at varying data rates. Based on our best knowledge, finding an optimal solution to satisfy the user request in the said context requires unreasonable time. Therefore, we have proposed approximation algorithms with two objectives (i) maximize the satisfied throughput, (ii) maximize the number of satisfied users when the available resource blocks are limited. The simulation results show that the proposed algorithms offer a worst-case performance guarantee and outperform the other conventional schemes in terms of throughput, satisfied users count, and fairness.","PeriodicalId":6626,"journal":{"name":"2017 European Conference on Networks and Communications (EuCNC)","volume":"2011 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"User satisfaction based resource allocation schemes for multicast in D2D networks\",\"authors\":\"R. Jagadeesha, J. Sheu, W. Hon\",\"doi\":\"10.1109/EuCNC.2017.7980717\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The D2D communication has high potential to serve multiple users with high data rate within a proximity in the next generation cellular networks. In this paper, we consider a multicast scenario of D2D users where each user wishes to receive the same multicast data at varying data rates. Based on our best knowledge, finding an optimal solution to satisfy the user request in the said context requires unreasonable time. Therefore, we have proposed approximation algorithms with two objectives (i) maximize the satisfied throughput, (ii) maximize the number of satisfied users when the available resource blocks are limited. The simulation results show that the proposed algorithms offer a worst-case performance guarantee and outperform the other conventional schemes in terms of throughput, satisfied users count, and fairness.\",\"PeriodicalId\":6626,\"journal\":{\"name\":\"2017 European Conference on Networks and Communications (EuCNC)\",\"volume\":\"2011 1\",\"pages\":\"1-5\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 European Conference on Networks and Communications (EuCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EuCNC.2017.7980717\",\"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 European Conference on Networks and Communications (EuCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EuCNC.2017.7980717","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在下一代蜂窝网络中,D2D通信具有在近距离内以高数据速率服务多个用户的巨大潜力。在本文中,我们考虑了D2D用户的组播场景,其中每个用户希望以不同的数据速率接收相同的组播数据。基于我们的最佳知识,在上述上下文中找到满足用户请求的最优解需要不合理的时间。因此,我们提出了具有两个目标的近似算法(i)最大化满意吞吐量,(ii)在可用资源块有限的情况下最大化满意用户的数量。仿真结果表明,该算法在最坏情况下提供了性能保证,并且在吞吐量、满意用户数和公平性方面优于其他传统算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
User satisfaction based resource allocation schemes for multicast in D2D networks
The D2D communication has high potential to serve multiple users with high data rate within a proximity in the next generation cellular networks. In this paper, we consider a multicast scenario of D2D users where each user wishes to receive the same multicast data at varying data rates. Based on our best knowledge, finding an optimal solution to satisfy the user request in the said context requires unreasonable time. Therefore, we have proposed approximation algorithms with two objectives (i) maximize the satisfied throughput, (ii) maximize the number of satisfied users when the available resource blocks are limited. The simulation results show that the proposed algorithms offer a worst-case performance guarantee and outperform the other conventional schemes in terms of throughput, satisfied users count, and fairness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信