MIP3S: Algorithms for power-conserving multicasting in static wireless ad hoc networks

IEEE International Conference on Networks, ICON

Volumn , Issue , 2003, Pages 143-148

  Mavinkurve, Purnima M ^a   Ngo, Hung O ^a   Mehra, Himanshu ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

Multicasting; Power aware routing; Wireless ad hoc networks

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; NETWORK TOPOLOGY; POWER MANAGEMENT (TELECOMMUNICATION); ROUTING ALGORITHMS;

AD HOC WIRELESS NETWORKS; GROUP MEMBERS; MINIMUM ENERGY MULTICAST PROBLEMS; MULTICAST GROUP MEMBERS; POWER; POWER ASSIGNMENT; POWER LEVELS; POWER-AWARE ROUTING; SOURCE NODES; WIRELESS AD-HOC NETWORKS;

MULTICASTING;

EID: 84856250337     PISSN: 15566463     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icon.2003.1266181     Document Type: Conference Paper

References (21)

1. Anthony Ephremides, "Energy concerns in wireless networks," IEEE Wireless Communications, vol. 9, no. 4, pp. 48-59, Aug 2002.
2. Charles E. Perkins, Ad Hoc Networking, Pearson Education, New Jersey, USA, Dec 2000.
3. P.-J Wan, G. Calinescu, X.-Y. Li, and O. Frieder, "Minimum-energy broadcast routing in static ad hoc wireless networks," in Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 2001, vol. 2, pp. 1162-1171, IEEE.
4. Jeffrey E. Wieselthier, Gam D. Nguyen, and Anthony Ephremides, "Algorithms for energy-efficient multicasting in static ad hoc wireless networks," Mobile Networks and Applications, vol. 6, no. 3, pp. 251-263, 2001.
5. Jeffrey E. Wieselthier, Gam D. Nguyen, and Anthony Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 2000, vol. 2, pp. 585-594, IEEE.
6. Jeffrey E. Wieselthier, Gam D. Nguyen, and Anthony Ephremides, "Multicasting in energy-limited ad-hoc wireless networks," in Proceedings - IEEE Military Communications Conference MILCOM. 1998, vol. 3, pp. 723-729, IEEE.
7. Jeffrey E. Wieselthier, Gam D. Nguyen, and Anthony Ephremides, "Energy-efficient multicasting of session traffic in bandwidth- and transceiver-limited wireless networks," Cluster Computing, vol. 5, no. 2, pp. 179-192, 2002
8. Jeffrey E. Wieselthier, Gam D. Nguyen, and Anthony Ephremides, "The effect of discrete power levels on energy-efficient wireless broadcast in ad hoc networks," in Proceedings of the 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. 2002, vol. 4, pp. 1655-1659, IEEE.
9. Weifa Liang, "Constructing minimum-energy broadcast trees in wireless ad hoc networks," in Proceedings of the third ACM international symposium on Mobile ad hoc networking & computing (MOBIHOC), Lausanne, Switzerland, 2002, pp. 112-122, ACM Press.
10. Mario Cagalj, Jean-Pierre Hubaux, and Christian Enz, "Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues," in Proceedings of the 8th annual international conference on Mobile computing and networking (MOBICOM), Atlanta, Georgia, USA, 2002, pp. 172-182, ACM Press.
11. P.-J Wan and G. Calinescu, "Minimum-energy multicast in routing in static ad hoc wireless networks," 2001, manuscript.
12. Vikas P. Verma, Amit Chandak, and Hung Q. Ngo, "Distributive routing algorithms for power-conserving broadcasting in wireless ad hoc networks," 2003, submitted.
13. Hung Q. Ngo, Dazhen Pan, and Vikas Verma, "Power-conserving algorithms and protocols in ad hoc networks," in Ad Hoc Networking: Recent Advances, X. Cheng and D.-Z. Du, Eds. Kluwer Academic Publishers, 2003.
14. Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos, "New results for energy-efficient broadcasting in wireless networks," in Proceedings of the 13th International Symposium 2002 on Algorithms and Computation (ISAAC '02), Nov 2002, pp. 332-343, Springer Verlag, Lecture Notes in Computer Science.
15. Theodore Rappaport, Wireles Communications: Principles and Practices, Prentice Hall PTR, New Jersey, USA, second edition, Dec 2001.
16. Douglas B. West, Introduction to graph theory, Prentice Hall Inc., Upper Saddle River, NJ, 1996.
17. Michael R. Garey and David S. Johnson, Computers and intractability, W. H. Freeman and Co., San Francisco, Calif., 1979, A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences.
18. Dorit S. Hochbaum, Ed., Approximation Algorithms for NP Hard Problems, PWS Publishing Company, Boston, MA, 1997.
19. Andrea E. F. Clementi, Pilu Crescenzi, Paolo Penna, Gianluca Rossi, and Paola Vocca, "On the complexity of computing minimum energy consumption broadcast subgraphs," in STACS 2001 (Dresden), vol. 2010 of Lecture Notes in Comput. Sci., pp. 121-131. Springer, Berlin, 2001.
20. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to algorithms, MIT Press, Cambridge, MA, second edition, 2001.
21. Frank K. Hwang, Dana S. Richards, and Pawel Winter, The Steiner tree problem, vol. 53 of Annals of Discrete Mathematics, North-Holland Publishing Co., Amsterdam, 1992.