Cooperative recovery of coverage holes in WSNs via disjoint spanning trees

Ali Rafiei, Mehran Abolhasan, Daniel R. Franklin, Farzad Safaei, Stephen Smith, Wei Ni

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

Abstract

Large scale coverage holes (CHs) resulting from correlated node failures, can significantly degrade quality of service and also jeopardise the integrity of WSNs. In the absence of centralised control, the distributed relocation of deployed nodes becomes a promising solution especially in harsh and hostile environments. In this paper, a distributed method is proposed that enables a network to partially or entirely repair itself through a collection of distributed movements of disjoint spanned trees (DS-Trees) towards the CHs. DS-Trees are spanned based on the nodes distances from the CHs, which are autonomously perceived by the nodes and their one-hop neighbours. DS-Trees around the CHs are spanned in a downstream style outwards from the holes, as nodes select their parents based on the minimum distance to the CH from their neighbours; nodes then decide whether or not to follow the movements of their DS-Trees parents. To examine the efficiency of the proposed model, its performance is compared with two Voronoi-based and one force-based node relocation algorithms. Results show that the proposed DS-Tree model either outperforms or matches the alternative approaches across a wide range of scenarios.

LanguageEnglish
Title of host publication2017, 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017
Subtitle of host publicationProceedings
EditorsTadeusz A. Wysocki, Beata J. Wysocki
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1-10
Number of pages10
Volume2018-January
ISBN (Electronic)9781538628874
DOIs
Publication statusPublished - 2017
Event11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017 - Surfers Paradise, Australia
Duration: 13 Dec 201715 Dec 2017

Conference

Conference11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017
CountryAustralia
CitySurfers Paradise
Period13/12/1715/12/17

Fingerprint

Relocation
recovery
Recovery
relocation
Quality of service
Repair
integrity

Cite this

Rafiei, A., Abolhasan, M., Franklin, D. R., Safaei, F., Smith, S., & Ni, W. (2017). Cooperative recovery of coverage holes in WSNs via disjoint spanning trees. In T. A. Wysocki, & B. J. Wysocki (Eds.), 2017, 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017: Proceedings (Vol. 2018-January, pp. 1-10). Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ICSPCS.2017.8270473
Rafiei, Ali ; Abolhasan, Mehran ; Franklin, Daniel R. ; Safaei, Farzad ; Smith, Stephen ; Ni, Wei. / Cooperative recovery of coverage holes in WSNs via disjoint spanning trees. 2017, 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017: Proceedings. editor / Tadeusz A. Wysocki ; Beata J. Wysocki. Vol. 2018-January Institute of Electrical and Electronics Engineers (IEEE), 2017. pp. 1-10
@inproceedings{8f3b9b8ac4044894b902267b1701864c,
title = "Cooperative recovery of coverage holes in WSNs via disjoint spanning trees",
abstract = "Large scale coverage holes (CHs) resulting from correlated node failures, can significantly degrade quality of service and also jeopardise the integrity of WSNs. In the absence of centralised control, the distributed relocation of deployed nodes becomes a promising solution especially in harsh and hostile environments. In this paper, a distributed method is proposed that enables a network to partially or entirely repair itself through a collection of distributed movements of disjoint spanned trees (DS-Trees) towards the CHs. DS-Trees are spanned based on the nodes distances from the CHs, which are autonomously perceived by the nodes and their one-hop neighbours. DS-Trees around the CHs are spanned in a downstream style outwards from the holes, as nodes select their parents based on the minimum distance to the CH from their neighbours; nodes then decide whether or not to follow the movements of their DS-Trees parents. To examine the efficiency of the proposed model, its performance is compared with two Voronoi-based and one force-based node relocation algorithms. Results show that the proposed DS-Tree model either outperforms or matches the alternative approaches across a wide range of scenarios.",
author = "Ali Rafiei and Mehran Abolhasan and Franklin, {Daniel R.} and Farzad Safaei and Stephen Smith and Wei Ni",
year = "2017",
doi = "10.1109/ICSPCS.2017.8270473",
language = "English",
volume = "2018-January",
pages = "1--10",
editor = "Wysocki, {Tadeusz A.} and Wysocki, {Beata J.}",
booktitle = "2017, 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017",
publisher = "Institute of Electrical and Electronics Engineers (IEEE)",
address = "United States",

}

