The Wireless Sensor Networks with Overlapping Multihop Clustering

Clustering is often utilised in wireless sensor networks to offer efficient and scalable operation. Typically, the goal of a clustering method is to produce a set of distinct groups that all meet a certain set of requirements. In this study, we introduce a new clustering problem with the goal of producing multi-hop clusters that overlap with one another. Inter-cluster routing, node location, and time synchronisation protocols are just a few examples of where overlapping clusters become valuable in sensor networks. We also present a multi-hop clustering method (MHC) that uses randomization and distributed computing to address the overlapping clustering issue. The goal of MHC is to produce linked overlapping clusters that, on average, overlap the whole sensor network. We analyse and simulate many scenarios to demonstrate how to optimise the clustering process's parameters. In addition, the findings demonstrate that MHC generates clusters of about similar sizes, which facilitates load distribution among clusters. In addition, despite the scope of the network, MHC's clustering creation ceases after a certain length of time.