Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Minimum-power multicast routing in static ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Computing Optimal or Near-Optimal Trees for Minimum-Energy Broadcasting in Wireless Networks
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
| Hi-index | 0.00 |
In this paper, we present a lookahead expansion algorithm (named as Shrinking and Lookahead Expansion, SLE for short) for minimum power multicast tree problem in wireless ad hoc networks. SLE adopts the powerful shrinking process from our previous work, SOR (Shrinking Overlapped Range) algorithm, and adds an intelligent lookahead process to further improve the solution quality. The lookahead process (called as lookahead expansion) expands the intermediate tree to a feasible tree by adding transmissions with minimum power, one by one. The algorithm maintains the found feasible tree with the minimum power sum in addition to the intermediate tree which is not feasible until the end. This lookahead process generates the effective diversification of the solution search space. The computational results strongly support the solid and outstanding performance of SLE owing to the lookahead process.