Abstract
A wireless sensor network (WSN) is comprised of miniature devices known as sensor nodes. Sensor nodes are highly energy restrained due to their battery dependent operations and harsh area deployment. It is unviable to change their batteries. For maximising the network lifetime, energy conservation is a crucial measure of performance of WSNs. So, energy consumption and network lifetime are crucial issues in WSNs. Large portion of energy consumed in communication process. Several routing algorithms have been proposed in WSNs. Based on network structure, routing algorithms are divided into flat based, cluster based, and location-based algorithms. Due to energy efficiency, cluster-based routing is the best choice. In this paper, we propose a swarm based clustering algorithms for WSNs. We perform the analysis of our new algorithms with LEACH, LEACH-C, and HEED on the basis of energy, number of alive nodes, delay, PDR, and throughput. Simulation confirms that proposed algorithm outperform the other ones.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Information and Communication Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
