|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Deying Li, Xiaohua Jia, Hai Liu, "Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks," IEEE Transactions on Mobile Computing, vol. 3, no. 2, pp. 144-151, April, 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/TMC.2004.10, author = {Deying Li and Xiaohua Jia and Hai Liu}, title = {Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {3}, number = {2}, issn = {1536-1233}, year = {2004}, pages = {144-151}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2004.10}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Mobile Computing TI - Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks IS - 2 SN - 1536-1233 SP144 EP151 EPD - 144-151 A1 - Deying Li, A1 - Xiaohua Jia, A1 - Hai Liu, PY - 2004 KW - Ad hoc wireless networks KW - energy efficient KW - broadcast routing KW - heuristic algorithm. VL - 3 JA - IEEE Transactions on Mobile Computing ER - | |||
Abstract—In this paper, we discuss energy efficient broadcast in ad hoc wireless networks. The problem of our concern is: Given an ad hoc wireless network, find a broadcast tree such that the energy cost of the broadcast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove that the problem is NP-hard and propose three heuristic algorithms, namely, shortest path tree heuristic, greedy heuristic, and node weighted Steiner tree-based heuristic, which are centralized algorithms. The approximation ratio of the node weighted Steiner tree-based heuristic is proven to be
[1] V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1333-1344, Aug. 1999.
[2] R. Ramanathan and R. Rosales-Hain, Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM), pp. 404-413, Mar. 2000.
[3] 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 2001, Apr. 2001.
[4] S. Singh, C.S. Raghavendra, and J. Stepanek, Power-Aware Broadcasting in Mobile Ad Hoc Networks Proc. IEEE 10th Int'l Symp. Personal Indoor and Mobile Radio Comm., Sept. 1999.
[5] W. Lou and J. Wu, Efficient Broadcast with Forward Node Set in Clustered Mobile Ad Hoc Networks Proc. IEEE 11th Conf. Computer Comm. and Networks, pp. 398-403, Oct. 2002.
[6] J. Wu, Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links IEEE Trans. Parallel and Distributed Systems, vol. 13, pp. 866-881, 2002.
[7] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, Algorithm for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks Mobile Networks and Applications, vol. 6, pp. 251-263, 2001.
[8] J. Wieselthier, G. Nguyen, and A. Ephremides, "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks," Proc. IEEE Infocom 2000, IEEE Press, 2000, pp. 585-594.
[9] 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.
[10] P.-J. Wan, G. Calinescu, X. Li, and O. Frieder, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM 2001, 2001.
[11] M.X. Cheng, J. Sun, M. Min, and D.-Z. Du, Energy Efficient Broadcast and Multicast Routing in Ad Hoc Wireless Networks Proc. 22nd IEEE Int'l Performance, Computing, and Comm. Conf., 2003.
[12] O. Egecioglu and T.F. Gonzalez, Minimum-Energy Broadcast in Simple Graphs with Limited Node Power Proc. IASED Int'l Conf. Parallel and Distributed Computing and Systems (PDCS '01), pp. 334-338, Aug. 2001.
[13] M. Cagalj, J.P. Hubaux, and C. Enz, Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues Proc. MOBICOM '02, 2002.
[14] W. Liang, Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks Proc. MOBIHOC '02, 2002.
[15] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman, 1979.
[16] M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, Approximation Algorithms for Directed Steiner Problems Proc. Ninth Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 192-200, 1998.
[17] L. Zosin and S. Khuller, On Directed Steiner Trees Proc. 13th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 59-63, 2002.
[18] V. Chvatal, A Greedy Heuristic for the Set-Covering Problem Math. Operations Research, vol. 4, no. 3, pp. 233-235, 1979.
[19] P. Klein and R. Ravi, A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees J. Algorithms, vol. 19, pp. 104-115, 1995.
[20] S. Guha and S. Khuller, Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets Information and Computing, vol. 150, pp. 57-74, 1999.