New parallel randomized algorithms for the traveling salesman problem
Computers and Operations Research - Special issue on the traveling salesman problem
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Nested Partitions Method for Global Optimization
Operations Research
An Optimization Framework for Product Design
Management Science
Iterated Local Optimization for Minimum Energy Broadcast
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A Distributed Range Assignment Protocol
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Computers & Mathematics with Applications
Hi-index | 0.00 |
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem by combining Nested Partitioning with Local Search and Linear Programming. The algorithm is benchmarked by solving instances with 20 and 50 nodes where results are compared to either optimum or best results found by an IP solver. In these instances, the proposed algorithm was able to find optimal and near optimal solutions.