Minimum power multicasting problem in wireless networks

Valeria Leggieri, Paolo Nobili, Chefi Triki

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

In this paper we deal with the minimum power multicasting (MPM) problem in wireless ad-hoc networks. By using an appropriate choice of the decision variables and by exploiting the topological properties of the problem, we are able to define an original formulation based on a Set Covering model. Moreover, we propose for its solution two exact procedures that include a preprocessing technique that reduces the huge number of the model's constraints. We also report some experimental results carried out on a set of randomly generated test problems.

Original languageEnglish
Pages (from-to)295-311
Number of pages17
JournalMathematical Methods of Operations Research
Volume68
Issue number2
DOIs
Publication statusPublished - Oct 2008

Fingerprint

Multicasting
Wireless Networks
Wireless networks
Set Covering
Wireless Ad Hoc Networks
Wireless ad hoc networks
Topological Properties
Test Problems
Preprocessing
Formulation
Experimental Results
Model
Ad hoc networks

Keywords

  • Multicast problem
  • Set Covering problem

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Mathematics(all)

Cite this

Minimum power multicasting problem in wireless networks. / Leggieri, Valeria; Nobili, Paolo; Triki, Chefi.

In: Mathematical Methods of Operations Research, Vol. 68, No. 2, 10.2008, p. 295-311.

Research output: Contribution to journalArticle

Leggieri, Valeria ; Nobili, Paolo ; Triki, Chefi. / Minimum power multicasting problem in wireless networks. In: Mathematical Methods of Operations Research. 2008 ; Vol. 68, No. 2. pp. 295-311.
@article{460ee468c14f4387a059f386804c14b7,
title = "Minimum power multicasting problem in wireless networks",
abstract = "In this paper we deal with the minimum power multicasting (MPM) problem in wireless ad-hoc networks. By using an appropriate choice of the decision variables and by exploiting the topological properties of the problem, we are able to define an original formulation based on a Set Covering model. Moreover, we propose for its solution two exact procedures that include a preprocessing technique that reduces the huge number of the model's constraints. We also report some experimental results carried out on a set of randomly generated test problems.",
keywords = "Multicast problem, Set Covering problem",
author = "Valeria Leggieri and Paolo Nobili and Chefi Triki",
year = "2008",
month = "10",
doi = "10.1007/s00186-008-0222-0",
language = "English",
volume = "68",
pages = "295--311",
journal = "Mathematical Methods of Operations Research",
issn = "1432-2994",
publisher = "Physica-Verlag",
number = "2",

}

TY - JOUR

T1 - Minimum power multicasting problem in wireless networks

AU - Leggieri, Valeria

AU - Nobili, Paolo

AU - Triki, Chefi

PY - 2008/10

Y1 - 2008/10

N2 - In this paper we deal with the minimum power multicasting (MPM) problem in wireless ad-hoc networks. By using an appropriate choice of the decision variables and by exploiting the topological properties of the problem, we are able to define an original formulation based on a Set Covering model. Moreover, we propose for its solution two exact procedures that include a preprocessing technique that reduces the huge number of the model's constraints. We also report some experimental results carried out on a set of randomly generated test problems.

AB - In this paper we deal with the minimum power multicasting (MPM) problem in wireless ad-hoc networks. By using an appropriate choice of the decision variables and by exploiting the topological properties of the problem, we are able to define an original formulation based on a Set Covering model. Moreover, we propose for its solution two exact procedures that include a preprocessing technique that reduces the huge number of the model's constraints. We also report some experimental results carried out on a set of randomly generated test problems.

KW - Multicast problem

KW - Set Covering problem

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

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

U2 - 10.1007/s00186-008-0222-0

DO - 10.1007/s00186-008-0222-0

M3 - Article

VL - 68

SP - 295

EP - 311

JO - Mathematical Methods of Operations Research

JF - Mathematical Methods of Operations Research

SN - 1432-2994

IS - 2

ER -