Issue No. 04 - April (2006 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2006.41
Weifa Liang , IEEE
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.
Wireless communication network, approximation algorithm, power awareness, ad hoc networks, energy consumption optimization, multicasting, broadcasting, minimum node-weighted Steiner tree problem.
W. Liang, "Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks," in IEEE Transactions on Mobile Computing, vol. 5, no. , pp. 377-387, 2006.