QoS-aware resource allocation for multicast service over vehicular networks
QoS-aware resource allocation for multicast service over vehicular networks
复制标题
DOI：
10.1109/wcsp.2016.7752526
复制
发表时间：
2016-11
期刊：
影响因子：
--
通讯作者：
Hao Zhou;Xiaoyan Wang;Zhi Liu;Xiaoming Zhao;Yusheng Ji;S. Yamada
中科院分区：
文献类型：
--
作者：
Hao Zhou;Xiaoyan Wang;Zhi Liu;Xiaoming Zhao;Yusheng Ji;S. Yamada
车载网络中服务质量（QoS）受限的多播服务对道路安全和娱乐都有很大的好处，但由于车辆的高移动性，其资源分配问题具有挑战性。在本文中，我们管理的车辆移动性划分成多个段的一个调度轮，并研究资源分配问题，以回答问题的调制和编码方案（MCS）应采用每个流在每个段，以及如何调度所有的流之间的无线电资源。我们考虑两种组播服务。为了使组播服务能够覆盖所有的接收者，我们将该问题转化为一个具有固定MCS配置的资源调度问题，并提出了一种基于k-商品包装的近似算法来解决该问题，具有较低的复杂度。对于具有自适应接收者的多播服务，我们注意到每个流的有效MCS配置文件的数量是有限的，并提出了一种启发式算法来搜索适当的MCS配置文件分配。仿真结果验证了该方案的有效性。
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.