Next Article in Journal
A Low-Complexity Method for Two-Dimensional Direction-of-Arrival Estimation Using an L-Shaped Array
Next Article in Special Issue
Underwater Electromagnetic Sensor Networks—Part I: Link Characterization
Previous Article in Journal
PlaIMoS: A Remote Mobile Healthcare Platform to Monitor Cardiovascular and Respiratory Variables
Previous Article in Special Issue
Node Redeployment Algorithm Based on Stratified Connected Tree for Underwater Sensor Networks
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(1), 186; doi:10.3390/s17010186

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

College of Automation, Hangzhou Dianzi University, Hangzhou 310018, China
*
Author to whom correspondence should be addressed.
Academic Editor: Leonhard M. Reindl
Received: 7 October 2016 / Revised: 19 December 2016 / Accepted: 10 January 2017 / Published: 19 January 2017
View Full-Text   |   Download PDF [3940 KB, uploaded 19 January 2017]   |  

Abstract

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. View Full-Text
Keywords: event K-coverage; distributed algorithm; energy-efficient; sensing radius adjusting event K-coverage; distributed algorithm; energy-efficient; sensing radius adjusting
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Jiang, P.; Xu, Y.; Liu, J. A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks. Sensors 2017, 17, 186.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top