This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks
September 2006 (vol. 5 no. 9)
pp. 1215-1227
In this paper, we present new algorithms for online multicast routing in ad hoc networks where nodes are energy-constrained. The objective is to maximize the total amount of multicast message data routed successfully over the network without any knowledge of future multicast request arrivals and generation rates. Specifically, we first propose an online algorithm for the problem based on an exponential function of energy utilization at each node. The competitive ratio of the proposed algorithm is analyzed if admission control of multicast requests is permitted. We then provide another online algorithm for the problem, which is based on minimizing transmission energy consumption for each multicast request and guaranteeing that the local network lifetime is no less than \gamma times of the optimum, where \gamma is constant with 0 < \gamma\leq 1. We finally conduct extensive experiments by simulations to analyze the performance of the proposed algorithms, in terms of network capacity, network lifetime, and transmission energy consumption for each multicast request. The experimental results clearly indicate that, for online multicast routing in ad hoc wireless networks, the network capacity is proportional to the network lifetime if the transmission energy consumption for each multicast request is at the same time minimized. This is in contrast to the implication by Kar et al. that the network lifetime is proportional to the network capacity when they considered the online unicast routing by devising an algorithm based on the exponential function of energy utilization at each node.

[1] J. Aspnes, Y. Azar, A. Fait, S. Plotkin, and O. Warrts, “Online Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling,” J. ACM, vol. 44, pp. 486-504, 1997.
[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] 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.
[4] 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.
[5] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized Minimum-Energy Broadcasting in Ad Hoc Networks,” Proc. INFOCOM '03 Conf., 2003.
[6] K.M. Chandy and J. Misra, “Distributed Computation on Graphs: Shortest Path Algorithms,” Comm. ACM, vol. 25, pp. 833-837, 1982.
[7] J.-H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad Hoc Networks,” Proc. INFOCOM '00 Conf., 2000.
[8] 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., 2000.
[9] M. Charikar, C. Chekuri, T.-Y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, “Approximation Algorithms for Directed Steiner Problems,” J. Algorithms, vol. 33, no. 1, pp. 73-91, 1999.
[10] 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.
[11] 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.
[12] 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.
[13] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, pp. 547-566, 1998.
[14] P.A. Humblet, “A Distributed Algorithm for Minimum Weight Directed Spanning Trees,” IEEE Trans. Comm., vol. 31, pp. 756-762, 1983.
[15] 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.
[16] I. Kang and R. Poovendran, “Maximizing Static Network Lifetime of Wireless Broadcast Ad Hoc Networks,” Proc. Int'l Conf. Comm. (ICC '03), 2003.
[17] K. Kar, M. Kodialam, T.V. Lakshman, and L. Tassiulas, “Routing for Network Capacity Maximization in Energy-Constrained Ad-Hoc Networks,” Proc. INFOCOM '03 Conf., 2003.
[18] V. Kawadia and P.R. Kumar, “Power Control and Clustering in Ad Hoc Networks,” Proc. INFOCOM '03 Conf., 2003.
[19] Q. Li, J. Aslam, and D. Rus, “Online Power-Aware Routing in Wireless Ad Hoc Networks,” Proc. ACM SIGMobile '01 Conf., pp. 97-107, July 2001.
[20] N. Li, J.C. Hou, and L. Sha, “Design and Analysis of an MST-Based Topology Control Algorithm,” Proc. INFOCOM '03 Conf., 2003.
[21] W. Liang, “Maximizing Network Lifetime and Minimizing Energy Multicasting in Wireless Ad Hoc Networks,” Proc. Int'l Conf. Comm. (ICC '05), May 2005.
[22] W. Liang, “Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, 2005.
[23] W. Liang, “Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks,” Proc. MOBIHOC '02 Conf., pp. 112-122, 2002.
[24] W. Liang and Y. Yang, “Maximizing Battery Life Routing in Wireless Ad Hoc Networks,” Proc. 37th Hawaii Int'l Conf. System Sciences, 2004.
[25] 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.
[26] S. Plotkin, “Competitive Routing of Virtual Circuits in ATM Networks,” IEEE J. Selected Areas in Comm., vol. 13, pp. 1128-1136, 1995.
[27] R. Ramanathan and R. Rosales-Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. INFOCOM '00 Conf., 2000.
[28] V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” Proc. Int'l Conf. Comm. (ICC '98), vol. 3, pp. 1633-1639, 1998.
[29] A. Sankar and Z. Liu, “Maximum Lifetime Routing in Wireless Ad-Hoc Networks,” Proc. INFOCOM '04 Conf., 2004.
[30] S. Singh, M. Woo, and C.S. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. MOBICOM '98 Conf., pp. 181-190, 1998.
[31] A. Srinivas and E. Modiano, “Minimum Energy Disjoint Path Routing in Wireless Ad-Hoc Networks,” Proc. MOBICOM '03 Conf., 2003.
[32] C.-K. Toh, “Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless As Hoc Networks,” IEEE Comm., vol. 39, pp. 138-147, 2001.
[33] P.-J. Wan, G. Calinescu, and X.-Y. Li, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. INFOCOM '01 Conf., 2001.
[34] 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.
[35] 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.
[36] 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.
[37] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” Mobile Networks and Applications, vol. 7, pp. 481-492, 2002.

Index Terms:
Wireless communication network, approximation algorithm, power awareness, ad hoc networks, energy consumption optimization, multicasting, broadcasting, network lifetime.
Citation:
Weifa Liang, Xiaoxing Guo, "Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 9, pp. 1215-1227, Sept. 2006, doi:10.1109/TMC.2006.133
Usage of this product signifies your acceptance of the Terms of Use.