A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks

For event dynamic K-coverage algorithms, each management node selects its assistant node by using a greedy algorithm without considering the residual energy and situations in which a node is selected by several events. This approach affects network energy consumption and balance. Therefore, this stu...

Full description

Bibliographic Details
Main Authors: Peng Jiang, Yiming Xu, Jun Liu
Format: Article
Language:English
Published: MDPI AG 2017-01-01
Series:Sensors
Subjects:
Online Access:http://www.mdpi.com/1424-8220/17/1/186
id doaj-1373d9e9a4444fc89bed3e32ba3ddbcf
record_format Article
spelling doaj-1373d9e9a4444fc89bed3e32ba3ddbcf2020-11-24T21:53:01ZengMDPI AGSensors1424-82202017-01-0117118610.3390/s17010186s17010186A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor NetworksPeng Jiang0Yiming Xu1Jun Liu2College of Automation, Hangzhou Dianzi University, Hangzhou 310018, ChinaCollege of Automation, Hangzhou Dianzi University, Hangzhou 310018, ChinaCollege of Automation, Hangzhou Dianzi University, Hangzhou 310018, ChinaFor event dynamic K-coverage algorithms, each management node selects its assistant node by using a greedy algorithm without considering the residual energy and situations in which a node is selected by several events. This approach affects network energy consumption and balance. Therefore, this study proposes a distributed and energy-efficient event K-coverage algorithm (DEEKA). After the network achieves 1-coverage, the nodes that detect the same event compete for the event management node with the number of candidate nodes and the average residual energy, as well as the distance to the event. Second, each management node estimates the probability of its neighbor nodes’ being selected by the event it manages with the distance level, the residual energy level, and the number of dynamic coverage event of these nodes. Third, each management node establishes an optimization model that uses expectation energy consumption and the residual energy variance of its neighbor nodes and detects the performance of the events it manages as targets. Finally, each management node uses a constrained non-dominated sorting genetic algorithm (NSGA-II) to obtain the Pareto set of the model and the best strategy via technique for order preference by similarity to an ideal solution (TOPSIS). The algorithm first considers the effect of harsh underwater environments on information collection and transmission. It also considers the residual energy of a node and a situation in which the node is selected by several other events. Simulation results show that, unlike the on-demand variable sensing K-coverage algorithm, DEEKA balances and reduces network energy consumption, thereby prolonging the network’s best service quality and lifetime.http://www.mdpi.com/1424-8220/17/1/186event K-coveragedistributed algorithmenergy-efficientsensing radius adjusting
collection DOAJ
language English
format Article
sources DOAJ
author Peng Jiang
Yiming Xu
Jun Liu
spellingShingle Peng Jiang
Yiming Xu
Jun Liu
A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks
Sensors
event K-coverage
distributed algorithm
energy-efficient
sensing radius adjusting
author_facet Peng Jiang
Yiming Xu
Jun Liu
author_sort Peng Jiang
title A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks
title_short A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks
title_full A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks
title_fullStr A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks
title_full_unstemmed A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks
title_sort distributed and energy-efficient algorithm for event k-coverage in underwater sensor networks
publisher MDPI AG
series Sensors
issn 1424-8220
publishDate 2017-01-01
description For event dynamic K-coverage algorithms, each management node selects its assistant node by using a greedy algorithm without considering the residual energy and situations in which a node is selected by several events. This approach affects network energy consumption and balance. Therefore, this study proposes a distributed and energy-efficient event K-coverage algorithm (DEEKA). After the network achieves 1-coverage, the nodes that detect the same event compete for the event management node with the number of candidate nodes and the average residual energy, as well as the distance to the event. Second, each management node estimates the probability of its neighbor nodes’ being selected by the event it manages with the distance level, the residual energy level, and the number of dynamic coverage event of these nodes. Third, each management node establishes an optimization model that uses expectation energy consumption and the residual energy variance of its neighbor nodes and detects the performance of the events it manages as targets. Finally, each management node uses a constrained non-dominated sorting genetic algorithm (NSGA-II) to obtain the Pareto set of the model and the best strategy via technique for order preference by similarity to an ideal solution (TOPSIS). The algorithm first considers the effect of harsh underwater environments on information collection and transmission. It also considers the residual energy of a node and a situation in which the node is selected by several other events. Simulation results show that, unlike the on-demand variable sensing K-coverage algorithm, DEEKA balances and reduces network energy consumption, thereby prolonging the network’s best service quality and lifetime.
topic event K-coverage
distributed algorithm
energy-efficient
sensing radius adjusting
url http://www.mdpi.com/1424-8220/17/1/186
work_keys_str_mv AT pengjiang adistributedandenergyefficientalgorithmforeventkcoverageinunderwatersensornetworks
AT yimingxu adistributedandenergyefficientalgorithmforeventkcoverageinunderwatersensornetworks
AT junliu adistributedandenergyefficientalgorithmforeventkcoverageinunderwatersensornetworks
AT pengjiang distributedandenergyefficientalgorithmforeventkcoverageinunderwatersensornetworks
AT yimingxu distributedandenergyefficientalgorithmforeventkcoverageinunderwatersensornetworks
AT junliu distributedandenergyefficientalgorithmforeventkcoverageinunderwatersensornetworks
_version_ 1725873377468481536