Network Partitioning Recovery Mechanisms in WSANs: a Survey

Wireless sensor and actor networks (WSANs) are more promising and most addressing research field in the area of wireless sensor networks in recent scenario. It composed of possibly a large number of tiny, autonomous sensor devices and resources rich actor nodes equipped with wireless communication and computation capabilities. Actors collect sensors’ information and respond collaboratively to achieve an application specific mission. Since actors have to coordinate their operation, a strongly connected inter-actor network would be required at all the time in the network. Actor nodes may fail for many reasons (i.e. due of battery exhaustion or hardware failure due to hash environment etc.) and failures may convert connected network into disjoint networks. This can hinder sometimes not only the performance of network but also degrade the usefulness and effectiveness of the network. Thus, having a partitioning detection and connectivity restoration procedure at the time of failure occurs in the network is crucial for WSANs. In this paper, we review the present network partitioning recovery approaches and provide an overall view of this study by summarizing previous achievements.     

Fault‐tolerance in wireless ad hoc networks: bi‐connectivity through movement of removable nodes

For a wireless ad hoc network to achieve fault‐tolerance, it is desired that the network is bi‐connected. This means that each pair of nodes in the network have at least two node‐disjoint paths between them, and thus, failure at any single node does not partition the network. In other words, in a bi‐connected network, there is no cut‐node (defined as a node such that the removal of it partitions the network). To make a connected but not bi‐connected network become bi‐connected, actions should be taken such that all cut‐nodes become non‐cut‐nodes. In this research, we propose to deal with cut‐nodes from a new perspective. Specifically, we first introduce a new concept of removable node, defined as a non‐cut‐node such that the removal of it does not generate any new cut‐node in the network. Then, we propose to move a removable node to a new location around a cut‐node. In this way, the cut‐node becomes a non‐cut‐node, that is, the failure of it does not partition the network anymore. Algorithms are provided (i) to identify removable nodes; (ii) to match cut‐nodes with a feasible set of removable nodes, in which all nodes can be simultaneously removed from the network without generating any new cut‐node in the network; and (iii) to derive the final location of a removable node such that its movement distance is the shortest and the associated cut‐node becomes a non‐cut‐node. The proposed algorithms do not guarantee the final bi‐connectivity but have the merits of a large success rate (almost 100% in the simulation), a small number of moved nodes, and a short total movement distance. In addition, the proposed algorithms are shown to be effective even when there are a large portion of fixed nodes in the network. Copyright © 2011 John Wiley & Sons, Ltd.     

Fault detection and recovery scheme for routing and lifetime enhancement in WSN

In WSNs, failures are unavoidable due to the inhospitable environment and unattended deployment. The node failure leads to disconnection from the network and causes network partitioning. We propose to develop a fault detection and recovery scheme where the sink generates an agent packet and the Agent forms a query path towards the dead or faulty node. Here, sink periodically broadcasts the Agent packet to all its neighbor nodes. The receiving node randomly makes a decision as whether to forward the packet or not thereby detecting the dead or faulty nodes. After detecting a node failure or dead node, the connectivity is restored using Least-Disruptive Topology Repair (LeDiR) without extending the length of the shortest path among nodes compared to the pre failure topology. LeDiR replaces the faulty node with block movement.     

Towards realistic connectivity restoration in partitioned mobile sensor networks

The connectivity of a disjoint mobile sensor network can be restored by moving a set of nodes to certain destinations. However, all of the existing works have assumed that the selected destinations can be reached via direct path movement, which may not be the case in real‐world applications because of obstacles or terrain elevation. In addition, even if direct path movement is successful, optimal energy efficiency cannot be attained by neglecting the elevation or friction of the terrain when determining the movement path of the nodes. Thus, in the recovery efforts, terrain type, elevation, obstacles, and possible localization errors should be considered in order to guarantee the connectivity restoration while minimizing the recovery cost in terms of energy. In this paper, we pick two sample distributed and centralized connectivity restoration approaches from the literature to show that these approaches fail to restore connectivity in many cases due to the lack of considering realistic issues. These approaches are re‐designed in order to determine movement trajectory based on a path planning algorithm, which considers the risk and elevation of the terrain sections. Experiment results reveal several issues regarding the performance in terms of energy consumption and recovery delay. Copyright © 2014 John Wiley & Sons, Ltd.     

