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

### Keywords

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

### ASJC Scopus subject areas

- Applied Mathematics
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Some valid inequalities for the probabilistic minimum power multicasting problem'. Together they form a unique fingerprint.

## Cite this

*Electronic Notes in Discrete Mathematics*,

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