TY - JOUR
T1 - Minimizing deep sea data collection delay with autonomous underwater vehicles
AU - Zheng, Huanyang
AU - Wang, Ning
AU - Wu, Jie
N1 - Funding Information:
This work was supported by the Science Foundation of China University of Petroleum-Beijing, China (No. 2462018BJB001 and 2462020XKJS04 ); and Independent Project Program of State Key Laboratory of Petroleum Pollution Control, China (Grant No. PPCIP2017004 ); National Natural Science Foundation of China, China (No. 21776307 ).
Publisher Copyright:
© 2017 Elsevier Inc.
PY - 2017/6/1
Y1 - 2017/6/1
N2 - As a special application of delay tolerant networks (DTNs), efficient data collection in the deep sea poses some unique challenges, due to the need for timely data reporting and the delay of acoustic transmission in the ocean. Autonomous underwater vehicles (AUVs) are deployed in the deep sea to surface frequently to transmit collected data from sensors (in a 2-dimensional or 3-dimensional search space) to the surface stations. However, additional delay occurs at each resurfacing. In this paper, we want to minimize the average data reporting delay, through optimizing the number and locations of AUV resurfacing events. We also study the AUV trajectory planning using an extended Euler circuit, where the search space is a set of segments (e.g., oil pipes) in the deep sea. To further reduce the data reporting delay, several schemes, which schedules multiple AUVs cooperatively, are also explored. Finally, experiments in both the synthetic and real traces validate the efficiency and effectiveness of the proposed algorithms.
AB - As a special application of delay tolerant networks (DTNs), efficient data collection in the deep sea poses some unique challenges, due to the need for timely data reporting and the delay of acoustic transmission in the ocean. Autonomous underwater vehicles (AUVs) are deployed in the deep sea to surface frequently to transmit collected data from sensors (in a 2-dimensional or 3-dimensional search space) to the surface stations. However, additional delay occurs at each resurfacing. In this paper, we want to minimize the average data reporting delay, through optimizing the number and locations of AUV resurfacing events. We also study the AUV trajectory planning using an extended Euler circuit, where the search space is a set of segments (e.g., oil pipes) in the deep sea. To further reduce the data reporting delay, several schemes, which schedules multiple AUVs cooperatively, are also explored. Finally, experiments in both the synthetic and real traces validate the efficiency and effectiveness of the proposed algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85010705254&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85010705254&partnerID=8YFLogxK
U2 - 10.1016/j.jpdc.2017.01.006
DO - 10.1016/j.jpdc.2017.01.006
M3 - Article
AN - SCOPUS:85010705254
SN - 0743-7315
VL - 104
SP - 99
EP - 113
JO - Journal of Parallel and Distributed Computing
JF - Journal of Parallel and Distributed Computing
ER -