DYNAMIC DEPLOYMENT OF HOMOGENEOUS SENSOR NODES USING PLANT PROPAGATION ALGORITHM WITH MAXIMUM COVERAGE

Abstract

Wireless sensor network serves as a nursery for umpteen cosmic fields such as defence, security, scientific applications and environment. One of the contemporary areas of research in wireless sensor network is the area coverage. In wireless sensor network, the ethereal trait of network is measured by the area covered by the sensor nodes. The quality of service is achieved by the maximum area coverage but the quality of service is inversely proportional to vendor’s cost there is a need to place the more sensor than existing. The web of issues in the network coverage includes homogeneous or heterogeneous sensor nodes, random or deterministic deployment of sensor nodes and centralized and distributed algorithms. Other than that, the network coverage relies upon the deployment of sensor nodes. The sensor nodes can be placed in one of the following manners, deterministic or random. In this paper, Plant Propagation Algorithm is used to improve the coverage of network nodes and deploy the nodes in such a manner that has minimum overlapping of nodes. The paper concluded that the algorithm provides maximum area coverage with same number of nodes. At the end of this paper the results of proposed algorithm are compared with genetic algorithm which shows that the Plant Propagation algorithm takes less time to eradicate the intersection between sensor node as compared to genetic algorithm.