Optimization of sensor deployment using multi-objective evolutionary algorithms

18Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Many designs of wireless sensor network applications require the determination of the optimal locations of sensor nodes to be placed in a sensor field. Coverage enables us to evaluate the supervision quality of each point within an area of interest. In this paper, we address the problem of target coverage in wireless sensor networks. This concern is trivial if each target must be covered by a single sensor. However, it becomes an NP-complete problem when the choice of the position of the sensor must take into account the targets that it should cover in its vicinity. Using a multi-objective evolutionary-based approach, we propose a stochastic method to search for network configurations that achieve good coverage with the fewest sensors. A comparative experimental study of the model with well-known multi-objective algorithms such as NSGA-II, SPEA2, SMSEMOA and MOEA/D indicate that NSGA-II performs better than others on most of the test instances.

Cite

CITATION STYLE

APA

Ndam Njoya, A., Abdou, W., Dipanda, A., & Tonye, E. (2016). Optimization of sensor deployment using multi-objective evolutionary algorithms. Journal of Reliable Intelligent Environments, 2(4), 209–220. https://doi.org/10.1007/s40860-016-0030-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free