On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
Date of Submission:
December 13, 2004
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.