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 Citations (Scopus)

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 2006
Externally publishedYes

Fingerprint

Wireless networks
Energy utilization
Energy conservation

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Science(all)

Cite this

On the construction of a strongly connected broadcast arborescence with bounded transmission delay. / Li, Yingshu; Thai, My T.; Wang, Feng; Du, Ding Zhu.

In: IEEE Transactions on Mobile Computing, Vol. 5, No. 10, 1683793, 10.2006, p. 1460-1470.

Research output: Contribution to journalArticle

@article{61189a26a3754496937374ff8b6c30e2,
title = "On the construction of a strongly connected broadcast arborescence with bounded transmission delay",
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.",
keywords = "Algorithm design and analysis, Distributed applications, Network management, Routing protocols, Wireless networks",
author = "Yingshu Li and Thai, {My T.} and Feng Wang and Du, {Ding Zhu}",
year = "2006",
month = "10",
doi = "10.1109/TMC.2006.154",
language = "English (US)",
volume = "5",
pages = "1460--1470",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

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

AU - Li, Yingshu

AU - Thai, My T.

AU - Wang, Feng

AU - Du, Ding Zhu

PY - 2006/10

Y1 - 2006/10

N2 - 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.

AB - 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.

KW - Algorithm design and analysis

KW - Distributed applications

KW - Network management

KW - Routing protocols

KW - Wireless networks

UR - http://www.scopus.com/inward/record.url?scp=33748369347&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748369347&partnerID=8YFLogxK

U2 - 10.1109/TMC.2006.154

DO - 10.1109/TMC.2006.154

M3 - Article

VL - 5

SP - 1460

EP - 1470

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 10

M1 - 1683793

ER -