Research Of Energy-saving Algorithm Based On Hierarchical For Wireless Sensor Networks

As a serious energy-constrained network system, the design of routing protocol forwireless sensor networks has a great influence on the lifetime, latency and otherperformance indicators of the network. At the same time, most of the energy is consumedduring data transfer period. If data can be fused before forwarding, network traffic willbe reduced, and the overall energy consumption of the network will be cut down.Therefore, the network lifetime will be extended. This paper focuses on routing protocoland data aggregation which are based on hierarchical topology. The main researchachievements are as follows:(i) Considering the energy consumption unbalanced problem in WSN, an unevenclustering routing protocol based on chain-cluster(URCC) is proposed. In this algorithm,energy is used as a measure to determine the number of cluster heads and the size of theuneven clustering, and the number of neighbor nodes and the residual energy are used asweight to select cluster head. The routing uses chain-routing which the greedy algorithmis used for m lead-cluster heads nearest to Sink to make a chain separately and then theymake a chain themselves. Then stabilization phase is divided into m stages, and one ofthese lead-heads is chosen randomly as head of the chain to communicate with Sink inturn, which reduces the frequency of cluster reconstruction. The proposed protocolbalances the energy consumption intra-cluster and inter-cluster effectively.(ii) Considering the problem that the exist error data or redundant data in transferprocess will result in energy overload, a data aggregation method based on k-means andPCA algorithm is proposed. In this method, cluster heads check the data and isolate errordata by k-means algorithm. And then, the technology of reducing dimensions in PCA isused to aggregate the remaining data. The proposed method can reduce network trafficand energy consumption effectively.(iii) OMNeT++simulation platform is used for URCC protocol simulation, and URCC is simulated to compare with the existing routing protocols to verify itssuperiority. On the other hand, an example is used to test the proposed data aggregationmethod. The results show that the proposed method not only improves the accuracy ofdata aggregation effectively, but also has strong interference ability, so that reduces theamount of information within the networkthrough analysis and comparison.