Research On Invulnerability Strategy Through Multi-route For Wireless Sensor Networks

Wireless sensor networks(WSNs)is composed of a large number of randomly deployed sensor nodes in space.It was first applied in the battlefield environment,and gradually plays an increasingly important role in biological medicine,environmental monitoring,intelligent transportation,emergency and disaster relief,agricultural modernization and other fields,and has a very important application prospect in the future.However,the wireless sensor network is prone to failure due to its harsh working environment,network self-organization,multi-hop communication and limited node energy.Therefore,the design of WSNs fault-tolerant routing is the premise to ensure the effective transmission of network data.From the perspectives of routing strategy and network regeneration strategy,this paper studies the destructiveness of WSNs as follows:(1)in order to improve the reliability and robustness of wireless sensor networks,a k-connected algorithm based on flow network is proposed.The algorithm firstly generates the shortest path through the ford-fulkerson and breadth-first search algorithm and the vertex splitting technology to ensure that the K paths of the network are vertex-disjoint paths to the sinks and have length constraints.Simulation results show that this algorithm can find more than two disjoint paths,at the same time,the performance of the algorithm is also analyzed,the large-scale network of more node,can find more disjoint paths,but at the same time the computational complexity also increased dramatically.(2)in order to increase the reliability problem of WSNs,solve the existing nodes cannot generate disjoint paths,proposed to deploy additional relay node to ensure that each sensor node in the initial design has k length-bounded vertex-disjoint shortest paths to the sinks,this paper puts forward the disjoint paths optimize relay node deployment algorithm.The algorithm is divided into two phases,the construction phase and the node local search phase,to realize the deployment of the minimum number of additional relay nodes in the possible candidate locations.Simulation results show that the proposed scheme requires fewer relay nodes to solve large-scale networks,and the dynamic programming algorithm has faster speed,which allows us to solve the connectivity problem of large-scale networks.Through the design of node fault in simulation,we also evaluated the robustness of the algorithm,and proved that the topology of the optimal deployment algorithm of relay node can provide robust delivery.