Coverage optimization for wireless sensor networks by evolutionary algorithm

Abstract

Wireless sensor network consists of a large number of tiny sensor nodes owned capable of perception in monitoring region by self-organized wireless communication, has been widely applied in military and civil fields. From the perspective of resource- saving, under the condition of the network’s connectivity and specific coverage, the number of sensor nodes is assumed to be opened as few as possible. So, computing the sensor nodes collection which meeting the requirements is called the problem of network coverage optimization for Wireless Sensor Network; also called the problem of minimum connected covering node set. The innovation point of the article is: Firstly, it analyzed the deficiencies of traditional evolution algorithm fitness function, put forward an improved fitness function design scheme, and has been proved that it has advantage of solving problem on wireless sensor networks coverage optimization; Secondly, it applied the method of control variables, comparison and analysis of the influence on the various operations and parameters selection in evolution algorithm on the optimization results and performance, and then point out how to design algorithm to manage to the best optimize effect and performance.