Abstract
Recently, researchers focus on wireless sensor networks (WSNs) as it plays a vital role in numerous applications. Node energy is one of the resource constraints of WSN. Hence, it is significantly important to design an energy efficient routing. In this paper, a Clustering Scheme using Canada Geese Migration Principle (CS-CGMP) has been proposed for routing in WSNs. In this approach, the network field is partitioned into zones and number of Cluster Heads (CHs) are selected based on the density of each zone. CGMP is applied for CH rotation. If residual energy of a CH is below threshold value, it has to be rotated to a member node which has high energy. Further, the optimal number of CHs required is assured in every round. CS-CGMP based approach was simulated and the performance parameters with respect to network lifetime, number of alive nodes, number of packets transferred to the BS and CH were analysed by comparing with LEACH-C, (ACH) $$^2$$ , and DEEC.
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 callDisclaimer: 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.
