Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms

  • Authors:

  • Di Yuan;Joanna Bauer;Dag Haugland

  • Affiliations:

  • Department of Science and Technology, Linköping University, SE-601 74 Norrköping, Sweden;Department of Informatics, University of Bergen, P.O. Box 7800, N-5020 Bergen, Norway;Department of Informatics, University of Bergen, P.O. Box 7800, N-5020 Bergen, Norway

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Both integer programming models and heuristic algorithms have been proposed for finding minimum-energy broadcast and multicast trees in wireless ad hoc networks. Among heuristic algorithms, the broadcast/multicast incremental power (BIP/MIP) algorithm is most known. The theoretical performance of BIP/MIP has been quantified in several studies. To assess the empirical performance of BIP/MIP and other heuristic algorithms, it is necessary to compute an optimal tree or a very good lower bound of the optimum. In this paper, we present an integer programming approach as well as improved heuristic algorithms. Our integer programming approach comprises a novel integer model and a relaxation scheme. Unlike previously proposed models, the continuous relaxation of our model leads to a very sharp lower bound of the optimum. Our relaxation scheme allows for performance evaluation of heuristics without having to compute optimal trees. Our contributions to heuristic algorithms consist of the power-improving algorithm successive power adjustment (SPA), and improved time complexity of some previously suggested algorithms. We report extensive numerical experiments. Algorithm SPA finds better solutions in comparison to a host of other algorithms. Moreover, the integer programming approach shows that trees found by algorithm SPA are optimal or near-optimal.