Underwater Data Collection Using Robotic Sensor Networks

Geoffrey A. Hollinger, Sunav Choudhary, Parastoo Qarabaqi, Christopher Murphy, Urbashi Mitra, Gaurav S. Sukhatme, Milica Stojanovic, Hanumant Singh, Franz S. Hover

IEEE Journal on Selected Areas in Communications · 2012 · 198 citations · 31 references

Concepts

TL;DR

Underwater sensor networks use acoustic modems that provide noisy, range‑limited communication, and effective data collection requires robust multi‑node scheduling protocols to handle channel variations and interference. The study investigates how an autonomous underwater vehicle can be used to collect data from an acoustic sensor network by planning efficient paths and evaluating two multiple‑access communication protocols. The authors extend Traveling Salesperson Problem algorithms for path planning, evaluate deterministic and random multiple‑access protocols, and compare these approaches to baseline strategies using simulations based on experimental test data. The results show that well‑designed communication models and scheduling protocols are critical for selecting effective path‑planning algorithms for underwater data collection.

Abstract

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.

References

31