ZBFR: zone based failure recovery in WSNs by utilizing mobility and coverage overlapping

Wireless sensor networks are more prone to failures as compared to other traditional networks. The frequent faults and failures sometime create large holes causing loss of sensing and connectivity coverage in the network. In present work, a zone based failure detection and recovery scheme is presented to reliably handle such node failures. We first propose a consensus and agreement based approach to elect a suitable monitor node called as zone monitor (ZM). ZM is responsible for coordinating failure recovery activities and maintaining desired coverage within a zone. In order to overcome failure overhead due to false failure detection, a consensus is carried out amongst neighboring nodes of a suspicious node to confirm the correct status with high accuracy. On confirmation of a node failure, the impact of resulting hole on coverage is analyzed and if impact exceeds beyond a particular threshold, a recovery process is initiated. The recovery process utilizes backup nodes having overlapping sensing coverage with failed node and may also relocate some nodes. Firstly a backup node is probed and activated if available. If no backup node is found, the solution strives to recover coverage jointly by recursively relocating some mobile nodes and probing backup nodes. The proposed scheme is analyzed and validated through NS-2 based simulation experiments.     

一维Ad Hoc网络二连通性研究

无线Ad Hoc网络拓扑结构的连通性是成功实现网络端到端数据通信的基本前提,而二连通性是网络在有节点失效的情况下保持拓扑连通的基本条件.为了有效构建具有容错能力的网络拓扑结构,本文针对节点随机均匀分布的一维Ad Hoc网络模型,基于割点概率,分析了一维Ad Hoc网络的二连通性,给出了网络的二连通性与网络分布区域大小、节点数目、通信半径间的解析关系.利用该结论,合理配置网络参数,能够有效优化网络的拓扑结构.仿真实验结果表明,理论值与仿真值吻合良好,验证了所得结论的正确性.     

IAMMAC: an interference‐aware multichannel MAC protocol for wireless sensor–actor networks

In this paper, we discuss an interference aware multichannel MAC (IAMMAC) protocol assign channels for communication in wireless sensor‐actor networks. An actor acts as a cluster head for k‐hop sensors and computes the shortest path for all the sensors. Then, the actor partitions the cluster into multiple subtrees and assigns a noninterference channel to each subtree. The actor 1‐hop sensors are represented as relay nodes. The actor selects a relay node as a backup cluster head (BCH) based on the residual energy and node degree. After selecting a BCH from the relay nodes, the actor broadcast this information to the remaining relay nodes using the common control channel. The relay sensors use the same channel of BCH to communicate with it. However, the other cluster members do not change their data channel. Further, interference‐aware and throughput‐aware multichannel MAC protocol is also proposed for actor–actor coordination. The performance of the proposed IAMMAC protocol is analyzed using standard network parameters such as packet delivery ratio, goodput, end‐to‐end delay, and energy dissipation in the network. The obtained simulation results indicate that the IAMMAC protocol has superior performance as compared with the existing MAC protocols. Copyright © 2015 John Wiley & Sons, Ltd.     

Cut-Set Intersections and Node Partitions

With any cut set of a graph can be associated a partition of the nodes into two cells. We show that each cut-set intersection term in the cut-set inclusion and exclusion formula can be associated with a k-cell partition of the nodes. Thus, the number of distinct terms in the cut-set inclusion and exclusion formula cannot exceed the number of partitions of the set of nodes. This leads to a simplified formula for graph reliability: the node partition formula, When finding the overall reliability in complete graphs no terms cancel, thus the number of terms is equal to the number of partitions. In other graphs we show that the number of non-cancelling terms in the cut-set inclusion and exclusion formula is equal to the number of minimal partition sets of the graph. It follows that cut-set inclusion and exclusion is inherently an inefficient method for the exact calculation of network reliability measures.     

