
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Weifa Liang, "Approximate MinimumEnergy Multicasting in Wireless Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 4, pp. 377387, April, 2006.  
BibTex  x  
@article{ 10.1109/TMC.2006.41, author = {Weifa Liang}, title = {Approximate MinimumEnergy Multicasting in Wireless Ad Hoc Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {5}, number = {4}, issn = {15361233}, year = {2006}, pages = {377387}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2006.41}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Approximate MinimumEnergy Multicasting in Wireless Ad Hoc Networks IS  4 SN  15361233 SP377 EP387 EPD  377387 A1  Weifa Liang, PY  2006 KW  Wireless communication network KW  approximation algorithm KW  power awareness KW  ad hoc networks KW  energy consumption optimization KW  multicasting KW  broadcasting KW  minimum nodeweighted Steiner tree problem. VL  5 JA  IEEE Transactions on Mobile Computing ER   
[1] M. Agarwal, J.H. Cho, L. Gao, and J. Wu, “Energy Efficient Broadcast in Wireless Ad Hoc Networks with HitchHiking,” 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. 5673, 1981.
[3] S. Banerjee, A. Midra, J. Yeo, and A. Agarwala, “EnergyEfficient 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, “EnergyEfficient Broadcasting in Wireless Ad Hoc Networks: Lower Bounds and Algorithms,” J. Interconnection Networks, vol. 3, pp. 149166, 2002.
[5] M. Cagalj, J.P. Hubaux, and C. Enz, “MinimumEnergy Broadcast in AllWireless Networks: NPCompleteness and Distribution Issues,” Proc. MobiCom '02 Conf., 2002.
[6] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized MinimumEnergy 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 AdHoc Networks,” Proc. IFIPTC6/European Commission Int'l Conf., pp. 702713, 2000.
[8] I. Chlamtac and A. Farago, “A New Approach to the Design and Analysis of PeertoPeer Mobile Networks,” Wireless Networks, vol. 5, pp. 149156, 1999.
[9] A.K. Das, R.J. Marks, M. ElSharkawi, P. Arabshahi, and A. Gray, “Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations,” Proc. INFOCOM '03 Conf., pp. 10011010, 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. 5658, 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. 412417, 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. 5774, 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. 343358, 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 BestPossible Approximation Algorithm for NodeWeighted Steiner Trees,” J. Algorithms, vol. 19, pp. 104114, 1995.
[17] N. Li, J.C. Hou, and L. Sha, “Design and Analysis of an MSTBased Topology Control Algorithm,” Proc. INFOCOM '03 Conf., 2003.
[18] W. Liang, “Constructing MinimumEnergy Broadcast Trees in Wireless Ad Hoc Networks,” Proc. MOBIHOC '02 Conf., pp. 112122, 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. 123134, 2002.
[20] C. Lund and M. Yannakakis, “On the Hardness of Approximating Minimization Problems,” J. ACM, vol. 41, pp. 960981, 1994.
[21] R. Ramanathan and R. RosalesHain, “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. 16331639, 1998.
[23] A. Srinivas and E. Modiano, “Minimum Energy Disjoint Path Routing in Wireless AdHoc Networks,” Proc. MOBICOM '03 Conf., 2003.
[24] S. Singh, M. Woo, and C.S. Raghavendra, “PowerAware Routing in Mobile Ad Hoc Networks,” Proc. MOBICOM '98 Conf., pp. 181190, 1998.
[25] P.J. Wan, G. Calinescu, and X.Y. Li, “MinimumEnergy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. INFOCOM '01 Conf., 2001.
[26] R. Wattenhofer, L. Li, P. Bahl, and YM 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 EnergyEfficient 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 EnergyLimited, BandwidthLimited, TransceiverLimited Wireless Networks for SessionBased Multicasting,” Computer Networks, vol. 39, pp. 113131, 2002.