The WSN Routing Algorithm Based On Scale-free Network Topology Structure

Wireless sensor network is a wireless ad hoc networ k with a wide range of applications.The network technology is one of the hot spots in the research.The scale-free network model originated in th e United States,University of Notre Dam e physics professor Barabasi and his doctoral student Albert jointly presented the scale free characteristics of complex network,that is,the law of Matthew,the most majority of nodes are very low,and only a sm all number of nodes is very high.After a long period of research,it is found that the scale fr ee network is generally exist in the actual network,and the network nodes are distributed according to the power-law distribution,and the network topology has the characteristics of growth and optimal connection.In this pap er,according to the characte ristics of wireles s sensor network,the scale-free theory is app lied to the wireles s sensor network,a nd using the scale-free theory construct network topology.According to the requirem ent of wireless sensor network topology and routing algorithm,a wireless sensor network routing algorithm(SFRA)based on scale-free network model is proposed.Main steps of this paper:1,This paper introduces the ba sic concept,the characteristics and system structure of wireless sensor networks,describes the topology structure and routing technology,as well as the basic concept,network m odel and the perform ance index of scale-free network,and application of scale-free network in wireless sensor network.2,This paper briefly introdu ces the classification,char acteristics and evaluating indicator of routing algorithm in the wireless sensor network.And mainly introduces the LEACH algorithm and the exis ting problems in the accent research work,which provides a way of thinking for the design and research of routing alg orithm in this paper.3,This paper presents a routing algorith m(SFRA)for wi reless sensor network based on the characteristics of the scale free topology structur e,in this algorithm,the data forwarding path is determ ined by judging whether the destin ation address is the same.Gives the network m odel and the rela ted definition,carries on the num erical analysis,designs the algorithm flow.The cluster nodes communicate with each other by layer communication method,and finally determine the shortest path,so as to m inimize the energy loss of communication.And robus tness of routing is analyzed from the macro level.4,Finally,the algor ithm is tested in M ATLAB simulation e nvironment.Experiments show that the routing algorithm mentioned above is scale-free property,to reduce the ener gy consumption of network,improve the data transmission rate and prolong the survival time of the network node has obvious advantages than the LEACH algorithm,so as to extend the network life cycle.