Energy-aware distributed routing algorithm to tolerate network failure in wireless sensor networks
Energy-aware distributed routing algorithm to tolerate network failure in wireless sensor networks
复制标题
DOI：
10.1016/j.adhoc.2016.12.006
复制
发表时间：
2017-03-01
期刊：
影响因子：
4.8
通讯作者：
Sherratt, R. Simon
中科院分区：
文献类型：
--
作者：
Chanak, Prasenjit;Banerjee, Indrajit;Sherratt, R. Simon
由于各种环境危害（例如部署的传感器节点中的干扰和内部故障），无线传感器网络很容易出现链路/节点故障。此类故障可能导致部分网络断开，并且感测数据无法获得到接收器的路由，即网络故障。网络故障可能会降低无线传感器网络 (WSN) 的服务质量 (QoS)。在恶劣或敌对的环境中使用手动操作员来监控网络故障是非常困难的。在这样的环境中，由于节点能量消耗不均匀以及硬件故障或入侵，通信链路很容易发生故障。因此，希望部署的传感器节点能够克服网络故障。在本文中，我们考虑了容忍 WSN 中部署的传感器节点出现的网络故障的问题。我们首先提出了一种新型的无线传感器网络聚类算法，称为分布式节能异构聚类（DEEHC），该算法根据所部署的传感器节点的剩余能量并借助辅助计时器来选择簇头。在聚类阶段，每个传感器节点根据其邻居传感器节点的能量水平找到到簇头的 k 顶点不相交路径。然后，我们提出一种 k 顶点不相交路径路由 (kVDPR) 算法，其中每个簇头找到到基站的 k 顶点不相交路径，并将其聚合数据中继到基站。此外，我们还提出了一种新颖的路由维护机制（RMM），可以在整个监控会话中修复 k 顶点不相交路径。由此产生的 WSN 在最坏的情况下能够容忍 k-1 次故障。所提出的方案已经使用各种网络场景进行了广泛的测试，并与现有的最先进的方法进行了比较，以显示所提出的方案的有效性。 (C) 2016 Elsevier B.V. 保留所有权利。
Wireless Sensor Networks are prone to link/node failures due to various environmental hazards such as interference and internal faults in deployed sensor nodes. Such failures can result in a disconnection in part of the network and the sensed data being unable to obtain a route to the sink(s), i.e. a network failure. Network failures potentially degrade the Quality of Service (QoS) of Wireless Sensor Networks (WSNs). It is very difficult to monitor network failures using a manual operator in a harsh or hostile environment. In such environments, communication links can easy fail because of node unequal energy depletion and hardware failure or invasion. Thus it is desirable that deployed sensor nodes are capable of overcoming network failures. In this paper, we consider the problem of tolerating network failures seen by deployed sensor nodes in a WSN. We first propose a novel clustering algorithm for WSNs, termed Distributed Energy Efficient Heterogeneous Clustering (DEEHC) that selects cluster heads according to the residual energy of deployed sensor nodes with the aid of a secondary timer. During the clustering phase, each sensor node finds k-vertex disjoint paths to cluster heads depending on the energy level of its neighbor sensor nodes. We then present a k-Vertex Disjoint Path Routing (kVDPR) algorithm where each cluster head finds k-vertex disjoint paths to the base station and relays their aggregate data to the base station. Furthermore, we also propose a novel Route Maintenance Mechanism (RMM) that can repair k-vertex disjoint paths throughout the monitoring session. The resulting WSNs become tolerant to k-1 failures in the worst case. The proposed scheme has been extensively tested using various network scenarios and compared to the existing state of the art approaches to show the effectiveness of the proposed scheme. (C) 2016 Elsevier B.V. All rights reserved.