Reduction techniques for the minimum power multicasting problem in wireless networks

Simona Oprea, Valeria Leggieri, Chefi Triki

Research output: Contribution to journalArticle

Abstract

Many features of the wireless ad hoc networks (WAHNs) like resource limitation, multi-hop communication, dynamic topology and lack of infrastructure make them very attractive and rise many challenging optimization problems. In this study, we propose original preprocessing techniques applied to the Minimum Power Multicasting (MPM) problem in WAHNs in order to reduce the size of the instances and, consequently, the time required to solve them. The experimental results prove that these reduction procedures, based on the graph model representation, are a promising way of speeding up a possible solution method for the MPM problem already developed in the literature.

Original languageEnglish
Pages (from-to)731-736
Number of pages6
JournalJournal of Applied Sciences
Volume11
Issue number4
DOIs
Publication statusPublished - 2011

Fingerprint

Multicasting
Wireless ad hoc networks
Wireless networks
Topology
Communication

Keywords

  • Graph reduction
  • Multicast problem
  • Preprocessing procedures
  • Wireless ad hoc networks

ASJC Scopus subject areas

  • General

Cite this

Reduction techniques for the minimum power multicasting problem in wireless networks. / Oprea, Simona; Leggieri, Valeria; Triki, Chefi.

In: Journal of Applied Sciences, Vol. 11, No. 4, 2011, p. 731-736.

Research output: Contribution to journalArticle

@article{d5cd5370a48d47249cdaf673d6d4ea37,
title = "Reduction techniques for the minimum power multicasting problem in wireless networks",
abstract = "Many features of the wireless ad hoc networks (WAHNs) like resource limitation, multi-hop communication, dynamic topology and lack of infrastructure make them very attractive and rise many challenging optimization problems. In this study, we propose original preprocessing techniques applied to the Minimum Power Multicasting (MPM) problem in WAHNs in order to reduce the size of the instances and, consequently, the time required to solve them. The experimental results prove that these reduction procedures, based on the graph model representation, are a promising way of speeding up a possible solution method for the MPM problem already developed in the literature.",
keywords = "Graph reduction, Multicast problem, Preprocessing procedures, Wireless ad hoc networks",
author = "Simona Oprea and Valeria Leggieri and Chefi Triki",
year = "2011",
doi = "10.3923/jas.2011.731.736",
language = "English",
volume = "11",
pages = "731--736",
journal = "Journal of Applied Sciences",
issn = "1812-5654",
publisher = "Asian Network for Scientific Information",
number = "4",

}

TY - JOUR

T1 - Reduction techniques for the minimum power multicasting problem in wireless networks

AU - Oprea, Simona

AU - Leggieri, Valeria

AU - Triki, Chefi

PY - 2011

Y1 - 2011

N2 - Many features of the wireless ad hoc networks (WAHNs) like resource limitation, multi-hop communication, dynamic topology and lack of infrastructure make them very attractive and rise many challenging optimization problems. In this study, we propose original preprocessing techniques applied to the Minimum Power Multicasting (MPM) problem in WAHNs in order to reduce the size of the instances and, consequently, the time required to solve them. The experimental results prove that these reduction procedures, based on the graph model representation, are a promising way of speeding up a possible solution method for the MPM problem already developed in the literature.

AB - Many features of the wireless ad hoc networks (WAHNs) like resource limitation, multi-hop communication, dynamic topology and lack of infrastructure make them very attractive and rise many challenging optimization problems. In this study, we propose original preprocessing techniques applied to the Minimum Power Multicasting (MPM) problem in WAHNs in order to reduce the size of the instances and, consequently, the time required to solve them. The experimental results prove that these reduction procedures, based on the graph model representation, are a promising way of speeding up a possible solution method for the MPM problem already developed in the literature.

KW - Graph reduction

KW - Multicast problem

KW - Preprocessing procedures

KW - Wireless ad hoc networks

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

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

U2 - 10.3923/jas.2011.731.736

DO - 10.3923/jas.2011.731.736

M3 - Article

AN - SCOPUS:79953251792

VL - 11

SP - 731

EP - 736

JO - Journal of Applied Sciences

JF - Journal of Applied Sciences

SN - 1812-5654

IS - 4

ER -