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.

最近，研究人员将重点放在无线传感器网络（WSN）上，因为无线传感器网络在众多应用中起着至关重要的作用。节点能量是WSN的资源限制之一。因此，设计节能路由至关重要。在本文中，已经提出了使用加拿大鹅迁移原则（CS-CGMP）的聚类方案来在WSN中进行路由。在这种方法中，将网络字段划分为多个区域，并根据每个区域的密度选择簇头（CH）的数量。CGMP用于CH旋转。如果CH的剩余能量低于阈值，则必须将其旋转到具有高能量的成员节点。此外，在每一轮中确保所需的CH的最佳数量。模拟了基于CS-CGMP的方法，并针对网络寿命，活动节点数，ACH）\（^ 2 \）和DEEC。