Minimum power multicasting in wireless networks under probabilistic node failures

János Barta*, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


In this paper we deal with a probabilistic extension of the minimum power multicast (MPM) problem for wireless networks. The deterministic MPM problem consists in assigning transmission powers to the nodes, so that a multihop connection can be established between a source and a given set of destination nodes and the total power required is minimized. We present an extension to the basic problem, where node failure probabilities for the transmission are explicitly considered. This model reflects the necessity of taking uncertainty into account in the availability of the hosts. The novelty of the probabilistic minimum power multicast (PMPM) problem treated in this paper consists in the minimization of the assigned transmission powers, imposing at the same time a global reliability level to the solution network. An integer linear programming formulation for the PMPM problem is presented. Furthermore, an exact algorithm based on an iterative row and column generation procedure, as well as a heuristic method are proposed. Computational experiments are finally presented.

Original languageEnglish
Pages (from-to)193-212
Number of pages20
JournalComputational Optimization and Applications
Issue number1
Publication statusPublished - May 2011
Externally publishedYes


  • Minimum power multicasting
  • Multihop networks
  • Probabilistic mathematical models

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Minimum power multicasting in wireless networks under probabilistic node failures'. Together they form a unique fingerprint.

Cite this