期刊
IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 5, 期 4, 页码 377-387出版社
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2006.1599406
关键词
wireless communication network; approximation algorithm; power awareness; ad hoc networks; energy consumption optimization; multicasting; broadcasting; minimum node-weighted Steiner tree problem
A wireless ad hoc network consists of mobile nodes that are equipped with energy-limited batteries. As mobile nodes are battery-operated, an important issue in such a network is to minimize the total power consumption for each operation. Multicast is one of fundamental operations in any modern telecommunication network including wireless ad hoc networks. Given a multicast request consisting of a source node and a set of destination nodes, the problem is to build a minimum-energy multicast tree for the request such that the total transmission power consumption in the tree is minimized. Since the problem in a symmetric wireless ad hoc network is NP-complete, we instead devise an approximation algorithm with provable approximation guarantee. The approximation of the solution delivered by the proposed algorithm is within a constant factor of the best-possible approximation achievable unless P = NP.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据