Some valid inequalities for the probabilistic minimum power multicasting problem

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

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper we describe some results on the linear integer programming formulation of the Probabilistic Minimum Power Multicast (PMPM) problem for wireless networks. The PMPM problem consists in optimally assigning transmission powers to the nodes of a given network in order to establish a multihop connection between a source node and a set of destination nodes. The nodes are subject to failure with some probability, however the assignment should be made so that the reliability of the connection is above a given threshold level. This model reflects the necessity of taking into account the uncertainty of hosts' availability in a telecommunication network.

Original languageEnglish
Pages (from-to)463-470
Number of pages8
JournalElectronic Notes in Discrete Mathematics
Volume36
Issue numberC
DOIs
Publication statusPublished - Aug 2010

Fingerprint

Multicasting
Valid Inequalities
Integer programming
Power transmission
Telecommunication networks
Wireless networks
Availability
Vertex of a graph
Multicast
Telecommunication Network
Integer Linear Programming
Multi-hop
Wireless Networks
Assignment
Uncertainty
Formulation

Keywords

  • Integer Programming
  • Minimum Power Multicasting
  • Multihop Networks
  • Probabilistic Mathematical Models

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Some valid inequalities for the probabilistic minimum power multicasting problem. / Barta, János; Leggieri, Valeria; Montemanni, Roberto; Nobili, Paolo; Triki, Chefi.

In: Electronic Notes in Discrete Mathematics, Vol. 36, No. C, 08.2010, p. 463-470.

Research output: Contribution to journalArticle

Barta, János ; Leggieri, Valeria ; Montemanni, Roberto ; Nobili, Paolo ; Triki, Chefi. / Some valid inequalities for the probabilistic minimum power multicasting problem. In: Electronic Notes in Discrete Mathematics. 2010 ; Vol. 36, No. C. pp. 463-470.
@article{6f5eb946a8c346b39740389053ab8c03,
title = "Some valid inequalities for the probabilistic minimum power multicasting problem",
abstract = "In this paper we describe some results on the linear integer programming formulation of the Probabilistic Minimum Power Multicast (PMPM) problem for wireless networks. The PMPM problem consists in optimally assigning transmission powers to the nodes of a given network in order to establish a multihop connection between a source node and a set of destination nodes. The nodes are subject to failure with some probability, however the assignment should be made so that the reliability of the connection is above a given threshold level. This model reflects the necessity of taking into account the uncertainty of hosts' availability in a telecommunication network.",
keywords = "Integer Programming, 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 = "2010",
month = "8",
doi = "10.1016/j.endm.2010.05.059",
language = "English",
volume = "36",
pages = "463--470",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Some valid inequalities for the probabilistic minimum power multicasting problem

AU - Barta, János

AU - Leggieri, Valeria

AU - Montemanni, Roberto

AU - Nobili, Paolo

AU - Triki, Chefi

PY - 2010/8

Y1 - 2010/8

N2 - In this paper we describe some results on the linear integer programming formulation of the Probabilistic Minimum Power Multicast (PMPM) problem for wireless networks. The PMPM problem consists in optimally assigning transmission powers to the nodes of a given network in order to establish a multihop connection between a source node and a set of destination nodes. The nodes are subject to failure with some probability, however the assignment should be made so that the reliability of the connection is above a given threshold level. This model reflects the necessity of taking into account the uncertainty of hosts' availability in a telecommunication network.

AB - In this paper we describe some results on the linear integer programming formulation of the Probabilistic Minimum Power Multicast (PMPM) problem for wireless networks. The PMPM problem consists in optimally assigning transmission powers to the nodes of a given network in order to establish a multihop connection between a source node and a set of destination nodes. The nodes are subject to failure with some probability, however the assignment should be made so that the reliability of the connection is above a given threshold level. This model reflects the necessity of taking into account the uncertainty of hosts' availability in a telecommunication network.

KW - Integer Programming

KW - Minimum Power Multicasting

KW - Multihop Networks

KW - Probabilistic Mathematical Models

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

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

U2 - 10.1016/j.endm.2010.05.059

DO - 10.1016/j.endm.2010.05.059

M3 - Article

VL - 36

SP - 463

EP - 470

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

IS - C

ER -