Distributed $k$-Connectivity Restoration for Fault Tolerant Wireless Sensor and Actuator Networks: Algorithm Design and Experimental Evaluations

Akram, Vahid Khalilpour; Dağdeviren, Orhan; Tavlı, Bülent

doi:10.1109/tr.2020.2970268

Cited by 27 publications

(9 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [45], an improved non-dominated sorting genetic algorithm II (NSGA-II) algorithm was proposed to solve the connectivity problem of sensor networks to improve the network lifetime. A distributed connectivity restoration approach for a heterogeneous WSN was proposed in [46], which effectively improves the robustness of the network.…”

Section: Optimal Wsns Deploymentmentioning

confidence: 99%

Balancing the trade-off between cost and reliability for wireless sensor networks: a multi-objective optimized deployment method

Chen

et al. 2022

Appl Intell

View full text Add to dashboard Cite

show abstract

Section: Optimal Wsns Deploymentmentioning

confidence: 99%

Balancing the trade-off between cost and reliability for wireless sensor networks: a multi-objective optimized deployment method

Chen

et al. 2022

Appl Intell

View full text Add to dashboard Cite

show abstract

“…In the worst case,

motes may move to the new position, which increases the time complexity of TAPU to

. A distributed approach to k -connectivity restoration has been proposed in [ 63 ]. This approach models a heterogeneous WSN, in which some nodes are mobile and some nodes are static.…”

Section: Related Workmentioning

confidence: 99%

PINC: Pickup Non-Critical Node Based k-Connectivity Restoration in Wireless Sensor Networks

Akram

Dagdeviren

Dağdeviren

et al. 2021

Sensors

Self Cite

View full text Add to dashboard Cite

A Wireless Sensor Network (WSN) is connected if a communication path exists among each pair of sensor nodes (motes). Maintaining reliable connectivity in WSNs is a complicated task, since any failure in the nodes can cause the data transmission paths to break. In a k-connected WSN, the connectivity survives after failure in any k-1 nodes; hence, preserving the k-connectivity ensures that the WSN can permit k-1 node failures without wasting the connectivity. Higher k values will increase the reliability of a WSN against node failures. We propose a simple and efficient algorithm (PINC) to accomplish movement-based k-connectivity restoration that divides the nodes into the critical, which are the nodes whose failure reduces k, and non-critical groups. The PINC algorithm pickups and moves the non-critical nodes when a critical node stops working. This algorithm moves a non-critical node with minimum movement cost to the position of the failed mote. The measurements obtained from the testbed of real IRIS motes and Kobuki robots, along with extensive simulations, revealed that the PINC restores the k-connectivity by generating optimum movements faster than its competitors.

show abstract

“…A restricted version of the k-connectivity restoration problem in heterogeneous mobile networks is presented in [34]. It is assumed that the network has a limited number of mobile nodes, which simplifies the model and reduces the problem complexity by restricting the number of possible solutions.…”

Section: Related Workmentioning

confidence: 99%

A Coverage-Aware Distributed k-Connectivity Maintenance Algorithm for Arbitrarily Large k in Mobile Sensor Networks

Akram¹,

Dağdeviren²,

Tavlı³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Mobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless sensor networks. MSNs can be deployed in harsh environments, where failures in some nodes can partition MSNs into disconnected network segments or reduce the coverage area. A k-connected network can tolerate at least k-1 arbitrary node failures without losing its connectivity. In this study, we present a coverage-aware distributed k-connectivity maintenance (restoration) algorithm that generates minimum-cost movements of active nodes after a node failure to preserve a persistent k value subject to a coverage conservation criterion. The algorithm accepts a coverage conservation ratio (as a trade-off parameter between coverage and movements) and facilitates coverage with the generated movements according to this value. Extensive simulations and testbed experiments reveal that the proposed algorithm restores k-connectivity more efficiently than the existing restoration algorithms. Furthermore, our algorithm can be utilized to maintain k-connectivity without sacrificing the coverage, significantly.

show abstract

Distributed $k$-Connectivity Restoration for Fault Tolerant Wireless Sensor and Actuator Networks: Algorithm Design and Experimental Evaluations

Cited by 27 publications

References 47 publications

Balancing the trade-off between cost and reliability for wireless sensor networks: a multi-objective optimized deployment method

Balancing the trade-off between cost and reliability for wireless sensor networks: a multi-objective optimized deployment method

PINC: Pickup Non-Critical Node Based k-Connectivity Restoration in Wireless Sensor Networks

A Coverage-Aware Distributed k-Connectivity Maintenance Algorithm for Arbitrarily Large k in Mobile Sensor Networks

Contact Info

Product

Resources

About