Research On Cluster-Based Coverage Scheme In Wireless Sensor Networks

Because of some advantages, wireless sensor networks have a wide range of applications in military and civilian fields. The coverage problem is one of the fundamental issues in wireless sensor networks.How to use the network energy efficiently, monitor the coverage area effectively, and extend the lifetime of networks are three key technologies in wireless sensor networks coverage problem. According to the actual conditions , In this study, we improve the wireless sensor network clustering and routing protocol, and propose a classify based coverage scheme.This paper improve the degree based clustering algorithm, and propose a clustering algorithm based on energy awareness and average adjacent degree for each node, which defines the weight by degree and energy, and use it for clustering. Experimental results show that the algorithm has more balanced number of nodes in each cluster, and improve the performance of the cluster boundary, thus extend the life cycle of the entire network.To solve the transmission energy waste issue, this paper propose a greedy algorithm for the routhing protocol, prove the rationality of the algorithm through mathematical formulas, defines a threshold and transfer data to the nearest node by base station in the node communication radius. Experimental results show that the method can save a lot of transmission energy.Based on the previous study, This paper propose a cluster-based partitioning coverage strategy, which classifies the nodes by energy and uses some schemes to cover the whole monitoring area by each partition. Experimental results show that the strategy does reduce the number of working nodes in each cluster to save energy consumption, and extend the network lifetime.