### 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 language | English |
---|---|

Pages (from-to) | 463-470 |

Number of pages | 8 |

Journal | Electronic Notes in Discrete Mathematics |

Volume | 36 |

Issue number | C |

DOIs | |

Publication status | Published - Aug 2010 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Applied Mathematics
- Discrete Mathematics and Combinatorics

### Cite this

*Electronic Notes in Discrete Mathematics*,

*36*(C), 463-470. https://doi.org/10.1016/j.endm.2010.05.059

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

Research output: Contribution to journal › Article

*Electronic Notes in Discrete Mathematics*, vol. 36, no. C, pp. 463-470. https://doi.org/10.1016/j.endm.2010.05.059

}

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

AN - SCOPUS:77954911215

VL - 36

SP - 463

EP - 470

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

IS - C

ER -