Multicast routing with minimum energy cost in ad hoc wireless networks

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with host publication)peer-review

9 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages2897-2901
Volume5
Publication statusPublished - 2004

Publication series

Name
Volume5

Conference

TitleGLOBECOM'04 - IEEE Global Telecommunications Conference
PlaceUnited States
CityDallas, TX
Period29 November - 3 December 2004

Abstract

In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. The problem of our concern is: given an ad hoc wireless network and a multicast request, to find a multicast tree such that the total energy cost of the multicast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove the problem is NP-hard, and then propose three heuristic algorithms, namely Steiner tree based heuristic, Node-Join-Tree and Tree-Join-Tree greedy algorithms. Extensive simulations have been conducted and the results have demonstrated the efficiency of the proposed algorithms. © 2004 IEEE.

Citation Format(s)

Multicast routing with minimum energy cost in ad hoc wireless networks. / Jia, Xiaohua; Li, Deying; Hung, Frankie.
GLOBECOM - IEEE Global Telecommunications Conference. Vol. 5 2004. p. 2897-2901 WC10-3.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with host publication)peer-review