Least Distance Movement Recovery approach for large scale Wireless sensor and actor networks

Alfadhly, Abdullah; Baroudi, Uthman; Younis, Mohamed

doi:10.1109/iwcmc.2011.5982851

Cited by 29 publications

(16 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some approaches like DARA [17] and LDMR [18] base the node participation on having a list of 2-hop neighbors. DARA replaces the failed node "F " with one of its neighbor picked based on the node degree, distance, and ID, respectively.…”

Section: Related Workmentioning

confidence: 99%

Resource efficient connectivity restoration algorithm for mobile sensor/actor networks

Imran

Younis

Haider

et al. 2012

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

Maintaining inter-node connectivity is of a paramount concern in most applications of mobile sensor/actor networks because nodes have to report their data and coordinate their operations. Failure of a node may partition the inter-node network into disjoint segments, and may thus hinder data delivery and inter-node coordination. This article presents a novel resource efficient connectivity restoration algorithm (RECRA) that opts to repair severed connectivity while imposing minimal overhead on the nodes. To avoid overreacting to non-critical failure, RECRA identifies critical/non-critical nodes and only triggers the recovery when a critical node fails. The failure of a node is detected by its neighbors and a recovery procedure is executed based on their proximity, status (critical/noncritical), and transmission range. RECRA prefers to employ a non-critical node and moves it to the place of failed node in order to limit the impact on coverage, scope of the recovery, and strangle successive cascaded relocations. In case non-critical nodes in the neighborhood are not available, the neighbors restore connectivity by exploiting their partially utilized transmission power and repositioning closer to the failed node. RECRA is validated analytically and through extensive simulations. The simulation results confirm the effectiveness of RECRA for both dense and sparse network segments and its performance advantage over contemporary schemes found in the literature.

show abstract

Section: Related Workmentioning

confidence: 99%

Resource efficient connectivity restoration algorithm for mobile sensor/actor networks

Imran

Younis

Haider

et al. 2012

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

“…The selection of the best candidate is based on the lowest node degree and physical proximity to the failure. Alfadhly et al [15] proposed a least distance movement recovery algorithm, in which a set of direct neighbours of the failed node move towards the position of the failed node while its original position is replaced with the nearest non-cut vertex actor.…”

Section: Relocating Existing Nodesmentioning

confidence: 99%

Multi-objective optimized connectivity restoring of disjoint segments using mobile data collectors in wireless sensor network

Kang

Hong²,

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) have been used extensively in a range of applications, which realizes data acquisition, processing, transmission, and analysis in an interesting area. Harsh surroundings and their inherent vulnerability often mean that these networks suffer from simultaneous node failure possibly causing the network to become partitioned into multiple disjointed segments. This in turn can prevent the gathering of data from the sensors and subsequent transmission to the sink, causing the whole network to fail. In this paper, a strategy is presented for restoring multi-objective optimization connectivity of these segments using mobile data collectors (MDCs), by considering the segments as collections of sensor nodes and not as some representative node. Different from existing uses of MDCs for restoration, the delay in data collection and task balance is considered, and the network connectivity and data acquisition path optimization problem are transformed into an improved multi-travelling salesman problem (iMTSP). An improved multi-objective optimization genetic algorithm for solving the optimal collection data collector position and moving paths is proposed, which introduces virtual segments and hierarchical chromosome structure, improved population diversity, and custom coding and decoding. The simulation results show that the proposed method can effectively solve the iMTSP of the Pareto optimal solution and can provide a new strategy for connectivity-restoring technology in WSNs. Compared with NSGA-II, the diversity of the proposed gene algorithm represents a clear improvement.

show abstract

“…Abdullah Alfadhly et al [27] proposed a distributed algorithm called Least Distance Movement Recovery (LDMR) approach which exploits non cut-vertex nodes for the recovery so that no further partition occurs after the movement of involved nodes. The idea is to move the direct neighbours of failed node position and replacing its original with its nearest non cut-vertices.…”

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

Least Distance Movement Recovery approach for large scale Wireless sensor and actor networks

Cited by 29 publications

References 9 publications

Resource efficient connectivity restoration algorithm for mobile sensor/actor networks

Resource efficient connectivity restoration algorithm for mobile sensor/actor networks

Multi-objective optimized connectivity restoring of disjoint segments using mobile data collectors in wireless sensor network

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

Contact Info

Product

Resources

About