当前位置: X-MOL 学术Telecommun. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
EOCGS: energy efficient optimum number of cluster head and grid head selection in wireless sensor networks
Telecommunication Systems ( IF 1.7 ) Pub Date : 2021-04-22 , DOI: 10.1007/s11235-021-00782-1
Akhilesh Panchal , Rajat Kumar Singh

Wireless Sensor Network (WSN) is widely used for collecting the information from the target region by deploying the sensor nodes in that region. In WSNs, energy saving is the prime task which depends upon the number of Cluster Heads (CH) and on their selection techniques. Thus, in order to optimize the energy consumption of the clusters, we are proposing an Energy-efficient technique for selection of Optimum Number of Cluster Head and Grid Head (EOCGS) which extends the network lifetime. Here, firstly we give the expression of optimum number of clusters, then propose a new technique for selecting the optimum number of CHs in an energy efficient manner. For saving the energy of the CHs, the concept of Grid Head (GH) is being added in an efficient way, which works in dynamic mode. When the number of CHs are greater than threshold limit, then few of the CHs work as GHs and they are selected by using the proposed fitness function that depends on residual energy, Euclidean distances, and location of the grid-centroid of CHs. We have depicted that the proposed work saves the network energy efficiently, extends the network lifetime and coverage as compared to similar clustering algorithms e.g., LEACH, TL-LEACH, R-LEACH, RCH-LEACH, UCRA-GSO & CCA-GWO. It also stabilizes the cluster formation in the network.



中文翻译:

EOCGS:无线传感器网络中高能效的簇头和网格头选择的最佳数量

无线传感器网络(WSN)被广泛用于通过在目标区域中部署传感器节点来从目标区域中收集信息。在WSN中,节能是首要任务,它取决于簇头(CH)的数量及其选择技术。因此,为了优化群集的能耗,我们提出了一种节能技术,用于选择群集头和网格头的最佳数量(EOCGS),以延长网络寿命。在这里,首先我们给出了最优簇数的表达式,然后提出了一种以节能的方式选择最优CH数的新技术。为了节省CH的能量,正在以有效方式添加网格头(Grid Head)(GH)的概念,该概念以动态模式工作。当CH的数量大于阈值限制时,那么很少有CH会像GH一样工作,并通过使用建议的适应度函数来选择它们,该函数取决于剩余能量,欧几里得距离和CH的网格质心的位置。我们已经描述了与类似的聚类算法(例如,LEACH,TL-LEACH,R-LEACH,RCH-LEACH,UCRA-GSO和CCA-GWO)相比,所提出的工作有效地节省了网络能量,延长了网络寿命和覆盖范围。它还可以稳定网络中的群集形成。RCH-LEACH,UCRA-GSO和CCA-GWO。它还可以稳定网络中的群集形成。RCH-LEACH,UCRA-GSO和CCA-GWO。它还可以稳定网络中的群集形成。

更新日期:2021-04-22
down
wechat
bug