The Community for Technology Leaders
Green Image
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 (\alpha, \beta){\hbox{-}}{\rm 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.
Wireless networks, routing protocols, network management, distributed applications, algorithm design and analysis.

Y. Li, M. T. Thai, D. Du and F. Wang, "On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay," in IEEE Transactions on Mobile Computing, vol. 5, no. , pp. 1460-1470, 2006.
96 ms
(Ver 3.3 (11022016))