This Article 
 Bibliographic References 
 Add to: 
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks
April 2006 (vol. 5 no. 4)
pp. 377-387
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.

[1] M. Agarwal, J.H. Cho, L. Gao, and J. Wu, “Energy Efficient Broadcast in Wireless Ad Hoc Networks with Hitch-Hiking,” Proc. INFOCOM '04 Conf., 2004.
[2] D.J. Baker and A. Ephremides, “The Architectural Organization of a Mobile Radio Network Via Distributed Algorithm,” IEEE Trans. Comm., vol. 29, pp. 56-73, 1981.
[3] S. Banerjee, A. Midra, J. Yeo, and A. Agarwala, “Energy-Efficient Broadcast and Multicast Trees for Reliable Wireless Communication,” Proc. IEEE Wireless Comm. and Networking Conf., 2003.
[4] F. Bian, A. Goel, C.S. Raghavendra, and X. Li, “Energy-Efficient Broadcasting in Wireless Ad Hoc Networks: Lower Bounds and Algorithms,” J. Interconnection Networks, vol. 3, pp. 149-166, 2002.
[5] M. Cagalj, J.-P. Hubaux, and C. Enz, “Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues,” Proc. MobiCom '02 Conf., 2002.
[6] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized Minimum-Energy Broadcasting in Ad Hoc Networks,” Proc. INFOCOM '03 Conf., 2003.
[7] J.-H. Chang and L. Tassiulas, “Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-Hoc Networks,” Proc. IFIP-TC6/European Commission Int'l Conf., pp. 702-713, 2000.
[8] I. Chlamtac and A. Farago, “A New Approach to the Design and Analysis of Peer-to-Peer Mobile Networks,” Wireless Networks, vol. 5, pp. 149-156, 1999.
[9] A.K. Das, R.J. Marks, M. El-Sharkawi, P. Arabshahi, and A. Gray, “Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations,” Proc. INFOCOM '03 Conf., pp. 1001-1010, 2003.
[10] A. Ephremides, J.E. Wieselthier, and D.J. Baker, “A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling,” Proc. IEEE, vol. 75, pp. 56-58, 1987.
[11] M. Gerharz, C. de Waal, P. Martini, and P. James, “A Cooperative Nearest Neighbours Topology Control Algorithm for Wireless Ad Hoc Networks,” Proc. 12th Int'l Conf. Computer Comm. and Networks, pp. 412-417, 2003.
[12] S. Guha and S. Khuller, “Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets,” Information and Computation, vol. 150, pp. 57-74, 1999.
[13] C.E. Jones, K.M. Sivalingam, P. Agrawal, and J.C. Chen, “A Survey of Energy Efficient Network Protocols for Wireless Networks,” Wireless Networks, vol. 7, pp. 343-358, 2001.
[14] I. Kang and R. Poovendran, “Maximizing Static Network Lifetime of Wireless Broadcast Ad Hoc Networks,” Proc. Implicit Computational Complexity Workshop, 2003.
[15] V. Kawadia and P.R. Kumar, “Power Control and Clustering in Ad Hoc Networks,” Proc. INFOCOM '03 Conf., 2003.
[16] P.N. Klein and R. Ravi, “A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees,” J. Algorithms, vol. 19, pp. 104-114, 1995.
[17] N. Li, J.C. Hou, and L. Sha, “Design and Analysis of an MST-Based Topology Control Algorithm,” Proc. INFOCOM '03 Conf., 2003.
[18] W. Liang, “Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks,” Proc. MOBIHOC '02 Conf., pp. 112-122, 2002.
[19] E.L. Lloyd, R. Liu, M.V. Marathe, R. Ramanathan, and S.S. Ravi, “Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks,” Proc. MOBIHOC '02 Conf., pp. 123-134, 2002.
[20] C. Lund and M. Yannakakis, “On the Hardness of Approximating Minimization Problems,” J. ACM, vol. 41, pp. 960-981, 1994.
[21] R. Ramanathan and R. Rosales-Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. INFOCOM '00 Conf., 2000.
[22] V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” Proc. Implicit Computational Complexity Workshop, vol. 3, pp. 1633-1639, 1998.
[23] A. Srinivas and E. Modiano, “Minimum Energy Disjoint Path Routing in Wireless Ad-Hoc Networks,” Proc. MOBICOM '03 Conf., 2003.
[24] S. Singh, M. Woo, and C.S. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. MOBICOM '98 Conf., pp. 181-190, 1998.
[25] P.-J. Wan, G. Calinescu, and X.-Y. Li, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. INFOCOM '01 Conf., 2001.
[26] R. Wattenhofer, L. Li, P. Bahl, and Y-M Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks,” Proc. INFOCOM '01 Conf., 2001.
[27] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “On Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” Proc. INFOCOM '00 Conf., 2000.
[28] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “Resource Management in Energy-Limited, Bandwidth-Limited, Transceiver-Limited Wireless Networks for Session-Based Multicasting,” Computer Networks, vol. 39, pp. 113-131, 2002.

Index Terms:
Wireless communication network, approximation algorithm, power awareness, ad hoc networks, energy consumption optimization, multicasting, broadcasting, minimum node-weighted Steiner tree problem.
Weifa Liang, "Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 4, pp. 377-387, April 2006, doi:10.1109/TMC.2006.41
Usage of this product signifies your acceptance of the Terms of Use.