CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor Networks

Over the course of operation, a wireless sensor network can experience failures that are detrimental to the underlying application’s objectives. In this paper, we address the problem of restoring coverage ratio of a damaged area (hole) using only the neighboring nodes. Most existing solutions fail t...

Full description

Bibliographic Details
Main Authors: Gokou Hervé Fabrice Diédié, Boko Aka, Michel Babri
Format: Article
Language:English
Published: Atlantis Press 2021-01-01
Series:International Journal of Networked and Distributed Computing (IJNDC)
Subjects:
Online Access:https://www.atlantis-press.com/article/125951263/view
id doaj-6300aca002ac4417af2eb233720a335c
record_format Article
spelling doaj-6300aca002ac4417af2eb233720a335c2021-02-01T15:03:58ZengAtlantis PressInternational Journal of Networked and Distributed Computing (IJNDC)2211-79462021-01-019110.2991/ijndc.k.201218.001CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor NetworksGokou Hervé Fabrice DiédiéBoko AkaMichel BabriOver the course of operation, a wireless sensor network can experience failures that are detrimental to the underlying application’s objectives. In this paper, we address the problem of restoring coverage ratio of a damaged area (hole) using only the neighboring nodes. Most existing solutions fail to simultaneously prevent new holes formation, collisions, oscillations, cascaded movements, and overlapped areas. To do this, we propose an intersection points-based strategy to properly locate and characterize any type of coverage hole. Then, we allow nodes, whether or not redundant, to coordinate their movements and ranges in order to effectively eliminate the detected hole. We suggest for that purpose, a tabu search based optimization scheme along with a location-allocation model through a mixed integer linear program. Simulation results show that our protocol significantly increases the network’s resilience.https://www.atlantis-press.com/article/125951263/viewCoverage holedetectionrecoverylocation-allocationtabu searchwireless sensor network
collection DOAJ
language English
format Article
sources DOAJ
author Gokou Hervé Fabrice Diédié
Boko Aka
Michel Babri
spellingShingle Gokou Hervé Fabrice Diédié
Boko Aka
Michel Babri
CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor Networks
International Journal of Networked and Distributed Computing (IJNDC)
Coverage hole
detection
recovery
location-allocation
tabu search
wireless sensor network
author_facet Gokou Hervé Fabrice Diédié
Boko Aka
Michel Babri
author_sort Gokou Hervé Fabrice Diédié
title CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor Networks
title_short CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor Networks
title_full CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor Networks
title_fullStr CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor Networks
title_full_unstemmed CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor Networks
title_sort cheap: an efficient localized area coverage maintenance protocol for wireless sensor networks
publisher Atlantis Press
series International Journal of Networked and Distributed Computing (IJNDC)
issn 2211-7946
publishDate 2021-01-01
description Over the course of operation, a wireless sensor network can experience failures that are detrimental to the underlying application’s objectives. In this paper, we address the problem of restoring coverage ratio of a damaged area (hole) using only the neighboring nodes. Most existing solutions fail to simultaneously prevent new holes formation, collisions, oscillations, cascaded movements, and overlapped areas. To do this, we propose an intersection points-based strategy to properly locate and characterize any type of coverage hole. Then, we allow nodes, whether or not redundant, to coordinate their movements and ranges in order to effectively eliminate the detected hole. We suggest for that purpose, a tabu search based optimization scheme along with a location-allocation model through a mixed integer linear program. Simulation results show that our protocol significantly increases the network’s resilience.
topic Coverage hole
detection
recovery
location-allocation
tabu search
wireless sensor network
url https://www.atlantis-press.com/article/125951263/view
work_keys_str_mv AT gokouhervefabricediedie cheapanefficientlocalizedareacoveragemaintenanceprotocolforwirelesssensornetworks
AT bokoaka cheapanefficientlocalizedareacoveragemaintenanceprotocolforwirelesssensornetworks
AT michelbabri cheapanefficientlocalizedareacoveragemaintenanceprotocolforwirelesssensornetworks
_version_ 1724315326432149504