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.

Autore Pugliese

• Triki Chefi , Nobili Paolo

Tutti gli autori

• J. Barta , V. Leggieri , R. Montemanni , P. Nobili , C. Triki

Titolo volume/Rivista

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS

Anno di pubblicazione

2011

ISSN

0926-6003

ISBN

Non Disponibile

Numero di citazioni Wos

1

Ultimo Aggiornamento Citazioni

28/04/2018

Numero di citazioni Scopus

1

Ultimo Aggiornamento Citazioni

28/04/2018

Settori ERC

Non Disponibile

Codici ASJC

Non Disponibile