The Clustering And Routing Optimization Algorithm Based On Heterogeneous Wireless Sensor Networks

Wireless sensor network is the modern cutting-edge technology integrated with the funtions of information collection, processing, wireless communications, etc. Effective life cycle is important to their work performance. Efficient clustering and routing algorithm can save energy, balance energy consumption and effectively extend the network life cycle. Based on the mathematical model of energy consumption of wireless sensor networks, this paper analyzed the advantages and disadvantages of the traditional WSN protocols in detail. The aim is to suggest improvements and strategies to reduce energy consumption, load balancing sensor nodes designed for the actual problems and deficiencies.In the applications that the initial energy of wireless sensor nodes is equal and the contents of the data collection is different, this paper proposed the clustering routing optimization algorithm(KMSC) based on improved k-means clustering cluster. First, the mathematical energy models were used to derive optimal cluster number of the network, and then k-means clustering algorithm was used on the sensor node to cluster. Secondly, the resultant clusters data was adjusted in accordance with established rules to get a fixed static load balancing cluster. In data collection period, the head cluster information only update within a fixed cluster. Finally, the inter-cluster communication is based on the shortest and effective multi-hop forwarding distance algorithm. When the distance between the base station and cluster head is less than d0, the single-hop was chosen to transmit. And multi-hop was chosen when the distance is greater than d0. A sensor network model was built to simulate the above algorithms. Simulation results show that the proposed algorithm can balance the network load better, reduce energy loss and improve the lifetime of the network.