Main Article Content

Ramandeep Kaur
Dr.Rajesh Kumar


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.


Download data is not yet available.

Article Details



Ravneet Kaur, Ashwani Kumar,â€An Approach for Selecting Optimum Number of Base Stations and Optimizing Site Locations using Flower Pollination Algorithmâ€, International Journal of Computer Applications (0975 – 8887) Volume 133 – No.10, January 2016

Shubhdeep Kaur, R S Uppal,†Dynamic Deployment of Homogeneous Sensor Nodes Using Genetic Algorithm with Maximum Coverageâ€,Dept. Of Information Technology, Purushottam Institute of Engineering and Technology Mandiakudar, Kansbahal-770034,Orissa, India

Kennedy, J., Eberhart, R. and Shi, Y. (2001). Swarm Intelligence, Morgan Kaufmann, US.

Anju Sangwan, Rishi Pal Singh,†Survey on Coverage Problems in Wireless Sensor Networksâ€, Published online: 30 September 2014 © Springer Science+Business Media New York 2014

Sandeep Singh Syan, Amandeep Kaur Virk,†Node Placement for Efficient Coverage in Homogeneous Wireless Sensor Networksâ€, International Journal of Engineering Trends and Technology (IJETT) - Volume4 Issue7- July 2013

Prabhudutta Mohanty,Priyaranjan Mohapatra,â€Maximum Coverage in WSN using Optimal Deployment Techniqueâ€, IJCA Special Issue on “2nd National Conference- Computing, Communication and Sensor Network†CCSN, 2011

Y. Xin-She, "Nature-inspired Metaheuristic Algorithms," Luniver Press, 2008.

Raymond Mulligan, Habib M. Ammari,†Coverage in Wireless Sensor Networks: A Surveyâ€, Wireless Sensor and Mobile Ad-hoc Networks (WiSeMAN) Research Lab Department of Computer Science, Hofstra University Hempstead, NY 11549, USA

GaoJun Fan, ShiYao Jin,†Coverage Problem in Wireless Sensor Network: A Surveyâ€, JOURNAL OF NETWORKS, VOL. 5, NO. 9, SEPTEMBER 2010

Deying Li, Hai Liu,†Sensor Coverage in Wireless Sensor Networksâ€, School of Information, Renmin University of China, Department of Computer Science, Hong Kong Baptist University, Hong Kong

S. Indhumathi, D. Venkatesan,†Improving Coverage Deployment for Dynamic Nodes using Genetic Algorithm in Wireless Sensor Networksâ€, Indian Journal of Science and Technology, Vol 8(16), DOI: 10.17485/ijst/2015/v8i16/62538, July 2015

Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz,†Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Rangesâ€, Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton.

Most read articles by the same author(s)