A Localized Algorithm for Minimum-Energy Broadcasting Problem in MANET

摘要

In Mobile Ad Hoc Networks the energy conservation problem is a very critical issue since in most cases the nodes are battery-operated. While the energy efficiency can be achieved by routing along the path that requires the lowest total energy consumption and can be solved in polynomial time for unicast communication, it was proved to be NP-complete for the construction of a Minimum-Energy Spanning Tree if the antenna is not unidirectional. Some heuristic solutions have been proposed for this problem, in this paper we present a novel distributed algorithm which effectively exploits the wireless multicast advantage. The analysis results also show that our scheme is economic for energy consumption, and efficient for time and communication complexity.