Mingjun Du, Xiaoxiang Wang, Dongyu Wang, Yulong Wang
{"title":"组播通信中设备间动态聚类算法","authors":"Mingjun Du, Xiaoxiang Wang, Dongyu Wang, Yulong Wang","doi":"10.1109/DASC.2013.129","DOIUrl":null,"url":null,"abstract":"Device-to-Device (D2D) communications make high-speed multicast services possible since the multicast receivers with poor downlink channel conditions can be retransmitted by devices nearby via D2D links. In this paper, we consider how to efficiently use D2D communications to help enhance the quality of wireless multicast services in cellular networks. To achieve this, a dynamic D2D retransmission scheme with maximized utility is proposed, which can adaptively select the retransmission algorithm according to the state of the network load. Through both analysis and simulations, we show that our algorithms achieve a significant gain in terms of utility, and reduce the burden of the base station (BS).","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Device-to-Device Dynamic Clustering Algorithm in Multicast Communication\",\"authors\":\"Mingjun Du, Xiaoxiang Wang, Dongyu Wang, Yulong Wang\",\"doi\":\"10.1109/DASC.2013.129\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Device-to-Device (D2D) communications make high-speed multicast services possible since the multicast receivers with poor downlink channel conditions can be retransmitted by devices nearby via D2D links. In this paper, we consider how to efficiently use D2D communications to help enhance the quality of wireless multicast services in cellular networks. To achieve this, a dynamic D2D retransmission scheme with maximized utility is proposed, which can adaptively select the retransmission algorithm according to the state of the network load. Through both analysis and simulations, we show that our algorithms achieve a significant gain in terms of utility, and reduce the burden of the base station (BS).\",\"PeriodicalId\":179557,\"journal\":{\"name\":\"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DASC.2013.129\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.2013.129","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Device-to-Device Dynamic Clustering Algorithm in Multicast Communication
Device-to-Device (D2D) communications make high-speed multicast services possible since the multicast receivers with poor downlink channel conditions can be retransmitted by devices nearby via D2D links. In this paper, we consider how to efficiently use D2D communications to help enhance the quality of wireless multicast services in cellular networks. To achieve this, a dynamic D2D retransmission scheme with maximized utility is proposed, which can adaptively select the retransmission algorithm according to the state of the network load. Through both analysis and simulations, we show that our algorithms achieve a significant gain in terms of utility, and reduce the burden of the base station (BS).