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...
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 |
Similar Items
-
Distributed Energy-Efficient Solutions for Area Coverage Problems in Wireless Sensor Networks
by: Vu, Chinh Trung
Published: (2009) -
An Energy-Efficient Distributed Algorithm for k-Coverage Problem in Wireless Sensor Networks
by: Vu, Chinh Trung
Published: (2007) -
CoCMA: Energy-Efficient Coverage Control in Cluster-Based Wireless Sensor Networks Using a Memetic Algorithm
by: Yung-Chung Wang, et al.
Published: (2009-06-01) -
Node Self-Deployment Algorithm Based on an Uneven Cluster with Radius Adjusting for Underwater Sensor Networks
by: Peng Jiang, et al.
Published: (2016-01-01) -
Barrier Coverage Mechanism Using Adaptive Sensing Range for Renewable WSNs
by: Zaixiu Dong, et al.
Published: (2020-01-01)