Minimum power multicasting in wireless networks under probabilistic node failures

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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
Volume49
Issue number1
DOIs
Publication statusPublished - May 2011

Fingerprint

Multicasting
Power transmission
Wireless Networks
Wireless networks
Multicast
Heuristic methods
Vertex of a graph
Linear programming
Availability
Column Generation
Failure Probability
Integer Linear Programming
Heuristic Method
Multi-hop
Exact Algorithms
Computational Experiments
Experiments
Uncertainty
Formulation

Keywords

  • Minimum power multicasting
  • Multihop networks
  • Probabilistic mathematical models

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics
  • Control and Optimization

Cite this

Minimum power multicasting in wireless networks under probabilistic node failures. / Barta, János; Leggieri, Valeria; Montemanni, Roberto; Nobili, Paolo; Triki, Chefi.

In: Computational Optimization and Applications, Vol. 49, No. 1, 05.2011, p. 193-212.

Research output: Contribution to journalArticle

Barta, János ; Leggieri, Valeria ; Montemanni, Roberto ; Nobili, Paolo ; Triki, Chefi. / Minimum power multicasting in wireless networks under probabilistic node failures. In: Computational Optimization and Applications. 2011 ; Vol. 49, No. 1. pp. 193-212.
@article{16336c3a71ba4b058234196d110aff80,
title = "Minimum power multicasting in wireless networks under probabilistic node failures",
abstract = "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.",
keywords = "Minimum power multicasting, Multihop networks, Probabilistic mathematical models",
author = "J{\'a}nos Barta and Valeria Leggieri and Roberto Montemanni and Paolo Nobili and Chefi Triki",
year = "2011",
month = "5",
doi = "10.1007/s10589-009-9281-2",
language = "English",
volume = "49",
pages = "193--212",
journal = "Computational Optimization and Applications",
issn = "0926-6003",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Minimum power multicasting in wireless networks under probabilistic node failures

AU - Barta, János

AU - Leggieri, Valeria

AU - Montemanni, Roberto

AU - Nobili, Paolo

AU - Triki, Chefi

PY - 2011/5

Y1 - 2011/5

N2 - 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.

AB - 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.

KW - Minimum power multicasting

KW - Multihop networks

KW - Probabilistic mathematical models

UR - http://www.scopus.com/inward/record.url?scp=79956156934&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79956156934&partnerID=8YFLogxK

U2 - 10.1007/s10589-009-9281-2

DO - 10.1007/s10589-009-9281-2

M3 - Article

VL - 49

SP - 193

EP - 212

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

SN - 0926-6003

IS - 1

ER -