Network Coded Wireless Cooperative Multicast with Minimum Transmission Cost
Network Coded Wireless Cooperative Multicast with Minimum Transmission Cost
复制标题
DOI：
10.1155/2012/614206
复制
发表时间：
2012-10
影响因子：
2.3
通讯作者：
Xiumin Wang;Jin Wang;Shukui Zhang
中科院分区：
文献类型：
--
作者：
Xiumin Wang;Jin Wang;Shukui Zhang
我们研究无线有损链路上的多播。我们不需要从源节点下载所有数据，而是允许目标节点自己在本地交换数据包，因为集群内的本地通信以更少的传输成本获得更高的数据包接收概率。但是，我们什么时候停止源节点的传播呢？如果源停止得太早，本地目的节点无法重构所有的原始数据包，而如果源停止得太晚，则无法充分发挥协同数据交换的优势。本文提出了一种网络编码的混合源与协同交换方案，以确定何时停止源发送并开始交换过程，从而使总传输成本最小。对于预定义集群的情况，我们用混合方案推导了期望总传输成本。我们的理论结果表明，在特殊条件下，源节点应该继续发送数据包，直到所有目标节点都获得完整的信息。对于非预定义集群的情况，我们提出了一种集群划分算法，使得每个集群内的目标节点能够高效地进行本地数据交换。最后，仿真结果验证了该方案的有效性。
We study multicasting over wireless lossy links. Instead of downloading all the data from the source node, we allow the destination nodes themselves to locally exchange the packets, as local communication within a cluster achieves higher packet reception probability with less transmission cost. However, when shall we stop the transmission from the source node? If the source stops too early, the destination nodes locally cannot reconstruct all the original packets, while if the source stops too late, the benefit of cooperative data exchange cannot be fully exploited. In this paper, we propose a network coded hybrid source and cooperative exchange scheme to determine when to stop the source sending and start the exchange process, so as to minimize the total transmission cost. For the case when the clusters are predefined, we derive the expected total transmission cost with our hybrid scheme. Our theoretical results show that under a special condition, the source node should keep sending the packets until all the destinations get the complete information. For the case when the clusters are not predefined, we propose a cluster division algorithm such that the destination nodes within each cluster can conduct data exchange locally with energy efficiency. Finally, simulation results demonstrate the effectiveness of the proposed scheme.