Skip to Main Content
We study the minimum range assignment problem that consists in finding the range assignment that minimizes energy consumption in the network. We exhibit one bad behavior of classical graph reduction-based approaches: they only consider the sum of edges' weight as an optimization criterion. We then design a new graph reduction algorithm (the minimum power tree protocol) and its associated topology control algorithm (the incremental power topology control protocol). After proposing a local version of the protocol, we evaluate and compare their performance of these two protocols to the studied classical reduction-based approaches.