ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 30, Issue 18, 10 December 2007, Pages 3746-3756
Optical Networking: Systems and Protocols
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (313 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comcom.2007.09.003    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Energy efficient multicast routing in ad hoc wireless networks

Deying Lia, b, Qin Liuc, Xiaodong Hud and Xiaohua Jiab, Corresponding Author Contact Information, E-mail The Corresponding Author

aSchool of Information, Remin University of China, Beijing, China bDepartment of Computer Science, City University of Hong Kong, Hong Kong cSchool of Computing, Wuhan University, Hubei Province, China dInstitute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China

Received 2 February 2007; 
revised 29 July 2007; 
accepted 5 September 2007. 
Available online 14 September 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. Each node in the network is assumed to have a fixed level of transmission power. The problem of our concern is: given an ad hoc wireless network and a multicast request, how to find a multicast tree such that the total energy cost of the multicast tree is minimized. We first prove this problem is NP-hard and it is unlikely to have an approximation algorithm with a constant performance ratio of the number of nodes in the network. We then propose an algorithm based on the directed Steiner tree method that has a theoretically guaranteed approximation performance ratio. We also propose two efficient heuristics, node-join-tree (NJT) and tree-join-tree (TJT) algorithms. The NJT algorithm can be easily implemented in a distributed fashion. Extensive simulations have been conducted to compare with other methods and the results have shown significant improvement on energy efficiency of the proposed algorithms.

Keywords: Ad hoc wireless network; Energy efficiency; Multicast routing

Article Outline

1. Introduction
2. Related work and our contributions
3. Network model and problem specification
4. Complexity analysis
5. Algorithms
5.1. Steiner tree based algorithm
5.2. Node-join-tree (NJT) algorithm
5.3. Tree-join-tree (TJT) algorithm
6. Simulations
7. Conclusion
Acknowledgements
References
Vitae











Computer Communications
Volume 30, Issue 18, 10 December 2007, Pages 3746-3756
Optical Networking: Systems and Protocols
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.