On the construction of a strongly connected broadcast arborescence with bounded transmission delay

Yingshu Li, My T. Thai, Feng Wang, Ding Zhu Du

Research output: Contribution to journalArticle

24 Scopus citations

Abstract

Energy conservation is an important concern in wireless networks. Many algorithms for constructing a broadcast tree with minimum energy consumption and other goals have been developed. However, no previous research work considers the total energy consumption and transmission delays of the broadcast tree simultaneously. In this paper, based on an (α, β)-tree, a novel concept to wireless networks, we define a new Strongly connected Broadcast Arborescence with bounded Transmission delay (SBAT) problem and design the Strongly connected Broadcast Arborescence (SBA) algorithm with linear running time to construct a strongly connected broadcast tree with bounded total power, while satisfying the constraint that the transmission delays between the source and the other hosts are also bounded. We also propose the distributed version of the SBA algorithm. The theoretical analysis and simulation results show that the SBA algorithm gives a proper solution to the SBAT problem.

Original languageEnglish (US)
Article number1683793
Pages (from-to)1460-1470
Number of pages11
JournalIEEE Transactions on Mobile Computing
Volume5
Issue number10
DOIs
StatePublished - Oct 1 2006
Externally publishedYes

Keywords

  • Algorithm design and analysis
  • Distributed applications
  • Network management
  • Routing protocols
  • Wireless networks

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'On the construction of a strongly connected broadcast arborescence with bounded transmission delay'. Together they form a unique fingerprint.

  • Cite this