Research On Network Resilience Technology For Information Transmission Process

As we know,the network is characteristic of complexity,durability and so on.However,the threat that current network facing is getting more and more serious such as hackers attack,network lack,software design flaw,human behavior error and so on.Now,network defense changes into ensuring effective operation after failures or attacks,i.e.,network resilience.As a kind of network,wireless network faces more challenges.Compared with the traditional wired network,wireless network transmission medium is more vulnerable to external environment.Noise,interference and signal attenuation affect the network transmission performance.Because of the transmission range limitation,packet forwarding is usually multihop transmission.Usually,the wireless nodes has limited energy constraints,the energy problem is inevitable in data transmission.Indeed,the node may have mobility which is easy to cause the data transmission disconnect.It is very important to ensure the network data accessibility and reliability of the data transmission.However,the serious problem is that the current network lacks the ability to guarantee reliable transmission.Faced with this problem,the data transmission resilience in information network is studied in detail in this paper.Our work is as follow:(1)Systematically expounded the network resilience concept and its related indicators,describes some indicators to measure the network resilience,summarizes some methods to optimize the existing wireless network resilience,summarizes the advantages and disadvantages of these schemes,and summarizes the challenges faced by the wireless network data transmission.(2)Against the problem of real-time in current wireless sensor and actuator network as well as the dynamic problem in industrial wireless environment,a fault-tolerant,real-time,efficient and reliable prior route FRER that only takes advantage of node IDs rather than routing table is designed based on the Kautz graph in the third part of the paper.The shortest path apart from the target node can be found quickly according to the matching length of the node IDs.When nodes fail,upstream node can quickly find the shortest path of the remaining nodes on the basis of matching itself ID and target node ID instead of reselecting the path.Considering the diversity of path,not limited to Kautz topology,neighbor node information is utilized to expand the diversity of paths in the network.What's more,history information based on link availability is used to combine multipath under the consideration that link failure may occur,so as to guarantee the availability of routing path with the acceptable levels of network.Compare to REFER and Debruijn graph,experiment result shows that FRER is superior to both of them with respect to real-time,fault-tolerance and reliability performance.(3)Against the problem that under the impact of the wireless network in the channel fading,noise,energy and location error factors,opportunistic routing and geographical routing and data transmission quality are not high,the fourth part presents a new opportunistic routing that combines geographic routing common in wireless network with opportunistic routing based on the beacon node(LAGOR).To solve the above problems,opportunistic routing takes link quality into consideration in the process of routing path selection.The transmission priority of candidate nodes is arranged according to link quality.And the next hop forwarding node selection is designed by timer according to transmission priority.The benefits of doing so are to improve the reliability of data transmission,but the disadvantages are also obvious.As a reactive routing,opportunistic routing starting delay is long.There are too many nodes in the routing selection and data forwarding process that results in excessive energy consumption.LAGOR inherits the advantages of geographical routing as a proactive routing and opportunistic routing to improve the reliability of data transmission,and makes up the dependence of the location information in geographic routing and the long opportunistic routing starting delay,low routing energy efficiency.LAGOR divides the network based on the beacon node.Each node stores the length of the shortest path information to adjacent tiles.Data transmission based on link quality and distance gradient information.Compared with the geographic routing GPSR and opportunistic routing R3 E,a large number of experiments show that the performance of a LAGOR is far better than the above two kinds of routing algorithm,and LAGOR retains two routing algorithm advantage at the same time.