Underwater Data Collection Using Robotic Sensor Networks

We examine the problem of utilizing an autonomous underwater vehicle (AUV) to collect data from an underwater sensor network. The sensors in the network are equipped with acoustic modems that provide noisy, range-limited communication. The AUV must plan a path that maximizes the information collected while minimizing travel time or fuel expenditure. We propose AUV path planning methods that extend algorithms for variants of the Traveling Salesperson Problem (TSP). While executing a path, the AUV can improve performance by communicating with multiple nodes in the network at once. Such multi-node communication requires a scheduling protocol that is robust to channel variations and interference. To this end, we examine two multiple access protocols for the underwater data collection scenario, one based on deterministic access and another based on random access. We compare the proposed algorithms to baseline strategies through simulated experiments that utilize models derived from experimental test data. Our results demonstrate that properly designed communication models and scheduling protocols are essential for choosing the appropriate path planning algorithms for data collection.

[1]  J. Heidemann,et al.  Underwater Sensor Networking : Research Challenges and Potential Applications , 2006 .

[2]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[3]  Geoffrey A. Hollinger,et al.  Autonomous data collection from underwater sensor networks using acoustic communication , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Urbashi Mitra,et al.  Effects of underwater communication constraints on the control of marine robot teams , 2009, 2009 Second International Conference on Robot Communication and Coordination.

[5]  Milica Stojanovic,et al.  Distance aware collision avoidance protocol for ad-hoc underwater acoustic sensor networks , 2007, IEEE Communications Letters.

[6]  Milica Stojanovic,et al.  Performance of antenna diversity multiuser receivers in CDMA channels with imperfect fading estimation , 1996, Wirel. Pers. Commun..

[7]  Moshe Lewenstein,et al.  Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.

[8]  Parastoo Qarabaqi,et al.  Modeling the large scale transmission loss in underwater acoustic channels , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[10]  A. Field Communications , 1963, The Journal of Asian Studies.

[11]  Volkan Isler,et al.  Robotic data mules for collecting data over sparse sensor fields , 2011, J. Field Robotics.

[12]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[13]  C. Guestrin,et al.  Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[14]  Milica Stojanovic,et al.  Idle-time energy savings through wake-up modes in underwater acoustic networks , 2009, Ad Hoc Networks.

[15]  W. Chadwick,et al.  Volcanic inflation measured in the caldera of Axial Seamount: Implications for magma supply and future eruptions , 2009 .

[16]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[17]  W. Kuperman,et al.  Fundamentals of Ocean Acoustics , 2011 .

[19]  M. Stojanovic,et al.  Slotted FAMA: a MAC protocol for underwater acoustic networks , 2006, OCEANS 2006 - Asia Pacific.

[20]  E. Cayirci,et al.  A Mac Protocol for Tactical Underwater Surveillance Networks , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[21]  Andreas Krause,et al.  Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.

[22]  Giorgio Ausiello,et al.  Prize-Collecting Traveling Salesman and Related Problems , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[23]  Peter I. Corke,et al.  Data collection, storage, and retrieval with an underwater sensor network , 2005, SenSys '05.

[24]  Milica Stojanovic,et al.  On the relationship between capacity and distance in an underwater acoustic communication channel , 2006, Underwater Networks.

[25]  Urbashi Mitra,et al.  Analysis of a Linear Multihop Underwater Acoustic Network , 2010, IEEE Journal of Oceanic Engineering.

[26]  Giorgio Ausiello,et al.  The online Prize-Collecting Traveling Salesman Problem , 2008, Inf. Process. Lett..

[27]  Mohammad Taghi Hajiaghayi,et al.  Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[28]  S. Singh,et al.  The WHOI micro-modem: an acoustic communications and navigation system for multiple platforms , 2005, Proceedings of OCEANS 2005 MTS/IEEE.

[29]  Joachim Gudmundsson,et al.  TSP with neighborhoods of varying size , 2005, J. Algorithms.

[30]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[31]  Geoffrey A. Hollinger,et al.  Distributed coordination and data fusion for underwater search , 2011, 2011 IEEE International Conference on Robotics and Automation.

[32]  Gaurav S. Sukhatme,et al.  Planning and Implementing Trajectories for Autonomous Underwater Vehicles to Track Evolving Ocean Processes Based on Predictions from a Regional Ocean Model , 2010, Int. J. Robotics Res..

[33]  Teofilo F. Gonzalez Prize-Collecting Traveling Salesman and Related Problems , 2007 .

[34]  C. Roman,et al.  Seabed AUV offers new platform for high‐resolution imaging , 2004 .

[35]  Milica Stojanovic,et al.  On the relationship between capacity and distance in an underwater acoustic communication channel , 2007, MOCO.

[36]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[37]  Carl E. Rasmussen,et al.  Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.