Wireless sensor networks fault-tolerance based on graph domination with parallel scatter search
(2020) In Sensors (Switzerland) 20(12).- Abstract
In wireless sensor/ad hoc networks, all wireless nodes frequently flood the network channel by transmitting control messages causing “broadcast storm problem”. Thus, inspired by the physical backbone in wired networks, a Virtual Backbone (VB) in wireless sensor/ad hoc networks can help achieve efficient broadcasting. A well-known and well-researched approach for constructing virtual backbone is solving the Connected Dominating Set (CDS) problem. Furthermore, minimizing the size of the CDS is a significant research issue. We propose a new parallel scatter search algorithm with elite and featured cores for constructing a wireless sensor/ad hoc network virtual backbones based on finding minimum connected dominating sets of wireless nodes.... (More)
In wireless sensor/ad hoc networks, all wireless nodes frequently flood the network channel by transmitting control messages causing “broadcast storm problem”. Thus, inspired by the physical backbone in wired networks, a Virtual Backbone (VB) in wireless sensor/ad hoc networks can help achieve efficient broadcasting. A well-known and well-researched approach for constructing virtual backbone is solving the Connected Dominating Set (CDS) problem. Furthermore, minimizing the size of the CDS is a significant research issue. We propose a new parallel scatter search algorithm with elite and featured cores for constructing a wireless sensor/ad hoc network virtual backbones based on finding minimum connected dominating sets of wireless nodes. Also, we addressed the problem of VB node/nodes failure by either deploying a previously computed VBs provided by the main pSSEF algorithm that does not contain the failed node/nodes, or by using our proposed FT-pSSEF algorithm repairing the broken VBs. Finally, as nodes in a VB incur extra load of communication and computation, this leads to faster power consumption compared to other nodes in the network. Consequently, we propose the virtual backbone scheduling algorithm SC-pSSEF which aims to find multiple VBs using the VBs provided by the pSSEF algorithm and switch between them periodically to prolong the network life time.
(Less)
- author
- Hedar, Abdel Rahman ; Abdulaziz, Shada N. LU ; Mabrouk, Emad and El-Sayed, Gamal A.
- organization
- publishing date
- 2020
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Fault-tolerance, Minimum connected dominating set, Parallel scatter search, Virtual backbone, Wireless sensor network
- in
- Sensors (Switzerland)
- volume
- 20
- issue
- 12
- article number
- 3509
- pages
- 27 pages
- publisher
- MDPI AG
- external identifiers
-
- scopus:85086769863
- pmid:32575880
- ISSN
- 1424-8220
- DOI
- 10.3390/s20123509
- language
- English
- LU publication?
- yes
- id
- f518dd2f-9fe8-4e31-a1d4-46b8dcf8e206
- date added to LUP
- 2020-07-08 13:18:58
- date last changed
- 2024-04-03 08:05:42
@article{f518dd2f-9fe8-4e31-a1d4-46b8dcf8e206,
abstract = {{<p>In wireless sensor/ad hoc networks, all wireless nodes frequently flood the network channel by transmitting control messages causing “broadcast storm problem”. Thus, inspired by the physical backbone in wired networks, a Virtual Backbone (VB) in wireless sensor/ad hoc networks can help achieve efficient broadcasting. A well-known and well-researched approach for constructing virtual backbone is solving the Connected Dominating Set (CDS) problem. Furthermore, minimizing the size of the CDS is a significant research issue. We propose a new parallel scatter search algorithm with elite and featured cores for constructing a wireless sensor/ad hoc network virtual backbones based on finding minimum connected dominating sets of wireless nodes. Also, we addressed the problem of VB node/nodes failure by either deploying a previously computed VBs provided by the main pSSEF algorithm that does not contain the failed node/nodes, or by using our proposed FT-pSSEF algorithm repairing the broken VBs. Finally, as nodes in a VB incur extra load of communication and computation, this leads to faster power consumption compared to other nodes in the network. Consequently, we propose the virtual backbone scheduling algorithm SC-pSSEF which aims to find multiple VBs using the VBs provided by the pSSEF algorithm and switch between them periodically to prolong the network life time.</p>}},
author = {{Hedar, Abdel Rahman and Abdulaziz, Shada N. and Mabrouk, Emad and El-Sayed, Gamal A.}},
issn = {{1424-8220}},
keywords = {{Fault-tolerance; Minimum connected dominating set; Parallel scatter search; Virtual backbone; Wireless sensor network}},
language = {{eng}},
number = {{12}},
publisher = {{MDPI AG}},
series = {{Sensors (Switzerland)}},
title = {{Wireless sensor networks fault-tolerance based on graph domination with parallel scatter search}},
url = {{http://dx.doi.org/10.3390/s20123509}},
doi = {{10.3390/s20123509}},
volume = {{20}},
year = {{2020}},
}