Reduction Techniques for the Minimum Power Multicasting Problem in Wireless Networks

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 paper 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.