Predicting group partitions in mobile ad hoc networks

Group mobility is prevalent in many mobile ad hoc network applications such as disaster recovery, military actions, etc., and group partitions are unavoidable in such kinds of dynamic networks. Group partition may occur when mobile nodes move in diverse mobility patterns and causes the network to be partitioned into disconnected components. It may result in severe link disconnections, which then interrupt intergroup communications. By examining the group mobility pattern, we can predict the possibility of network partitions, and thus minimize the amount of communication disruptions. In this paper, we introduce a system for predicting potential group partitions in mobile ad hoc networks. On the basis of historical group mobility information, a quadratic regression model is formulated to predict the direction and speed of a group's movement. A group's micromovement is ignored and is replaced by significant linear displacement to measure its mobility to improve the prediction accuracy. We also discuss the notion of safe distance between adjacent groups, based on which the time duration before the occurrence of group partitioning can be measured. Experimental results show that our proposed prediction method demonstrates its effectiveness and efficiency in group partition predictions such that remedial actions can be taken in advance to avoid network disconnection. Copyright © 2011 John Wiley & Sons, Ltd.     

An Automatic Presence Service for Low Duty-Cycled Mobile Sensor Networks

We consider providing presence service for duty-cycled wireless sensor networks through a multihop approach. The presence service is to ensure automatic network monitoring by which each node would know whether the sink node is reachable or not. Towards providing such presence service, we tackle three problems: 1) efficient neighbor discovery due to not-always-awake nature of duty-cycling and the mobile environment, 2) light presence message passing from the sink node to all reachable nodes given broadcasting is expensive and difficult in an embedded duty-cycling network, and 3) automatic network monitoring if there is node failure and network partition. In our protocol, in order to save power consumption, an online node which is reachable from the sink node only book-keeps the broadcast schedule of its parent in a breadth-first-search spanning tree in order to trace the online status all along. The offline node which is not reachable from the sink node stays awake periodically based on quorum-based wakeup scheduling, and probes the beacons which may come from online nodes. The presence protocol can automatically detect link failure or network partition, and it can also automatically recover online status for each sensor node if there is a path to the sink node, which is significant for applications that are sensitive to end-to-end latency constraints. The presence protocol proposed is implemented through a layered approach so that it is independent from any specific MAC and routing protocols. We make extensive simulations in order to validate the energy efficiency and reliability of our design.     

Co-operation Enforcing Reputation-Based Detection Techniques and Frameworks for Handling Selfish Node Behaviour in MANETs: A Review

In Mobile Ad hoc Network, co-operation between mobile nodes is inevitable for enabling reliable network connectivity due to the absence of pre-deployed infrastructure. In such a network, mobile nodes spend significant amount of energy for detecting routes and forwarding packets in order to enforce co-operation. The energy drain of mobile nodes due to the above fact induces them to refuse forwarding of packets for their neighbouring nodes in order to participate in the network. The mobile nodes that forward their own packets but drop the packets received from neighbours are known as selfish nodes. Detecting selfish nodes is one of the most challenging issues that need to be addressed for enforcing co-operation. The core objective of this research work is to essentially identify and highlights various reputation-based selfish node mitigation approaches available in the literature with their merits and limitations. This paper presents context-aware reputation-based selfish node mitigation approaches that are classified into three categories viz., History-based reputation mechanism, Condition probability-based reputation mechanism and Futuristic probability-based reputation mechanism. This paper further presents a review on a number of selfish node mitigation frameworks and also aims in emphasizing the role of statistical reliability co-efficient that could aid in effective and efficient mitigation of selfish nodes.     

Movement control algorithms for realization of fault-tolerant ad hoc robot networks

