Computing optimal or near-optimal trees for minimum-energy in wireless networks

Abstract

We study minimum-energy broadcast routing in all-wireless networks. Up to now, a number of heuristics have been proposed for this NP-hard problem. Among them, the broadcast incremental power (BIP) algorithm, presented by Wieselthier et al., is most known. The contribution of our work consists of a refinement of the BIP algorithm and a novel integer programming formulation. The refined version of BIP is a natural extension of the original algorithm. The integer programming formulation allows us to compute optimal broadcast trees for networks of small size. For large-sized networks, the formulation admits the computation of a sharp lower bound to the optimal tree. We are thus able to efficiently assess the numerical performance of any heuristic algorithm for the problem. In our computational study, we compare the performance of our refined BlP algorithm to that of its original version, and examine the numerical performance of the two algorithms in terms of optimality using our integer programming model.