Algorithms for two bottleneck optimization problems
Journal of Algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
Multicast time maximization in energy constrained wireless networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Minimum-power multicast routing in static ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Energy-aware broadcast trees in wireless networks
Mobile Networks and Applications
A linear-time optimal-message distributed algorithm for minimum spanning trees
Distributed Computing
Approximating Optimal Multicast Trees in Wireless Multihop Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Approximation algorithms for longest-lived directional multicast communications in WANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Hi-index | 0.00 |
We consider the problem of finding a multicast tree rooted at the source node and including all the destination nodes such that the maximum weight of the tree arcs is minimized. It is of paramount importance for many optimization problems, e.g., the maximum-lifetime multicast problem in multihop wireless networks, in the data networking community. We explore some important properties of this problem from a graph theory perspective and obtain a min-max-tree max-min-cut theorem, which provides a unified explanation for some important while separated results in the recent literature. We also apply the theorem to derive an algorithm that can construct a global optimal min-max multicast tree in a distributed fashion. In random networks with n nodes and m arcs, our theoretical analysis shows that the expected communication complexity of our distributed algorithm is in the order of O(m). Specifically, the average number of messages is 2(n-1-γ)-2 ln (n-1) + m at most, in which γ is the Euler constant. To our best knowledge, this is the first contribution that possesses the distributed and scalable properties for the min-max multicast problem and is especially desirable to the large-scale resource-limited multihop wireless networks, like sensor networks.