Skip to main navigation Skip to search Skip to main content

Energy efficient multicast routing in ad hoc wireless networks with discrete levels of transmission power

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. We assume that each node in the network has a set of discrete levels of transmission power and nodes are relatively static. The problem is, given a set of nodes in the Euclidean plane and a multicast request, to construct a multicast tree rooted at the source and including all destinations such that the total energy cost of the transmitting nodes in the tree is minimized. We first prove that this problem is NP-hard and unlikely has an approximation algorithm with a logarithmic performance ratio. We then propose two algorithms, one is based on the Steiner tree method and the other is based on connected dominating set method. Both algorithms have guaranteed performance ratios and outperform the existing method. © 2005 IEEE.
Original languageEnglish
Title of host publication2005 International Conference on Communications, Circuits and Systems - Proceedings
Pages319-323
Volume1
DOIs
Publication statusPublished - 2005
Event2005 International Conference on Communications, Circuits and Systems - Hong Kong, China
Duration: 27 May 2005 → 30 May 2005

Publication series

Name
Volume1

Conference

Conference2005 International Conference on Communications, Circuits and Systems
PlaceChina
CityHong Kong
Period27/05/05 → 30/05/05

Fingerprint

Dive into the research topics of 'Energy efficient multicast routing in ad hoc wireless networks with discrete levels of transmission power'. Together they form a unique fingerprint.

Cite this