Research Of Wireless Sensor Network Routing Algorithm Based On Complex Network Theory

Wireless sensor networks through the hundreds of sensor nodes, the nodes have the functionof sensing and collecting information of monitored areas timely, the information can be sent tothe end user to realize the sensing of the physical world and the communication between humanand the physical world. Usually, sensor node uses battery which has limited capacity, and can’tbe replaced, so how to prolong wireless sensor network’s lifetime and how to improve theefficiency of sensor nodes attract the attention of the researchers.First, the paper introduces Wireless sensor network topology optimization with thecharacteristics of small world in complex network, which makes the average path length of thenetwork has little change to improving the clustering coefficient and the more obvious structureof clusters. On that basis, the head nodes selected by LEACH algorithm compare energy,distance and degree of each, finally we find the optimal heads of cluster. Simulation shows thisalgorithm reduce the energy consumption of the node and prolong the network life.Second, because of the problem of unreasonable cluster-heads distribution and unbalancedenergy consumption in LEACH routing algorithm, paper introduces community structure ofcomplex network to optimize the topology of wireless sensor network by deleting some edgesand using multi-hop routing algorithm. Simulation shows this algorithm of the performance issuperior to classical LEACH algorithm.At last, wireless sensor network clustering routing algorithm combining with the theory ofcompressed sensing to detect the target sources. This paper researches the location of targetsignal by the improved gradient projection for sparse reconstruction algorithm. Compared withother algorithm in signal location research, it shows great advantage in localization accuracy andanti-interference performance.