Multicast Routing Scheme for Recipient Maximization in Wireless Relay Networks
Multicast Routing Scheme for Recipient Maximization in Wireless Relay Networks
复制标题
DOI：
10.1109/tvt.2010.2056944
复制
发表时间：
2010-07
影响因子：
6.8
通讯作者：
Wen-Hsing Kuo;Jeng-Farn Lee
中科院分区：
文献类型：
--
作者：
Wen-Hsing Kuo;Jeng-Farn Lee
本文研究了无线中继网络中的组播路由问题。我们的目标是根据给定的资源预算和节点的信道质量来决定无线中继网络的拓扑结构，从而最大化多播流的接收者数量。就我们所知，这一重要的最大化问题以前从未得到解决。针对现有方法不能有效解决这一问题，我们提出了一种称为组播用户选择(MSS)的方案。通过分析，我们证明了路径构建问题是NP难的。我们的启发式MSS具有多项式时间复杂度，其性能与最优解是一致的。我们还通过仿真评估了MSS的性能。结果表明，现有的单播路由方法在不同的预算和信道条件下效率不高。相比之下，所提出的MSS方案由于能够有效地利用中继站而获得了更好的性能。
In this paper, we study the multicast routing problem in wireless relay networks. Our objective is to maximize the number of recipients of a multicast stream by deciding the topology of the wireless relay network based on the given resource budget and the channel quality of the nodes. To the best of our knowledge, this important maximization problem has not been previously addressed. Since existing approaches cannot effectively solve the problem, we propose a scheme called multicast subscriber selection (MSS). Through analysis, we prove that the path-construction problem is NP-hard. Our heuristic MSS has polynomial-time complexity, and its performance is bound to the optimal solution. We also evaluate the performance of MSS via simulations. The results demonstrate that the existing unicast routing approach is inefficient under different budgets and channel conditions. In contrast, the proposed MSS scheme achieves better performance, because it can effectively utilize relay stations.