Multicast Path Construction Scheme for Multi-Hop Wireless Relay Networks
Multicast Path Construction Scheme for Multi-Hop Wireless Relay Networks
复制标题
DOI：
10.1109/glocom.2011.6134536
复制
发表时间：
2011-12
期刊：
影响因子：
--
通讯作者：
Wen-Hsing Kuo
中科院分区：
文献类型：
--
作者：
Wen-Hsing Kuo
近年来，无线接入网络中的组播技术已经成为一个热门的研究课题和应用。然而，如果中继节点的支持，形成一个有效的组播拓扑是一个具有挑战性的问题。本文提出了一种无线中继网络多跳组播接收者最大化方案.首先，我们制定了一个重要的问题，称为多跳最大化（MHRM），它涉及到有效地分配资源的基站和中继站，以最大限度地提高接收者的数量与给定的预算和信道条件。为了解决MHRM，我们提出了一个启发式称为组播路径选择（MPS）。我们证明了MHRM是NP难的，并分析了MPS的计算复杂度。仿真结果表明，在不同的条件下，MPS有效地利用带宽资源和中继节点，它显着优于所有现有的方法进行评估的启发式的性能。据我们所知，强制性私营公积金计划是唯一一个专注于这个重要问题，并取得如此令人满意的表现的计划。
In recent years, multicast over wireless access networks has become a popular research topic and application. However, if relay nodes are supported, forming an efficient multicast topology is a challenging issue. In this paper, we propose a multi- hop multicast recipient maximization scheme for wireless relay networks. First, we formulate an important problem called Multi-Hop Recipient Maximization (MHRM), which involves allocating resources to the base-station and relay stations efficiently in order to maximize the number of recipients with the given budget and channel conditions. To solve MHRM, we propose a heuristic called Multicast Path Selection (MPS). We prove that MHRM is NP-hard, and also analyze MPS's computational complexity. The results of simulations conducted to evaluate the heuristic's performance demonstrate that, under variant conditions, MPS utilizes bandwidth resources and relay nodes effectively such that it significantly outperforms all existing approaches. To the best of our knowledge, MPS is the only scheme that focuses on this important issue and achieves such a satisfactory performance.