Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks

Abbasi, Ameer Ahmed; Younis, Mohamed; Akkaya, Kemal

doi:10.1109/tpds.2008.246

Cited by 228 publications

(195 citation statements)

References 20 publications

Supporting

Mentioning

194

Contrasting

Unclassified

Order By: Relevance

“…Consider n mobile sensors placed independently at random with the uniform distribution on a barrier represented as the unit line segment [0,1]. The sensors have identical sensing radius, say r. When a sensor is displaced on the line a distance equal to d it consumes energy (in movement) which is proportional to some (fixed) power a > 0 of the distance d traveled.…”

Section: Introductionmentioning

confidence: 99%

On the displacement for covering a unit interval with randomly placed sensors

Kapelko

Kranakis

2016

Information Processing Letters

View full text Add to dashboard Cite

Consider n mobile sensors placed independently at random with the uniform distribution on a barrier represented as the unit line segment [0,1]. The sensors have identical sensing radius, say r. When a sensor is displaced on the line a distance equal to d it consumes energy (in movement) which is proportional to some (fixed) power a > 0 of the distance d traveled. The energy consumption of a system of n sensors thus displaced is defined as the sum of the energy consumptions for the displacement of the individual sensors.We focus on the problem of energy efficient displacement of the sensors so that in their final placement the sensor system ensures coverage of the barrier and the energy consumed for the displacement of the sensors to these final positions is minimized in expectation. In particular, we analyze the problem of displacing the sensors from their initial positions so as to attain coverage of the unit interval and derive trade-offs for this displacement as a function of the sensor range. We obtain several tight bounds in this setting thus generalizing several of the results of [10] to any power a > 0.

show abstract

Section: Introductionmentioning

confidence: 99%

On the displacement for covering a unit interval with randomly placed sensors

Kapelko

Kranakis

2016

Information Processing Letters

View full text Add to dashboard Cite

show abstract

“…As mentioned before, only a cut vertex may break network connectivity. Many approaches decide whether a node is a cut vertex firstly and deal with cut vertex failure only, such as DARA [1], PDARA [2], PCR [16], and NNN [13]. DARA identifies a cut vertex through two-hop neighborhood information.…”

Section: Related Workmentioning

confidence: 99%

“…Different from DARA [1] and DCR [17] which select a backup node based on distance and node degree, HCR selects a backup node based on the minimum moving cost. The minimum moving cost of all backup nodes should also be the failure cost of the failure node.…”

Section: Proactive Backup Node Selectionmentioning

confidence: 99%

Hybrid connectivity restoration in wireless sensor and actor networks

Yan

Luo

Tian

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

Wireless sensor and actor networks are becoming more and more popular in the recent years. Each WSAN consists of numerous sensors and a few actors working collaboratively to carry out specific tasks. Unfortunately, actors are prone to failure due to harsh deployment environments and constrained power, which may break network connectivity resulting in disjoint components. Thus, maintaining the connectivity among actors is especially important. This paper proposes hybrid connectivity restoration (HCR), which integrates proactive selection and reactive motion. An actor protectively selects a backup node through its one-hop neighbor table and informs the backup node to supervise its stage. Once it fails, the backup node moves to the best position to restore the connectivity of the failed node's neighbors reactively. This triggers a local recovery process at the backup node, which is repeated until network connectivity is restored. In order to minimize travel distance, HCR selects the backup node which moves the shortest distance to restore connectivity. Furthermore, HCR opts to reduce the number of messages by just informing the failure to its backup node. The correctness and effectiveness of HCR are validated through both theoretical analysis and simulations.

show abstract

“…2) moving mobile nodes Sookyoung and Mohamed [3] promote an effective strategy that optimizes relay node placement using minimum steiner tree for restoring the connectivity among the segment by populating the least number of relay nodes, moves relay nodes from each segment toward the center of the deployment area. In Literature [5], Abbasi focuses on movement-assisted connectivity restoration in WSANs, and presents a Distributed Actor Recovery Algorithm (DARA), which opts to efficiently restore the connectivity of the inter-actor network that has been affected by the failure of an actor. In literature [10], a mathematical model that minimizes the total travel distance for connecting a given number of partitions is proposed.…”

Section: Related Workmentioning

confidence: 99%

Obstacle-Avoiding Connectivity Restoration based on Node’S Movement and Deploying New Relay Node in Disjoint Mobile Sensor Networks

Wu¹,

Chen²,

Chen³

2017

dtcse

View full text Add to dashboard Cite

Abstract. Mobile sensor networks (MSNs) have many applications in recent years, especially in some harsh environment, such as coastal and border protection, search-and-rescue, battlefield reconnaissance and so on. MSNs may suffer from a large-scale damage which causes many nodes to fail and the network to get partitioned into isolate islands. So, in order to avoid negative effects on the application, restoring network connectivity is crucial in such case. In this paper, we propose a novel method, OACRNMDR, which avoid obstacle to restore the networks based on deploying new relay node and node's movement. In OACRNMDR mainly include three phases: firstly, detecting the boundary nodes of every isolate island, then moving mobile nodes that avoid obstacle to the appropriate location to restore the connectivity and finally deploying new relay node to restore the connection of the entire network. Extensive simulation experiments demonstrate that the proposed method can guarantee network connectivity and reduce the total distance in practical environment and the number of deploying relay node.

show abstract

Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks

Cited by 228 publications

References 20 publications

On the displacement for covering a unit interval with randomly placed sensors

On the displacement for covering a unit interval with randomly placed sensors

Hybrid connectivity restoration in wireless sensor and actor networks

Obstacle-Avoiding Connectivity Restoration based on Node’S Movement and Deploying New Relay Node in Disjoint Mobile Sensor Networks

Contact Info

Product

Resources

About