WU Hao, CHEN Wenbai, HAO Cui, MA Hang. Restoration of minimum cascade mobile for wireless sensor networks[J]. Microelectronics & Computer, 2021, 38(11): 31-37. DOI: 10.19304/J.ISSN1000-7180.2021.0196
Citation: WU Hao, CHEN Wenbai, HAO Cui, MA Hang. Restoration of minimum cascade mobile for wireless sensor networks[J]. Microelectronics & Computer, 2021, 38(11): 31-37. DOI: 10.19304/J.ISSN1000-7180.2021.0196

Restoration of minimum cascade mobile for wireless sensor networks

  • Aiming at the problem of connectivity failure caused by node failure in complex application scenarios of wireless sensor networks, a restoration method of minimum cascade mobility is proposed. When a node in the network fails, the cut point detection algorithm is used to determine whether the failed node affects the network connectivity. If the failure node is a cut point, it is considered that the node has a great impact on the network connectivity and needs to be restored. If the distance between the neighbor nodes of the failed node is less than or equal to the communication radius of the node, the network is restored by directly establishing communication links between the neighbor nodes. If the distance between the neighbor nodes of the failed node is greater than the communication radius of the node, the best candidate node is selected by the degree of node and the Euclidean distance between nodes, and the location to be moved is calculated by the communication radius and the location of the neighbor node. After the best candidate node moves to the location, it establishes a communication link with other neighbor nodes. Experimental results show that this method can effectively restore the network after the node failure. In the process of restoration, this method reduces the moving distance of the restoration node, reduces the energy loss of the restoration node, and prolongs the network life.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return