Distributed Recovery of Actor Failures in Wireless Sensor and Actor Networks

Akkaya, Kemal; Thimmapuram, Anuradha; Şenel, Fatih Ahmet; Uludag, Suleyman

doi:10.1109/wcnc.2008.436

Cited by 94 publications

(74 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We later will also point out that the definition of periphery [1] is also problematic. [1] also employs the cut-vertex detection method proposed by [2], which probabilistically determines whether a node is a cut vertex or not.…”

Section: Review Of Results and Definitions In [1]mentioning

confidence: 99%

On “Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks”

Wang

Mao

Tang

et al. 2011

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-In wireless sensor and actor networks (WSANs), a set of static sensor nodes and a set of (mobile) actor nodes form a network that performs distributed sensing and actuation tasks. In [1], Abbasi et al. presented DARA, a Distributed Actor Recovery Algorithm, which restores the connectivity of the inter-actor network by efficiently relocating some mobile actors when failure of an actor happens. To restore 1-and 2-connectivity requirements, two algorithms are developed in [1]. Their basic idea is to find the smallest set of actors that needs to be repositioned to restore the required level of connectivity, with the objective to minimize the movement overhead of relocation. Here, we show that the algorithms proposed in [1] will not work smoothly in all scenarios and we give counterexamples for some algorithms and theorems proposed in [1]. We then present a general actor relocation problem and propose methods that will work correctly for several subsets of the problems. Specifically, our method does result in an optimum movement strategy with minimum movement overhead for the problems studied in [1].

show abstract

Section: Review Of Results and Definitions In [1]mentioning

confidence: 99%

On “Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks”

Wang

Mao

Tang

et al. 2011

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…PADRA assigns for every cut-vertex Ai that acts as a failure operator that starts the method of recovery if Ai fails [10]. The perfect handler can act as dominate neighbour for Ai which may simply substitute Ai.…”

Section: Partition Detection-recovery Algorithm (Padra)mentioning

confidence: 99%

Techniques for Tolerating Node Failures in WSN

2017

IJLTET

View full text Add to dashboard Cite

“…The idea of DARAs is to identify the least number of actor nodes in order to establish the connectivity between disjoint network partitions. DARAs have four main drawbacks as claimed by authors of [19,20]: (i) DARAs do not provide any mechanism to detect cut-vertices. It is assumed that this information is available with each node which requires complete knowledge of whole topology, (ii) the selection of failure handler (FH) to replace the failed node is done based on the basis of neighbours' degree which may require sometimes excessive replacement until a leaf node is found, thereby increasing maximum movement distance of all individual actors (MMI), which reduces the network lifetime, (iii) the best candidate selection is done reactively which requires a lot of calculation and it is very critical for delay sensitive applications, (iv) The major problem occurs with cyclic network topologies.…”

Section: Related Studymentioning

confidence: 99%

“…Kemal et al [19,20] presented the new distributed partition detection and recovery algorithm (PADRA, PADRA+) to handle the lost connectivity problem through detection of possible partitions after the failure has occurred. The authors restore the lost network connectivity through controlled relocation of movable nodes.…”

Section: Related Studymentioning

confidence: 99%

Node Stability Aware Energy Efficient Single Node Failure Recovery Approach for WSANs

Ranga

Dave

Verma

2016

MJCS

View full text Add to dashboard Cite

The inter-actor connectivity is absolutely crucial in wireless sensor and actor networks for timely responses to events generated in the network. Due to the sparse nature of the network, the failure of one or more actor nodes results in network partitioning problem very frequently. To provide effective connectivity between disjoint segments, a self-healing solution is required with a small number of involved actor nodes. Also, their travelling distances should be small. To find stable actor nodes with their small moving distance for recovery is an NP-hard problem for large scale problems. However, the present literature requires broadcasting of route request packets to find the nodes or location for recovery, which consumes more network energy and consequently decreases the network lifetime. In this study, we propose an algorithm called Node Stability aware Connectivity Restoration Algorithm (NSCRA) to tackle such network partitioning problem in an energy efficient way with stable actor nodes. The stability of node(s) is calculated by using controlled packet forwarding probability (i.e. node route request) that is based upon neighbour energy decay rate. The selection of node is based on its backup power to avoid further network partitioning (i.e. overlapped or collocated failures) during recovery. Our proposed approach performs not only energy efficient recovery due to the participation of stable nodes, but also reduces the message overhead of the network. The experimental simulation results show that proposed approach outperforms other existing state-of-the-art approaches.Keywords: Energy decay rate, Flooding, Node stability, Residual power, Message forwarding probability INTRODUCTIONWireless Sensor and Actor Networks (WSANs) are characterized by dense deployment of energy constrained sensors with a small number of backbone actor nodes as shown in Fig. 1. Sensors are stationary, inexpensive, highly energyconstrained and having limited data processing capabilities. On the other hand, actors are more capable nodes having on demand mobility relatively more on-board energy supply, richer computational and communication resources. The communication range of an actor refers to the maximum Euclidean distance that its radio can reach and is assumed to be larger than that of sensors range ( . . > 2 ). These networks are tremendously useful in various areas of human life, especially those serving in remote and unsupervised environments in which human intervention is extremely risky or impractical. One specific use case of WSANs is providing communication services between the members of a rescue team in disaster like scenario [1]. In such scenario, saving of human life depends on the proper functioning of the communication network so that the information about survivors can be delivered in real time and accordingly rescue operation may be performed.A typical problem of WSANs in such environments is a network partitioning problem due to failure of one or more actor nodes, i.e. when some part of the network is isola...

show abstract

Distributed Recovery of Actor Failures in Wireless Sensor and Actor Networks

Cited by 94 publications

References 6 publications

On “Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks”

On “Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks”

Techniques for Tolerating Node Failures in WSN

Node Stability Aware Energy Efficient Single Node Failure Recovery Approach for WSANs

Contact Info

Product

Resources

About