Autonomous and semi-autonomous mobile multirobot systems require a wireless communication network in order to communicate with each other and collaboratively accomplish a given task. A multihop communications network that is self-forming, self-healing, and self-organizing is ideally suited for such mobile robot systems that exist in unpredictable and constantly changing environments. However, since every node in a multihop (or ad hoc) network is responsible for forwarding packets to other nodes, the failure of a critical node can result in a network partition. Hence, it is ideal to have an ad hoc network configuration that can tolerate temporary failures while allowing recovery. Since movement of the robot nodes is controllable, it is possible to achieve such fault-tolerant configurations by moving a subset of robots to new locations. In this article we propose a few simple algorithms for achieving the baseline graph theoretic metric of tolerance to node failures, namely, biconnectivity. We formulate an optimization problem for the creation of a movement plan while minimizing the total distance moved by the robots. For one-dimensional networks, we show that the problem of achieving a biconnected network topology can be formulated as a linear program; the latter lends itself to an optimal polynomial time solution. For two-dimensional networks the problem is much harder, and we propose efficient heuristic approaches for achieving biconnectivity. We compare the performance of the proposed algorithms with each other with respect to the total distance moved metric using simulations.     

伯努利节点网络模型的拓扑鲁棒性分析方法

基于网络连通和恢复能力提出连接鲁棒性和恢复鲁棒性两种测度指标,根据随机故障和恶意攻击两种网络失败类型将连接鲁棒性分为随机故障鲁棒性和恶意攻击鲁棒性,将恢复鲁棒性分为随机故障节点恢复鲁棒性、随机故障边恢复鲁棒性、恶意攻击节点恢复鲁棒性、恶意攻击边恢复鲁棒性,并给出了这六个测度指标的确切定义.利用这六个测度指标分析了伯努利...     

基于能量和密度的WSNs动态分区成簇路由算法

针对传统的层次型网络存在的分簇不合理和能耗不均衡等问题,提出了一种基于能量和密度的动态非均匀分区成簇路由算法。该算法先根据节点与基站之间的距离将网络合理地进行动态的区域划分,在区域内成簇,使靠近基站的簇规模小于距离基站较远的簇,减少靠近基站的簇首负担和能量消耗;通过综合考虑节点剩余能量和节点密度等因素来优化簇的非均匀划分和簇首的选择,簇首间采取基于数据聚合的多跳传输机制。仿真结果表明,与经典路由算法LEACH相比,该算法能有效均衡节点能耗,延长网络生命周期。     

PROTECTORATION: a fast and efficient multiple-failure recovery technique for resilient packet ring using dark fiber

The two protection methods wrapping and steering used in IEEE 802.17 resilient packet ring (RPR) provide fast but very inefficient and limited network failure recovery. Due to the increased length of the backup path, RPR suffers from high traffic loss, a decreased throughput-delay performance, and the lack of resilience against multiple link and/or node failures. To achieve an improved resilience, interconnecting a subset of the ring nodes by means of a dark-fiber single-hop star wavelength division multiplexing (WDM) network is proposed. In doing so, the ring network is divided into separate domains, each being fully recoverable from a single link or node failure without losing full network connectivity. A novel hybrid fault recovery technique, termed protectoration, is proposed and examined by means of probabilistic analysis and simulation in terms of stability, channel utilization, and throughput-delay performance. The proposed protectoration technique 1) combines the fast recovery time of protection and the bandwidth efficiency of restoration, 2) provides full recovery from multiple link and node failures, 3) builds on both wrapping and steering protection methods of RPR and, thus, allows for an evolutionary upgrade of existing RPR networks, and 4) does not require the convergence of routing protocols in response to failures and, thus, improves the routing stability and network availability. Numerical investigations in this paper show that the location of failures has a strong impact on the network performance. For a given failure location, the protectoration technique is able to accommodate multiple ring failures without significant performance loss.     

Exploiting Selfishness,Altruism and Common Welfare to Enhance Performance of Routing Protocols for Mobile Ad hoc Networks

Mobile Ad hoc Networks are sensitive to selfish behavior that may occur due to restricted power or other resources. Several approaches have been investigated so far to address this problem. In many of them, upon detection, a selfish node is punished with isolation from network services access and in most cases with no possibility for redemption. In this paper, we show that selfish behavior can be exploited to improve network performance. We modify an existing routing protocol by introducing an altruism coefficient to model the overall satisfaction of every node from the network services. When the altruism coefficient is increased, the selfish behavior is decreased. We extend our approach by introducing a common welfare factor, which actually enforces the nodes to cooperate when the network connectivity is critical. A network simulator is utilized to show the impact of our schemes on the performance of the routing protocol when selfish nodes are present in the network.

     

