Multiobjective algorithms to optimize broadcasting parameters in mobile Ad-hoc networks

A mobile adhoc network (MANETs) is a self-configuring network of mobile routers (and associated hosts). The routers tend to move randomly and organize themselves arbitrarily; thus, the network´s wireless topology may change fast and unpredictably. Nowadays, these networks are having a great influence due to the fact that they can create networks without a specific infrastructure. In MANETs message broadcasting is critical to network existence and organization. The broadcasting strategy in MANETs can be optimized by defining a multiobjective problem whose inputs are the broadcasting algorithm´s parameters and whose objectives are: reaching as many stations as possible, minimizing the network utilization, and reducing the makespan. The network can be simulated to obtain the expected response to a given set of parameters. In this paper, we face this multiobjective problem with two algorithms: Multiobjective Particle Swarm Optimization and ESN (Evolution Strategy with NSGAII). Both algorithms are able to find an accurate approximation to the Pareto optimal front that is the solution of the problem. ESN improves the results of MOPSO in terms of the set coverage and hypervolume metrics used for comparison.