Optimal Broadcasting in Metropolitan MANETs Using Multiobjective Scatter Search

Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenario, broadcasting becomes an operation of capital importance for the own existence and operation of the network. Optimizing a broadcasting strategy in MANETs is a multiobjective problem accounting for three goals: reaching as many stations as possible, minimizing the network utilization, and reducing the makespan. In this paper, we face this multiobjective problem with a state-of-the-art multiobjective scatter search algorithm called AbSS (Archive-based Scatter Search) that computes a Pareto front of solutions to empower a human designer with the ability of choosing the preferred configuration for the network. Results are compared against those obtained with the previous proposal used for solving the problem, a cellular multiobjective genetic algorithm (cMOGA). We conclude that AbSS outperforms cMOGA with respect to three different metrics.

[1]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[2]  Kenneth A. De Jong,et al.  Artificial Evolution , 2021, Lecture Notes in Computer Science.

[3]  Enrique Alba,et al.  A cellular multi-objective genetic algorithm for optimal broadcasting strategy in metropolitan MANETs , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[4]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[5]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[6]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[7]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[8]  Ricardo P. Beausoleil,et al.  "MOSS" multiobjective scatter search applied to non-linear multiple criteria optimization , 2006, Eur. J. Oper. Res..

[9]  Pascal Bouvry,et al.  A Heuristic for Efficient Broadcasting in the Metropolitan Ad hoc Networks , 2004, KES.

[10]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[11]  José Rui Figueira,et al.  A Scatter Search Method for the Bi-Criteria Multi-dimensional {0,1}-Knapsack Problem using Surrogate Relaxation , 2004, J. Math. Model. Algorithms.

[12]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[13]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[14]  Shigeyoshi Tsutsui,et al.  Advances in evolutionary computing: theory and applications , 2003 .

[15]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[16]  Enrique Alba,et al.  New Ideas in Applying Scatter Search to Multiobjective Optimization , 2005, EMO.