2019
DOI: 10.1016/j.jnca.2019.02.025
|View full text |Cite
|
Sign up to set email alerts
|

An energy-efficient data collection protocol with AUV path planning in the Internet of Underwater Things

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 54 publications
(31 citation statements)
references
References 13 publications
0
31
0
Order By: Relevance
“…1) Offline Path Planning: M.T.R.Khan et al proposed four methods for fixed grid areas: shortest path with the genetic algorithm, Lowest Energy Cluster First (LECF), On-the-way-Lowest Energy Cluster First (OLECF) and On-the-way Lowest Mean Energy Cluster First (OLMECF) [132]. On-the-way means that if the AUV finds any other cluster on its journey to the destination cluster, it first visits and communicates with the intermediate cluster before moving to the destination.…”
Section: A Path Planningmentioning
confidence: 99%
See 1 more Smart Citation
“…1) Offline Path Planning: M.T.R.Khan et al proposed four methods for fixed grid areas: shortest path with the genetic algorithm, Lowest Energy Cluster First (LECF), On-the-way-Lowest Energy Cluster First (OLECF) and On-the-way Lowest Mean Energy Cluster First (OLMECF) [132]. On-the-way means that if the AUV finds any other cluster on its journey to the destination cluster, it first visits and communicates with the intermediate cluster before moving to the destination.…”
Section: A Path Planningmentioning
confidence: 99%
“…1) Sink Selection: This mainly refers to the selection of cluster heads and gateway nodes, which take out more transmission and forwarding tasks than ordinary nodes. With the help of an AUV, the clustering algorithm and gateway nodes selection can be further optimized as the following: a) Clustering Algorithm: Utilizing the location information, [132], [141] divide the overall sensing area into homogeneous square grids and sensor nodes are aware of their attribution. Each grid has a Cluster Centroid Point (CCP) as the destination for the AUV in which all nodes belonging to this area can communicate with the upcoming AUV.…”
Section: B In-situ Decisionmentioning
confidence: 99%
“…Assuming that a ME collects data from n sensor nodes before going back to the sink, and the length of exchanged data between the sensor nodes and the ME is L (bytes), then the minimum ME buffer size required to avoid buffer overflow is nL (bytes). 17,19,20,23,24,29,31,32,[39][40][41]44,47,[49][50][51][52]55,[58][59][60][61][66][67][68][69][70][71]75,77,81,84,85,[87][88][89][90][92][93][94]100,102,104,106,107,111,112,114,116,11...…”
Section: Me Buffer Sizementioning
confidence: 99%
“…In [28], [29] authors proposed multipath virtual sink (MVS) schemes, where numerous nearby sinks nodes are associated with a system by means of rapid connections of the underwater network based on forwarder dependent hop count schemes. However, this system experiences numerous repetitive transmissions which lead to low PDR and network overhead with more Energy utilization.…”
Section: Literature Surveymentioning
confidence: 99%