吴昊, 陈雯柏, 郝翠, 马航. 一种无线传感器网络最小级联移动修复方法[J]. 微电子学与计算机, 2021, 38(11): 31-37. DOI: 10.19304/J.ISSN1000-7180.2021.0196
引用本文: 吴昊, 陈雯柏, 郝翠, 马航. 一种无线传感器网络最小级联移动修复方法[J]. 微电子学与计算机, 2021, 38(11): 31-37. DOI: 10.19304/J.ISSN1000-7180.2021.0196
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

  • 摘要: 针对复杂应用场景中无线传感器网络节点失效导致的连通性故障问题,提出了一种最小级联移动的修复方法.当网络中某节点发生失效时,通过割点检测算法判断该失效节点是否对网络连通性造成影响.若该失效节点为割点,则认为该节点对网络连通性影响较大,需要对网络进行修复.该失效节点的邻居节点间距离若小于等于节点通信半径,通过邻居节点间直接建立通信链路的方式对网络进行修复.该失效节点的邻居节点间距离若大于节点通信半径,利用节点度与节点间欧式距离选举最佳候选节点,通过通信半径与邻居节点位置计算其待移动位置,最佳候选节点移动到位置后与其他邻居节点建立通信链路.实验结果表明,该方法能够有效对节点失效后的网络进行修复.该方法在修复过程中减少了修复节点的移动距离,降低了修复节点的能量损耗,延长了网络寿命.

     

    Abstract: 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.

     

/

返回文章
返回