Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
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
The Power Range Assignment Problem in Radio Networks on the Plane
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Multilevel Approach to the Travelling Salesman Problem
Operations Research
G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
On Minimum-Energy Broadcasting in All-Wireless Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Chained Lin-Kernighan for Large Traveling Salesman Problems
INFORMS Journal on Computing
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
Tightening the upper bound for the minimum energy broadcasting
Wireless Networks
Ant Colony Optimization for Energy-Efficient Broadcasting in Ad-Hoc Networks
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Nested Partitioning for the Minimum Energy Broadcast Problem
Learning and Intelligent Optimization
Evolutionary local search for the minimum energy broadcast problem
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Survivable network design problems in wireless networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A fast local search method for minimum energy broadcast in wireless ad hoc networks
Operations Research Letters
Computers & Mathematics with Applications
| Hi-index | 0.02 |
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (MEB) problem over wireless ad hoc or sensor networks. In this paper, the performance is further strengthened by using iterated local optimization (ILO) techniques at the cost of additional computational complexity. To the best of our knowledge, this implementation constitutes currently the best performing algorithm among the known heuristics for MEB. We support this claim through extensive simulation study, comparing with globally optimal solutions obtained by an integer programming (IP) solver. For small network size up to 20 nodes, which is imposed by practical limitation of the IP solver, the ILO based algorithm produces globally optimal solutions with very high frequency (70%), and average performance is within 1.12% of the optimal solution.