This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Maximum Lifetime Broadcasting in Wireless Networks
September 2005 (vol. 54 no. 9)
pp. 1081-1090
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e \log e) algorithm to construct a broadcast tree that maximizes the critical energy of the network following the broadcast is developed. Additionally, we propose two new greedy heuristics to construct minimum energy broadcast trees. We show how our maximum critical energy algorithm may be coupled with our proposed greedy heuristics as well as with the greedy heuristics proposed in [27], [28] for the construction of minimum energy broadcast trees. Extensive simulations performed by us show that this coupling improves network lifetime significantly (between 48.3 percent and 328.9 percent) when compared with network lifetime using the base greedy heuristics in isolation.

[1] S. Banerjee and A. Misra, “Energy Efficient Reliable Communication for Multi-Hop Wireless Networks,” ACM Baltzer Wireless Networks (WINET), 2001.
[2] I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos, “New Results for Energy-Efficient Broadcasting in Wireless Networks,” Proc. 13th Ann. Int'l Symp. Algorithms and Computation, 2002.
[3] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized Minimum-Energy Broadcasting in Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2003.
[4] J. Chang and L. Tassiulas, “Routing for Maximum System Lifetime in Wireless Ad-Hoc Networks,” Proc. 37th Ann. Allerton Conf. Comm., Control, and Computing, Sept. 1999.
[5] J. Chang and L. Tassiluas, “Energy Conserving Routing in Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2000.
[6] J. Chang and L. Tassiulas, “Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-Hoc Networks,” Proc. IFIP-TC6 Networking 2000, pp. 702-713, 2000.
[7] A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, “A Worst Case Analysis of an MST-Based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks,” Technical Report 010, Univ. of Rome, 2001.
[8] A.K. Das, R.J. Marks, and M. El-Sharkawi, “Minimum Power Broadcast Trees for Wireless Networks,” Proc. IEEE Int'l Symp. Circuits and Systems, May 2002.
[9] S. Doshi and T. Brown, “Minimum Energy Routing Schemes for a Wireless Ad Hoc Network,” Proc. IEEE INFOCOM, 2002.
[10] O. Egecioglu and T. Gonzalez, “Minimum-Energy Broadcast in Simple Graph with Limited Node Power,” Proc. IASTED Int'l Conf. Parallel and Distributed Computing and Systems, pp. 334-338, Aug. 2001.
[11] M. Garey and D. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
[12] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Proc. Fourth Ann. European Symp. Algorithms, 1996.
[13] R. Kannan, L. Ray, R. Kalidindi, and S. Iyengar, “Energy Threshold Constrained Geographic Routing Protocol for Wireless Sensor Networks,” Signal Processing Letters, vol. 1, no. 1, pp. 79-84, 2003.
[14] R. Kannan and S. Iyengar, “Game Theoretic Models for Reliable Path-Length and Energy Constrained Routing with Data Aggregation in Wireless Sensor Networks,” IEEE J. Selected Areas in Comm, 2004.
[15] G. Lin and G. Noubir, “Energy Efficient Broadcast with Sectored Antennas in Wireless Ad Hoc Networks,” IASTED/IEEE Wireless and Optical Comm., July 2002.
[16] M. Maleki, K. Dantu, and M. Pedram, “Power-Aware Source Routing Protocol for Mobile Ad Hoc Networks,” Proc. Int'l Symp. Low Power Electronic and Design (SLPED '02), 2002.
[17] A. Misra and S. Banerjee, “MRPC: Maximizing Network Lifetime for Reliable Routing in Wireless,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), 2002.
[18] T. Rappaport, Wireless Communications: Principles and Practices. Prentice Hall, 1996.
[19] R. Ramanathan and R. Rosales, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. IEEE INFOCOM, 2000.
[20] S. Sahni, Data Structures, Algorithms, and Applications in Java. New York: McGraw-Hill, 2000.
[21] S. Singh, C. Raghavendra, and J. Stepanek, “Power-Aware Broadcasting in Mobile Ad Hoc Networks,” Proc. IEEE Int'l Symp. Person, Indoor, and Mobile Radio Comm. (PIMRC '99), Sept. 1999.
[22] S. Singh, M. Woo, and D.B. Johnson, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. ACM/IEEE MOBICOM, 1998.
[23] A. Spyropoulos and C. Raghavendra, “Energy Efficient Communications in Ad Hoc Networks Using Directional Antenna,” Proc. IEEE INFOCOM, 2002.
[24] I. Stojmenovic and X. Lin, “Power-Aware Localized Routing in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, 2000.
[25] C.K. Toh, “Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks,” IEEE Comm. Magazine, pp. 138-147, June 2001.
[26] P. Wan, G. Calinescu, X. Li, and O. Frieder, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM, 2001.
[27] J. Wieselthier, G. Nguyen, and A. Ephremides, “On the Construction of Energy-Efficient Broadcasting and Multicast Trees in Wireless Networks,” Proc. IEEE INFOCOM, 2000.
[28] J. Wieselthier and G. Nguyen, “Algorithm for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks,” Mobile Networks and Applications, pp. 251-261, 2001.
[29] J. Wieselthier, G. Nguyen, and A. Ephremides, “Resource-Limited Energy-Efficient Wireless Multicast of Session Traffic,” Proc. 34th Ann. Hawaii Int'l Conf. System Sciences, vol. 9, Jan. 2001.
[30] G. Zussman and A. Segall, “Energy Efficient Routing in Ad Hoc Disaster Recovery Networks,” Proc. IEEE INFOCOM, 2003.

Index Terms:
Index Terms- Wireless networks, minimum energy broadcast trees, network lifetime.
Citation:
Joongseok Park, Sartaj Sahni, "Maximum Lifetime Broadcasting in Wireless Networks," IEEE Transactions on Computers, vol. 54, no. 9, pp. 1081-1090, Sept. 2005, doi:10.1109/TC.2005.148
Usage of this product signifies your acceptance of the Terms of Use.