Quality of Service Enhancement in Wireless Sensor Network Using Flower Pollination Algorithm


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

One of the renowned and drastically rising research works is developing and deploying emerging applications under wireless sensor networks. Surveillance monitoring, military and health care industries are some examples of emerging applications. Generally, sensor nodes are deployed randomly and distributed within the network region. In Wireless sensor network, it is hard to increase the network lifetime and to maximize the coverage for interest points under certain constraints. A sensor node can able to sense only the environmental information within its sensing region; hence the deployment of the node must cover the points of interests by considering energy of the nodes. To do that, we propose a Flower Pollination Algorithm (FPA) to optimize the locations of the sensor nodes and balance the residual energy of the nodes. The FP algorithm adjusts the sensor nodes and schedules the node condition (Sleep/Active) to maintain target coverage for long period of time. The proposed FPA is experimented using a simulation tool and the obtained results are verified. From the results it is noticed that the target coverage time is increased by 30% and also the performance is evaluated by comparing the obtained results with the existing IWD and ACO algorithms. Finally, it is confirmed that the FP algorithm outperforms than the IWD and ACO by increasing the energy efficiency 40% than the existing approaches.

About the authors

R. Muruganantham

Department of Computer Science and Engineering, M.A.M. School of Engineering

Author for correspondence.
Email: muruganantham1979@gmail.com
India, Tiruchirappalli

P. Ganeshkumar

Department of Information Technology, Anna University, Regional Campus

Author for correspondence.
Email: ganesh23508@gmail.com
India, Coimbatore


Copyright (c) 2018 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies