Energy-efficient multicasting in wireless networks with fixed node transmission power
Energy-efficient multicasting in wireless networks with fixed node transmission power
复制标题
DOI：
10.1145/1582379.1582588
复制
发表时间：
2009-06
期刊：
影响因子：
--
通讯作者：
Christos A. Papageorgiou;P. Kokkinos;Emmanouel Varvarigos
中科院分区：
文献类型：
--
作者：
Christos A. Papageorgiou;P. Kokkinos;Emmanouel Varvarigos
在这项工作中，我们提出了一种节能的无线网络多播算法，其中节点的传输功率是固定的。我们的算法基于多代价方法，并选择最优的节能节点集进行多播，考虑：i)节点剩余能量，ii)节点使用的传输功率，以及iii)覆盖的节点集。我们的算法是最优的，因为它可以优化组播任务消耗的总功率和节点当前剩余能量的最小值的任何期望函数，只要优化函数在每个参数中都是单调的。我们的最优算法具有非多项式复杂度，因此，我们提出了一个在多项式时间内产生近似最优解的松弛算法。性能结果表明，所提算法在能耗和网络寿命方面都优于现有的能量感知组播解决方案。结果表明，近最优多代价算法以较小的计算量获得了最优多代价算法的大部分性能优势。
In this work, we propose an energy-efficient multicasting algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is based on the multicost approach and selects an optimal energy-efficient set of nodes for multicasting, taking into account: i) the node residual energies, ii) the transmission powers used by the nodes, and iii) the set of nodes covered. Our algorithm is optimal, in the sense that it can optimize any desired function of the total power consumed by the multicasting task and the minimum of the current residual energies of the nodes, provided that the optimization function is monotonic in each of these parameters. Our optimal algorithm has non-polynomial complexity, thus, we propose a relaxation producing a near-optimal solution in polynomial time. The performance results obtained show that the proposed algorithms outperform established solutions for energy-aware multicasting, with respect to both energy consumption and network lifetime. Moreover, it is shown that the near-optimal multicost algorithm obtains most of the performance benefits of the optimal multicost algorithm at a smaller computational overhead.