Research On Dynamic Hyper-Round Clustering Scheduling Algorithm For Wsns

Wireless Sensor Networks(WSNs)consist of many miniature,low-cost,connected sensor nodes.These sensors can be self-organized and deployed in various complex environments and widely used in areas such as environmental monitoring.WSNs often use clustering algorithms to select Cluster Head(CH)to be responsible for the sensing data transmission within clusters to reduce the energy consumption caused by the direct communication between nodes and Sink.In addition,since the energy consumption of the CH is often much greater than that of other member nodes within the cluster,the clustering algorithm based on the round strategy will recluster by each round to equalize the network energy load.Although clustering can significantly reduce the energy consumption caused by data transmission,clustering each round also requires frequent information exchange between nodes,which will generate new clustering energy consumption.In this paper,the dynamic superround clustering scheduling algorithm is studied for the clustering and energy load balancing problems in WSNs.This algorithm reduces the clustering energy consumption significantly while balancing the network energy load,thus extending the network lifetime of WSNs.The main work is as follows:(1)This paper analyzes the clustering energy consumption problem of WSNs.We expect to reduce the number of clustering as much as possible without affecting the operation of the network.This way could reduce the clustering energy consumption and extend the network lifetime.This paper proposes a Multi-factor Fuzzy Clustering of Wireless Sensor Networks based on Dynamic Hyper Round(MFFC-DHR)algorithm to solve the above problem.The algorithm keeps the network cluster structure unchanged at the beginning of the network.And the network will adjust the cluster structure by re-cluster when the residual energy of the CH of a cluster is below the threshold value.The re-cluster is triggered more frequently as the number of rounds increases to balance the energy consumption of WSNs.However,the number of clusters in MFFC-DHR is greatly reduced compared to the clustering under the Round-Based Policy(RBP).The simulation experimental results show that this algorithm has a significant advantage over other algorithms based on the round strategy in terms of network lifetime.(2)A network based on the dynamic hyper round policy will have all clusters re-clustered when any cluster triggers the re-cluster condition.We adopt the Hierarchical Clustering-task Scheduling Policy in Cluster-based Wireless Sensor Networks(HCSP)to address this problem.It further proposes the concept of local re-cluster based on the hyper round policy.However,HCSP triggers cluster splitting frequently in local re-cluster,which leads to a surge in the number of clusters.We proposed the Hierarchical Clustering Node Collaborative Scheduling(HCNCS)algorithm and the Enhanced Hierarchical Clustering Node Collaborative Scheduling(EHCNCS)algorithm.These algorithms use K-means to regionally divide all the nodes participating in local re-cluster,thus constraining the splitting of clusters at the root.In addition,algorithms also use node collaborative sensing to improve the coverage performance of nodes,thus activating as few sensors as possible for network coverage by the node scheduling algorithm while guaranteeing the network coverage.In turn,the network lifetime will extend as much as possible while maintaining the network coverage.The simulation results show that both HCNCS and EHCHCS have advantages in network lifetime and network coverage,with the EHCHCS having more significant advantages.