Nested Partitioning for the Minimum Energy Broadcast Problem

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.

• Type: Conference
• Year: 2007
• Where: LION
• Authors: Sameh Al-Shihabi, Peter Merz, Steffen Wolf
• Keywords: Broadcast Scheme, LION 2007, Minimum Power Consumption, Wireless Ad-hoc Network