A Case study for choosing proper relocation algorithms to recover large scale coverage hole(s) in wireless sensor networks

Ali Rafiei, Mehran Abolhasan, Daniel Franklin, Stephen Smith

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

Abstract

Coverage holes as large scale en mass and correlated node failures in wireless sensor networks, not only disturb the normal operation and functionality of networks, but also may endanger network’s integrity. Recent trends to use relocation of currently deployed nodes have attracted attention especially where manual addition of nodes are neither feasible nor economical in many applications. The transition from centralized to distributed node relocation algorithm gradually paves away for applications in which nodes are deployed in harsh and hostile environments in absence of central supervision and control. Although, many different relocation algorithms have been devised to address their given applications’ challenges and requirements and they are efficient in reaching their design goals, they may not be similarly responsive to unpredicted and different circumstances may occur in the network. This paper, demonstrates one of such case, DSSA (Distributed Self-Spreading Algorithm) that is mainly applied for balancing node deployments and recovery of small coverage holes. It is shown here that DSSA is not able to fully recover large scale coverage holes even if all nodes participate in recovery process and relocate with sufficient number of iterations.
LanguageEnglish
Title of host publicationProceedings of the first workshop on advances in real-time information networks 2013
Place of PublicationSydney
PublisherUTS ePress
Pages1-4
Number of pages4
Publication statusPublished - 2013
EventWorkshop on advances in real-time information networks (1st : 2013) - Sydney
Duration: 7 Aug 201310 Aug 2013

Workshop

WorkshopWorkshop on advances in real-time information networks (1st : 2013)
CitySydney
Period7/08/1310/08/13

Fingerprint

Relocation
Wireless sensor networks
Recovery

Cite this

Rafiei, A., Abolhasan, M., Franklin, D., & Smith, S. (2013). A Case study for choosing proper relocation algorithms to recover large scale coverage hole(s) in wireless sensor networks. In Proceedings of the first workshop on advances in real-time information networks 2013 (pp. 1-4). Sydney: UTS ePress.
Rafiei, Ali ; Abolhasan, Mehran ; Franklin, Daniel ; Smith, Stephen. / A Case study for choosing proper relocation algorithms to recover large scale coverage hole(s) in wireless sensor networks. Proceedings of the first workshop on advances in real-time information networks 2013. Sydney : UTS ePress, 2013. pp. 1-4
@inproceedings{a61bd6d0adcf421488fb4f752cd9761e,
title = "A Case study for choosing proper relocation algorithms to recover large scale coverage hole(s) in wireless sensor networks",
abstract = "Coverage holes as large scale en mass and correlated node failures in wireless sensor networks, not only disturb the normal operation and functionality of networks, but also may endanger network’s integrity. Recent trends to use relocation of currently deployed nodes have attracted attention especially where manual addition of nodes are neither feasible nor economical in many applications. The transition from centralized to distributed node relocation algorithm gradually paves away for applications in which nodes are deployed in harsh and hostile environments in absence of central supervision and control. Although, many different relocation algorithms have been devised to address their given applications’ challenges and requirements and they are efficient in reaching their design goals, they may not be similarly responsive to unpredicted and different circumstances may occur in the network. This paper, demonstrates one of such case, DSSA (Distributed Self-Spreading Algorithm) that is mainly applied for balancing node deployments and recovery of small coverage holes. It is shown here that DSSA is not able to fully recover large scale coverage holes even if all nodes participate in recovery process and relocate with sufficient number of iterations.",
author = "Ali Rafiei and Mehran Abolhasan and Daniel Franklin and Stephen Smith",
year = "2013",
language = "English",
pages = "1--4",
booktitle = "Proceedings of the first workshop on advances in real-time information networks 2013",
publisher = "UTS ePress",

}

Rafiei, A, Abolhasan, M, Franklin, D & Smith, S 2013, A Case study for choosing proper relocation algorithms to recover large scale coverage hole(s) in wireless sensor networks. in Proceedings of the first workshop on advances in real-time information networks 2013. UTS ePress, Sydney, pp. 1-4, Workshop on advances in real-time information networks (1st : 2013), Sydney, 7/08/13.

A Case study for choosing proper relocation algorithms to recover large scale coverage hole(s) in wireless sensor networks. / Rafiei, Ali; Abolhasan, Mehran; Franklin, Daniel; Smith, Stephen.

Proceedings of the first workshop on advances in real-time information networks 2013. Sydney : UTS ePress, 2013. p. 1-4.

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

TY - GEN

T1 - A Case study for choosing proper relocation algorithms to recover large scale coverage hole(s) in wireless sensor networks

AU - Rafiei, Ali

AU - Abolhasan, Mehran

AU - Franklin, Daniel

AU - Smith, Stephen

PY - 2013

Y1 - 2013

N2 - Coverage holes as large scale en mass and correlated node failures in wireless sensor networks, not only disturb the normal operation and functionality of networks, but also may endanger network’s integrity. Recent trends to use relocation of currently deployed nodes have attracted attention especially where manual addition of nodes are neither feasible nor economical in many applications. The transition from centralized to distributed node relocation algorithm gradually paves away for applications in which nodes are deployed in harsh and hostile environments in absence of central supervision and control. Although, many different relocation algorithms have been devised to address their given applications’ challenges and requirements and they are efficient in reaching their design goals, they may not be similarly responsive to unpredicted and different circumstances may occur in the network. This paper, demonstrates one of such case, DSSA (Distributed Self-Spreading Algorithm) that is mainly applied for balancing node deployments and recovery of small coverage holes. It is shown here that DSSA is not able to fully recover large scale coverage holes even if all nodes participate in recovery process and relocate with sufficient number of iterations.

AB - Coverage holes as large scale en mass and correlated node failures in wireless sensor networks, not only disturb the normal operation and functionality of networks, but also may endanger network’s integrity. Recent trends to use relocation of currently deployed nodes have attracted attention especially where manual addition of nodes are neither feasible nor economical in many applications. The transition from centralized to distributed node relocation algorithm gradually paves away for applications in which nodes are deployed in harsh and hostile environments in absence of central supervision and control. Although, many different relocation algorithms have been devised to address their given applications’ challenges and requirements and they are efficient in reaching their design goals, they may not be similarly responsive to unpredicted and different circumstances may occur in the network. This paper, demonstrates one of such case, DSSA (Distributed Self-Spreading Algorithm) that is mainly applied for balancing node deployments and recovery of small coverage holes. It is shown here that DSSA is not able to fully recover large scale coverage holes even if all nodes participate in recovery process and relocate with sufficient number of iterations.

M3 - Conference proceeding contribution

SP - 1

EP - 4

BT - Proceedings of the first workshop on advances in real-time information networks 2013

PB - UTS ePress

CY - Sydney

ER -

Rafiei A, Abolhasan M, Franklin D, Smith S. A Case study for choosing proper relocation algorithms to recover large scale coverage hole(s) in wireless sensor networks. In Proceedings of the first workshop on advances in real-time information networks 2013. Sydney: UTS ePress. 2013. p. 1-4