Multi-objective Evolutionary Algorithms to Solve Coverage and Lifetime Optimization Problem in Wireless Sensor Networks

Multi-objective optimization problem formulations reflect pragmatic modeling of several real-life complex optimization problems. In many of them, the considered objectives are competitive with each other and emphasizing only one of them during solution generation and evolution, incurs high probability of producing one sided solution which is unacceptable with respect to other objectives. This paper investigates the concept of boundary search and also explores the application of a special evolutionary operator on a multi-objective optimization problem; Coverage and Lifetime Optimization Problem in Wireless Sensor Network (WSN). The work in this paper explores two competing objectives of WSN;network coverage and network lifetime using two efficient, robust MOEAs. It also digs into the impact of special operators in the multi-objective optimization problems of sensor node’s design topology.

[1]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[2]  Bernd Freisleben,et al.  A Genetic Local Search Approach to the Quadratic Assignment Problem , 1997, ICGA.

[3]  David W. Corne,et al.  Techniques for highly multiobjective optimisation: some nondominated points are better than others , 2007, GECCO '07.

[4]  Natalio Krasnogor,et al.  Towards Robust Memetic Algorithms , 2005 .

[5]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

[6]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[7]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[8]  Joshua D. Knowles,et al.  M-PAES: a memetic algorithm for multiobjective optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[9]  Joshua D. Knowles,et al.  Memetic Algorithms for Multiobjective Optimization: Issues, Methods and Prospects , 2004 .

[10]  Andrea Omicini,et al.  Proceedings of the 2004 ACM Symposium on Applied Computing (SAC 2004) , 2004 .

[11]  David W. Corne,et al.  Towards Landscape Analyses to Inform the Design of Hybrid Local Search for the Multiobjective Quadratic Assignment Problem , 2002, HIS.

[12]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[13]  Thomas Stützle,et al.  Hybrid Population-Based Algorithms for the Bi-Objective Quadratic Assignment Problem , 2006, J. Math. Model. Algorithms.

[14]  Günther R. Raidl,et al.  An improved hybrid genetic algorithm for the generalized assignment problem , 2004, SAC '04.

[15]  Andrzej Jaszkiewicz,et al.  On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment , 2002, IEEE Trans. Evol. Comput..

[16]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[17]  Konstantinos P. Ferentinos,et al.  Adaptive design optimization of wireless sensor networks using genetic algorithms , 2007, Comput. Networks.