Rafiei, A, Abolhasan, M, Franklin, DR, Safaei, F, Smith, S & Ni, W 2017, Cooperative recovery of coverage holes in WSNs via disjoint spanning trees. in TA Wysocki & BJ Wysocki (eds), 2017, 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017: Proceedings. vol. 2018-January, Institute of Electrical and Electronics Engineers (IEEE), pp. 1-10, 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017, Surfers Paradise, Australia, 13/12/17. https://doi.org/10.1109/ICSPCS.2017.8270473

Cooperative recovery of coverage holes in WSNs via disjoint spanning trees. / Rafiei, Ali; Abolhasan, Mehran; Franklin, Daniel R.; Safaei, Farzad; Smith, Stephen; Ni, Wei.

2017, 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017: Proceedings. ed. / Tadeusz A. Wysocki; Beata J. Wysocki. Vol. 2018-January Institute of Electrical and Electronics Engineers (IEEE), 2017. p. 1-10.

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

TY - GEN

T1 - Cooperative recovery of coverage holes in WSNs via disjoint spanning trees

AU - Rafiei, Ali

AU - Abolhasan, Mehran

AU - Franklin, Daniel R.

AU - Safaei, Farzad

AU - Smith, Stephen

AU - Ni, Wei

PY - 2017

Y1 - 2017

N2 - Large scale coverage holes (CHs) resulting from correlated node failures, can significantly degrade quality of service and also jeopardise the integrity of WSNs. In the absence of centralised control, the distributed relocation of deployed nodes becomes a promising solution especially in harsh and hostile environments. In this paper, a distributed method is proposed that enables a network to partially or entirely repair itself through a collection of distributed movements of disjoint spanned trees (DS-Trees) towards the CHs. DS-Trees are spanned based on the nodes distances from the CHs, which are autonomously perceived by the nodes and their one-hop neighbours. DS-Trees around the CHs are spanned in a downstream style outwards from the holes, as nodes select their parents based on the minimum distance to the CH from their neighbours; nodes then decide whether or not to follow the movements of their DS-Trees parents. To examine the efficiency of the proposed model, its performance is compared with two Voronoi-based and one force-based node relocation algorithms. Results show that the proposed DS-Tree model either outperforms or matches the alternative approaches across a wide range of scenarios.

AB - Large scale coverage holes (CHs) resulting from correlated node failures, can significantly degrade quality of service and also jeopardise the integrity of WSNs. In the absence of centralised control, the distributed relocation of deployed nodes becomes a promising solution especially in harsh and hostile environments. In this paper, a distributed method is proposed that enables a network to partially or entirely repair itself through a collection of distributed movements of disjoint spanned trees (DS-Trees) towards the CHs. DS-Trees are spanned based on the nodes distances from the CHs, which are autonomously perceived by the nodes and their one-hop neighbours. DS-Trees around the CHs are spanned in a downstream style outwards from the holes, as nodes select their parents based on the minimum distance to the CH from their neighbours; nodes then decide whether or not to follow the movements of their DS-Trees parents. To examine the efficiency of the proposed model, its performance is compared with two Voronoi-based and one force-based node relocation algorithms. Results show that the proposed DS-Tree model either outperforms or matches the alternative approaches across a wide range of scenarios.

UR - http://www.scopus.com/inward/record.url?scp=85047343988&partnerID=8YFLogxK

U2 - 10.1109/ICSPCS.2017.8270473

DO - 10.1109/ICSPCS.2017.8270473

M3 - Conference proceeding contribution

VL - 2018-January

SP - 1

EP - 10

BT - 2017, 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017

A2 - Wysocki, Tadeusz A.

A2 - Wysocki, Beata J.

PB - Institute of Electrical and Electronics Engineers (IEEE)

ER -

Rafiei A, Abolhasan M, Franklin DR, Safaei F, Smith S, Ni W. Cooperative recovery of coverage holes in WSNs via disjoint spanning trees. In Wysocki TA, Wysocki BJ, editors, 2017, 11th International Conference on Signal Processing and Communication Systems, ICSPCS 2017: Proceedings. Vol. 2018-January. Institute of Electrical and Electronics Engineers (IEEE). 2017. p. 1-10 https://doi.org/10.1109/ICSPCS.2017.8270473