Wireless sensor network connection recovery method based on minimum movement of nodes

Abstract

The invention provides a wireless sensor network connection recovery method based on minimum movement of nodes. The method comprises the steps of conducting system initialization a wireless sensor network, searching out a cut point in the network through a cut point search algorithm based on depth-first, selecting a minimum connected dominating set as a backup node of the cut point, judging whether the backup node fails according to the working state, monitored by a heartbeat packet, of the cut point, and selecting a minimum connected dominating set in a subregion where the backup node is located to conduct cascading motion to substitute the failure node after the backup node detects any fault, wherein the substitute node does not directly move to the exact position of the failure node, but only moves to a certain optimum position to manage multiple sensors, and child nodes of the failure node also correspondingly move and keep connection with a pioneer node until recovery of the whole network is completed. The method is applicable to any wireless sensor network, not only can ensure that coverage is reduced at a minimum, but also can reduce network overhead.

Description

technical field [0001] The patent of the invention belongs to the field of wireless sensor networks, and in particular relates to a connection recovery method for minimum movement of nodes in a wireless sensor network. Background technique [0002] In recent years, wireless sensor networks have aroused widespread interest at the application level. The current wireless sensor network consists of a large number of sensor nodes and a small number of movable actuator nodes, which are distributed in specific detection geographical areas, especially some remote and harsh human beings cannot intervene. In the region, sensors are used for environment perception, simple processing and forwarding data to the base station, and actuator nodes perform corresponding assigned tasks according to the events reported by sensor nodes and collected data. The actuator nodes are like mobile robots and unmanned vehicles. Is the autonomous and cooperative implementation of tasks in the application...

AI Technical Summary

Problems solved by technology

[0003] In a connected wireless sensor network, the failure of one or more sensor nodes may lead to the failure of other nodes or communication links. If the alternative path between the affected nodes is not available, the network will form a partition and the node will lose its working ability. This situation will not only hinder the cooperation between nodes and destroy the requirements of real-time connection, but also cause adverse consequences for practical applications. It is impractical to use additional resource deployment to restore the connection in the remote setting service provided by the wireless sensor network. Deploying nodes will become the best choice for connection recovery. Wireless sensor networks are usually deployed in autonomous and unattended areas. Centralized node failure recovery strategies are not feasible. Restoring network connections should be a distributed network self-healing process

[0004] In terms of restoring the connectivity of wireless sensor networks, it is mainly used to restore the connection by moving the position of the actuator node. The existing methods can be classified into the cascade movement of the nodes and the block movement. The block movement often requires the network before the failure. High connectivity, so that the nodes can coordinate the response, and the cascading movement can be further divided according to the network state information. In order to avoid excessive state update overhead and better restore the connection process, previous work relies on maintaining a hop or two Jump routing table and determine the criteria for participating in the restoration of nodes. They all use distributed algorithms, which need to retain the information of two-hop neighbors, which increases communication overhead, and some use a recursive reset process to deal with the movement of its neighbors when any node fails, but There is no distinction between the split point and the leaf node, which brings unnecessary recovery process

Images