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
SN - 1812-5654
VL - 11
SP - 731
EP - 736
JO - Journal of Applied Sciences
JF - Journal of Applied Sciences
IS - 4
ER -