Wireless sensor network fault recovery system based on minimum spanning tree

A technology for wireless sensors and network faults, applied in transmission systems, digital transmission systems, wireless communications, etc., can solve problems such as network connectivity damage and failure to comprehensively consider node performance indicators, and achieve simplified complexity, fast recovery of connectivity, and The effect of shortening the average distance

A technology for wireless sensors and network faults, applied in transmission systems, digital transmission systems, wireless communications, etc., can solve problems such as network connectivity damage and failure to comprehensively consider node performance indicators, and achieve simplified complexity, fast recovery of connectivity, and The effect of shortening the average distance

CN109474476AActive Publication Date: 2019-03-15TIANJIN JINHANG COMP TECH RES INST
3 Cites 5 Cited by

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Wireless sensor network fault recovery system based on minimum spanning tree
  • Wireless sensor network fault recovery system based on minimum spanning tree
  • Wireless sensor network fault recovery system based on minimum spanning tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0071] This embodiment provides a minimum spanning tree-based wireless sensor network fault recovery method, which includes:

[0072] (1) Based on the depth-first network connectivity judgment, according to this step, it can be judged whether the current network is connected, so as to determine whether a recovery strategy needs to be adopted;

[0073] (2) Based on the minimum spanning tree to implement the fault recovery strategy, this step can select the best neighbor node that meets the constraints according to the moving cost of the node, and construct the minimum spanning tree based on the moving cost; at the same time, by using the minimum spanning tree, the fast Select the next mobile node, and move the neighbor node to the faulty node for replacement in cascade movement, so as to achieve the purpose of restoring connectivity, and effectively reduce the moving distance of the node and save the energy of the node.

[0074] Wherein, the step (1) implements the judging proc...

Embodiment 2

[0077] In order to solve the problem of network connectivity recovery in real time in the case of a node transmission failure, this embodiment uses a depth-first method to determine whether the entire network is connected. The tree algorithm selects neighbor nodes, and finally moves the neighbor nodes to the faulty node through cascading to replace the faulty node. After the above steps, the network returns to the normal working mode. On this basis, this embodiment carries out the minimum spanning tree reconstruction process based on the node cost, recalculates the node cost of the node after the failure recovery, and updates the minimum spanning tree. Tree. The content of this embodiment will be further described below.

[0078] 1. Trigger failure recovery strategy based on network connectivity

[0079] (1) Judging network connectivity based on depth-first algorithm

[0080] Suppose a certain network G=(V,E), V represents a set of nodes, and E represents a set of connectio...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention belongs to the technical field of wireless sensors, and in particular relates to a wireless sensor network fault recovery system based on a minimum spanning tree. The system is operatedas follows: firstly determining whether the network connectivity can be destroyed by using an interception depth-first algorithm; secondly constructing a minimum spanning tree based on the moving costto achieve the selection of an optimal neighbor node of the faulty node; and on this basis, moving the optimal neighbor node to the faulty node by a cascaded moving algorithm, and selecting the nodeof the minimum spanning tree for the next step of cascading movement. The fault recovery method based on the minimum spanning tree can effectively reduce the one-way distance of the node movement andthe total distance of the moving nodes, thereby saving the time for restoring the network connectivity and effectively ensuring the security of the network.

Description

technical field [0001] The invention belongs to the technical field of wireless sensors, in particular to a minimum spanning tree-based wireless sensor network fault recovery system. Background technique [0002] A wireless sensor network is a wireless communication network composed of a large number of sensor nodes in a self-organizing manner. Informative and reliable information. Due to working in harsh environments, such as in the battlefield, fire, etc., the probability of node failure will be relatively higher. The failed network should be restored in time to ensure normal communication quality. The fault recovery technology of a single node has a method of replacing the faulty node based on neighbor nodes, which includes: S1. Constructing a strongly connected set CDS for the entire network, and broadcasting the set to all nodes; S2. Judging whether the faulty node has caused Destruction of network connectivity; S3. Select the nearest leaf node in the faulty node or ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
15 Mar 2019
Publication
CN109474476A
IPC
H04L12/24; H04W24/04
CPC
H04L41/0668; H04W24/04
Inventors
高娟