Two new algorithms for the min-power broadcast problem in static ad hoc networks (Q2383911): Difference between revisions

In this paper, the authors address the min-power broadcast problem in wireless ad hoc networks, which have become an increasingly common and important phenomenon due to their potential applications in battlefield and disaster relief communication. The min-power broadcast problem consists in assigning a transmission range to each node such that communication from a specified source node to other node is possible and the total energy consumption is minimized. The authors propose and evaluate a new simulated annealing approach for the min-power broadcast problem. The main characteristic of the algorithm is to avoid extra search in the state space. They combined the algorithm with divide and conquer techniques to enhance its efficiency. Finally, a comprehensive computational study is presented. This indicates the efficiency and effectiveness of the proposed algorithm.