Hao Zhou, Xiaoyan Wang, Zhi Liu, Xiaoming Zhao, Yusheng Ji, S. Yamada
{"title":"基于qos的车载组播服务资源分配","authors":"Hao Zhou, Xiaoyan Wang, Zhi Liu, Xiaoming Zhao, Yusheng Ji, S. Yamada","doi":"10.1109/WCSP.2016.7752526","DOIUrl":null,"url":null,"abstract":"Quality of service (QoS) constrained multicast service over vehicular networks has considerable benefit for both road safety and entertainment, while the resource allocation problem of it is challenging due to the high mobility of vehicles. In this paper, we manage the vehicle mobility by dividing one scheduling round into multiple segments, and investigate the resource allocation problem to answer the questions of which modulation and coding scheme (MCS) should be adopted for each flow in each segment, and how to schedule the radio resources among all the flows. We consider two kinds of multicast services. For the multicast service to cover all the recipients, we formulate the problem as a resource scheduling problem with fixed MCS profile, and propose a k-commodity packing based approximation algorithm to solve it with low complexity. For the multicast service with adaptive recipients, we notice that the number of valid MCS profiles for each flow is limited, and propose a heuristic algorithm to search for proper MCS profile assignments. The simulation results verify the efficiency of the proposed scheme.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"QoS-aware resource allocation for multicast service over vehicular networks\",\"authors\":\"Hao Zhou, Xiaoyan Wang, Zhi Liu, Xiaoming Zhao, Yusheng Ji, S. Yamada\",\"doi\":\"10.1109/WCSP.2016.7752526\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quality of service (QoS) constrained multicast service over vehicular networks has considerable benefit for both road safety and entertainment, while the resource allocation problem of it is challenging due to the high mobility of vehicles. In this paper, we manage the vehicle mobility by dividing one scheduling round into multiple segments, and investigate the resource allocation problem to answer the questions of which modulation and coding scheme (MCS) should be adopted for each flow in each segment, and how to schedule the radio resources among all the flows. We consider two kinds of multicast services. For the multicast service to cover all the recipients, we formulate the problem as a resource scheduling problem with fixed MCS profile, and propose a k-commodity packing based approximation algorithm to solve it with low complexity. For the multicast service with adaptive recipients, we notice that the number of valid MCS profiles for each flow is limited, and propose a heuristic algorithm to search for proper MCS profile assignments. The simulation results verify the efficiency of the proposed scheme.\",\"PeriodicalId\":158117,\"journal\":{\"name\":\"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2016.7752526\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2016.7752526","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
QoS-aware resource allocation for multicast service over vehicular networks
Quality of service (QoS) constrained multicast service over vehicular networks has considerable benefit for both road safety and entertainment, while the resource allocation problem of it is challenging due to the high mobility of vehicles. In this paper, we manage the vehicle mobility by dividing one scheduling round into multiple segments, and investigate the resource allocation problem to answer the questions of which modulation and coding scheme (MCS) should be adopted for each flow in each segment, and how to schedule the radio resources among all the flows. We consider two kinds of multicast services. For the multicast service to cover all the recipients, we formulate the problem as a resource scheduling problem with fixed MCS profile, and propose a k-commodity packing based approximation algorithm to solve it with low complexity. For the multicast service with adaptive recipients, we notice that the number of valid MCS profiles for each flow is limited, and propose a heuristic algorithm to search for proper MCS profile assignments. The simulation results verify the efficiency of the proposed scheme.