Wang Huaiyuan, Ding Xu, Huang Cheng, Wu Xiaobei
Academy of Automation, Nanjing University of Science and Technology, Nanjing 210094, China.
Sensors (Basel). 2016 Sep 28;16(10):1487. doi: 10.3390/s16101487.
Recently, there is a growing interest in the applications of wireless sensor networks (WSNs). A set of sensor nodes is deployed in order to collectively survey an area of interest and/or perform specific surveillance tasks in some of the applications, such as battlefield reconnaissance. Due to the harsh deployment environments and limited energy supply, nodes may fail, which impacts the connectivity of the whole network. Since a single node failure (cut-vertex) will destroy the connectivity and divide the network into disjoint blocks, most of the existing studies focus on the problem of single node failure. However, the failure of multiple nodes would be a disaster to the whole network and must be repaired effectively. Only few studies are proposed to handle the problem of multiple cut-vertex failures, which is a special case of multiple node failures. Therefore, this paper proposes a comprehensive solution to address the problems of node failure (single and multiple). Collaborative Single Node Failure Restoration algorithm (CSFR) is presented to solve the problem of single node failure only with cooperative communication, but CSFR-M, which is the extension of CSFR, handles the single node failure problem more effectively with node motion. Moreover, Collaborative Connectivity Restoration Algorithm (CCRA) is proposed on the basis of cooperative communication and node maneuverability to restore network connectivity after multiple nodes fail. CSFR-M and CCRA are reactive methods that initiate the connectivity restoration after detecting the node failure(s). In order to further minimize the energy dissipation, CCRA opts to simplify the recovery process by gridding. Moreover, the distance that an individual node needs to travel during recovery is reduced by choosing the nearest suitable candidates. Finally, extensive simulations validate the performance of CSFR, CSFR-M and CCRA.
近年来,人们对无线传感器网络(WSN)的应用兴趣日益浓厚。在某些应用中,如战场侦察,会部署一组传感器节点以共同勘测感兴趣的区域和/或执行特定的监测任务。由于部署环境恶劣且能源供应有限,节点可能会出现故障,这会影响整个网络的连通性。由于单个节点故障(割点)会破坏连通性并将网络分成不相连的块,大多数现有研究都集中在单节点故障问题上。然而,多个节点的故障对整个网络来说将是一场灾难,必须得到有效修复。只有少数研究针对多割点故障问题提出了解决方案,而多割点故障是多节点故障的一种特殊情况。因此,本文提出了一种综合解决方案来解决节点故障(单节点和多节点)问题。提出了协作单节点故障恢复算法(CSFR),该算法仅通过协作通信来解决单节点故障问题,但CSFR - M作为CSFR的扩展,通过节点移动更有效地处理单节点故障问题。此外,基于协作通信和节点机动性提出了协作连通性恢复算法(CCRA),用于在多个节点出现故障后恢复网络连通性。CSFR - M和CCRA是反应式方法,在检测到节点故障后启动连通性恢复。为了进一步最小化能量消耗,CCRA选择通过网格化简化恢复过程。此外,通过选择最近的合适候选节点,减少了单个节点在恢复过程中需要移动的距离。最后,大量仿真验证了CSFR、CSFR - M和CCRA的性能。