Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
An optimal distributed depth-first-search algorithm
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Introduction to Algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Optimal topology control for balanced energy consumption in wireless networks
Journal of Parallel and Distributed Computing
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Trade-off scheme for fault tolerant connected dominating sets on size and diameter
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Robustness of minimum cost arborescences
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The root location problem for arc-disjoint arborescences
Discrete Applied Mathematics
Practical unicast and convergecast scheduling schemes for cognitive radio networks
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
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.