A Clustering Routing Algorithm Of WSN Based On The Complex Network’s Theory

Wireless sensor networks is a kind of intelligent network which is structured by the self-organizing ability of a large number of sensor nodes deployed in monitoring area with a specific function. With the development of networking technology, wireless sensor network whose deployment is simple and adaptability is strong has been applied to many fields, and its application prospect is broad. Since the energy of sensor node is limited and the energy consumption of its node is mainly routing energy consumption, and at the same time its application environments, often make the replacement of the power difficult. Therefore, improving sensor node’s work efficiency and extending its life cycle maximally through reasonable routing protocols has become the focus of further exploration and research.Combined the theory of complex networks which has self-organizing features, we proposed clustering routing algorithm of wireless sensor networks based on a complex network’s. The paper analyzes wireless sensor network theory and complex network theory, then analyzes the classical LEACH clustering routing algorithm, and discussed its advantages and weaknesses. Combining complex network theory and self organization characteristics of wireless sensor networks, we proposed wireless sensor networks clustering algorithm based on the complex networks theory. Judging by the clustering coefficient and the edge bitterness nodes in the network whether to remove the edge or not. Improving the network’s clustering coefficient on the condition that the networks’ average path length changes little, which makes the topology of the network more clear and make the node’s routing selection easily. In the selection of the cluster head, combining the node energy with distance factors, we put forward a new cluster heads selection algorithm. After the end of each round in the cluster any one node which is closer to the node that has the largest residual energy and that is shortest distance from gathering node is cluster head. In data communications, in order to reduce energy consumption of cluster head node which is far away from the base station and balance the network energy load, we adopted multi-hop data transmission and came up with relay node selection algorithm based on angular coefficient. In order to find the optimal transmission path, the angular coefficient’s relay node selection algorithm is proposed, which makes the transmission path shortest, reduces the energy consumption of the cluster head node whose distance is further and balances the network’s energy load. After the pretreatment for collecting data, the non-cluster head node transmit it to the cluster head of its cluster, cluster head node will transmit the data which received, after data fusion the cluster head node will transfer it to the base station by multi-hop.Finally, in the MATLAB simulation platform, several performance parameters of the former algorithm are simulated including wireless sensor network life cycle, transmit data packets number and energy consumption. Through the analysis and comparision of the simulation result, the results proved the proposed algorithm’s superiority and application value.