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