Improving reliability through architecture partitioning intelecommunication networks

The paper presents a new switching architecture to improve telecommunications reliability. The architecture is partitioned depending on the type of network used, reliability requirements, and expected traffic in the network. The partition size depends on the network reliability, bandwidth, and traffic. A reliability model for a telecommunication architecture is used to partition the network and to improve end-to-end reliability. The model defines critical components in the networking architecture and their connections. The component connections permit the propagation of faults from the component in which the fault originates to the other components. This propagation can cause failures in the chain (or in the tree) of components. The partitioned architecture limits the propagation of faults, simplifies fault detection, and preserves reliability of the remaining partitions. Examples of different networks are used to show the applications of the model     

Detouring dynamic routing holes in stationary wireless sensor networks in the presence of temporarily misbehaving nodes

In this work, we propose a scheme, named BRIDGE , to bypass dynamic routing holes arising in stationary wireless sensor networks in the presence of temporarily misbehaving nodes such as dumb 1 , 2 or transfaulty nodes. The affected nodes behave normally after the resumption of favorable environmental conditions. Therefore, both dumb and transfaulty behaviors of sensor nodes are dynamic in nature. The nodes in these networks get temporarily isolated from the network, when they behave as dumb or transfaulty. Because of the presence of nodes with such behavior, dynamic communication holes may occur in the network, which are formed or removed and thus increase or decrease in size with time. Connectivity re‐establishment procedures can mitigate holes by re‐connecting isolated nodes with the network after activating the intermediate sleep nodes, adjusting the communication range of intermediate nodes, or by using an alternative communication mode. However, such procedures cannot always re‐establish connectivity because of the lack of neighbor nodes in reduced or adjusted communication range. Therefore, routing schemes using greedy forwarding approaches need to bypass holes to avoid the data packets from getting stuck at the boundary nodes and efficiently delivering them to the sink. However, the existing hole avoidance schemes consider holes as static. The proposed scheme, BRIDGE , detects hole boundary and bypasses routing traffics in the dynamic hole scenario. In the proposed scheme, a boundary node selects the next hop based on the minimum distance from all the neighbor nodes to the destination node, although this minimum distance is more than the distance to the destination from the node itself. Simulation results show that the performance of the proposed scheme degrades with the increase in hole area. Copyright © 2015 John Wiley & Sons, Ltd.     

基于k-度匿名的社会网络隐私保护方法

针对当前社会网络的匿名化隐私保护方法存在信息损失量巨大、网络关系结构被改变严重等问题,提出一种保持网络结构稳定的k-度匿名隐私保护模型SimilarGraph,运用动态规划方法对社会网络按照节点度序列进行最优簇划分,然后采用移动边操作方式重构网络图以实现图的k-度匿名化。区别于传统的数值扰乱或图修改如随机增加、删除节点或边等方法,该模型的优势在于既不增加网络边数和节点数,也不破坏网络原有连通性和关系结构。实验结果表明,SimilarGraph匿名化方法不仅能有效提高网络抵御度属性攻击的能力,并且还能保持网络结构稳定,同时具有较理想的信息损失代价。     

Novel approach for replacement of a failure node in wireless sensor network

In the recent years, there has been a growing interest in wireless sensor networks (WSN). Network’s lifetime depends on energy efficiency and load balancing where connectivity is a very important factor. However, such connectivity can be lost due to the failure of some sensor nodes which creates disruptions to the network operations, lead to a reconfiguration of the network by generating energy losses, or in another case, the network mission fails. Energy conservation is a very important problem in WSN. In this paper, we propose a new solution for the connectivity problem when failure nodes are considered. The replacement of failed nodes is done in two phases: the first one is the search of redundant nodes using the clusterheads; the second phase is a restoration of connectivity. Performance evaluation of the proposed replacement approach shows that the results are globally satisfactory.