Improving Coverage Deployment for Dynamic Nodes using Genetic Algorithm in Wireless Sensor Networks

Wireless Sensor Network is a group of sensor nodes aimed to monitor various environmental conditions at the field locations. Eventually the sensed data is sent to a processing center. Each sensor node consists of a different number of sensors for sensing different parameters in the field area. The sensor nodes are usually equipped with a pair of limited alkaline battery. Achieving maximum coverage deployment is a major problem in wireless sensor networks. In the Existing system, by using the Random Deployment some nodes may get overlapping this will cause unbalanced structure. By using maximum coverage sensor deployment problem, the Coverage achieved only for static nodes. In the proposed system, a Genetic Algorithm is used to deploy Sensor Nodes for the Maximum coverage within the area, where the sensors are of different types. In this work, first analyze the total coverage area the WSN, identify the types of Sensor nodes and Coverage sensing distance, and calculate the coverage sensing distance for the combination of all sensor types based on radius of each node. Improving the deployment of Dynamic nodes for achieving maximum coverage deployment by using Genetic Algorithm. As a result, we were implemented this work in Java. This will show the best performance in coverage and network lifetime.