Efficient routing in wireless sensor network by using water cycle algorithm to evaluating the performance of density grid based clustering

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Wireless communication has an exceptional network known as a wireless sensor network, which consists of many dedicated sensors. They have characteristics of sensing capacity and have the capability to complete a common task. To increase the performance of the network an energy efficient algorithm is needed which enhances the network lifetime and make the system more energy efficient. In this paper, the density grid based clustering is enhanced using the water cycle algorithm. The water cycle algorithm is a nature-inspired optimization algorithm that is used to increase the performance of the network which effects the lifetime of the network. The simulation is done in the Matlab r2015a environment. The proposed methodology has increased the performance of the network when compared with the existing algorithm ABC (artificial bee colony) and its better improvement is shown in parameters like network lifetime, computation time and clusterformed.

Author supplied keywords

Cite

CITATION STYLE

APA

Yadav, S., Bakshi, S., & Kaur, M. (2019). Efficient routing in wireless sensor network by using water cycle algorithm to evaluating the performance of density grid based clustering. International Journal of Innovative Technology and Exploring Engineering, 8(9 Special Issue), 273–279. https://doi.org/10.35940/ijitee.I1043.0789S19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free