Dynamic deployment of homogeneous sensor nodes using genetic algorithm with maximum coverage

Network coverage is one of the measures used to measure quality of service of network. The performance of the wireless sensor networks depends on the network coverage which is further depends upon the deployment of sensor nodes. Mostly the nodes are randomly placed causes an intersection between nodes that does not provide the efficient network coverage. The nodes are re-deployed to obtain maximum network coverage. In this paper, proposed method is used to get maximum coverage and minimum overlapping of sensor nodes, by repositioning the nodes. The paper concluded that the new method provides maximum area coverage with same number of sensor nodes as compared to the area covered by nodes with overlapped area. At last we compare the results of proposed algorithm with standard genetic algorithm which conclude that the proposed algorithm takes less time to remove the overlapping as compared to standard genetic algorithm.