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
AN - SCOPUS:79956156934
SN - 0926-6003
VL - 49
SP - 193
EP - 212
JO - Computational Optimization and Applications
JF - Computational Optimization and Applications
IS - 1
ER -