On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
2004-12-13
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
Authors
Published Date
2004-12-13
Publisher
Type
Report
Abstract
Energy conservation is an important concern in wireless networks. Many scenarios 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 (alpha, beta)-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) construction algorithm with linear running time to construct a strongly connected broadcast tree with bounded cost, i.e., total energy, while satisfying the constraint that the transmission delay between the source and 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
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Li, Yingshu; Thai, My T.; Wang, Feng; Du, Ding-Zhu. (2004). On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215640.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.