Minimum Energy-Cost Broadcast Routingeying in Ad Hoc Wireless Networks

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

1 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages367-371
Volume1
Publication statusPublished - 2003

Publication series

Name
Volume1

Conference

TitleIEEE Global Telecommunications Conference GLOBECOM'03
PlaceUnited States
CitySan Francisco, CA
Period1 - 5 December 2003

Abstract

In this paper, we discuss energy efficient broadcast in ad hoc wireless networks. The problem of our concern is: given an ad hoc wireless network, to find a broadcast tree such that the energy cost of the broadcast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove that the problem is NP-hard, and propose three heuristic algorithms, namely shortest path tree heuristic, greedy heuristic and node weighted Steiner tree based heuristic. The approximation ratio of the set-cover based heuristic is proved to be (1+2ln(n-1)). Extensive simulations have been conducted and the results have demonstrated the efficiency of the proposed algorithms.

Citation Format(s)

Minimum Energy-Cost Broadcast Routingeying in Ad Hoc Wireless Networks. / Li, Deying; Liu, Hai; Jia, Xiaohua.

GLOBECOM - IEEE Global Telecommunications Conference. Vol. 1 2003. p. 367-371.

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