Underwater acoustic (UWA) communication is an essential part of many civilian and military applications. For UWA sensor networks, the sensing information can only be interpreted meaningfully when the location of the sensor node is known. However, node localization is a challenging problem. Global Navigation Satellite Systems (GNSS), which are often used in terrestrial applications, do not work underwater. In this paper, we propose and investigate techniques for localization of a single-antenna UWA communication receiver with respect to one or more transmit antennas. These techniques are based on the matched field processing. Firstly, we demonstrate that a non-coherent ambiguity function (AF) allows significant improvement in the localization performance compared to the coherent AF previously used for this purpose, especially at high frequencies typically used in communication systems. Secondly, we propose a two-step (coarse-to-fine) localization technique. The second step provides refined spatial sampling of the AF in the vicinity of its maximum found on the coarse space grid covering an area of interest (in range and depth), computed at the first step. This technique allows high localization accuracy and reduction in complexity and memory storage, compared to the single step localization. Thirdly, we propose a joint refinement of the AF around several maxima to reduce outliers. For validation of the proposed techniques, we run numerical experiments in different UWA environments, with different parameters for the spatial sampling, number of transmit antennas and different accuracy for the estimation of the acoustic channel response.

Abstract: Two recursive least-square (RLS) adaptive filtering algorithms are most often used in practice, the exponential and sliding (rectangular) window RLS algorithms. This popularity is mainly due to existence of low-complexity versions of these algorithms. However, these two windows are not always the best choice for identification of fast time-varying systems, when the identification performance is most important. In this paper, we show how RLS algorithms with arbitrary finite-length windows can be implemented at a complexity comparable to that of the exponential and sliding window RLS algorithms. Then, as an example, we show an improvement in the performance when using the proposed finite-window RLS algorithm with the Hanning window for identification of fast time-varying systems. p, li { white-space: pre-wrap; }

Abstract: In system identification scenarios, classical adaptive filters, such as the recursive least squares (RLS) algorithm, predict the system impulse response. If a tracking delay is acceptable, interpolating estimators capable of providing more accurate estimates of time-varying impulse responses can be used; channel estimation in communications is an example of such applications. The basis expansion model (BEM) approach is known to be efficient for non-adaptive (block) channel estimation in communications. In this paper, we combine the BEM approach with the sliding-window RLS (SRLS) algorithm and propose a new family of adaptive filters. Specifically, we use the Legendre polynomials, thus the name the SRLS-L adaptive filter. The identification performance of the SRLS-L algorithm is evaluated analytically and via simulation. The analysis shows significant improvement in the estimation accuracy compared to the SRLS algorithm and a good match between the theoretical and simulation results. The performance is further investigated in application to the self-interference cancellation in full-duplex underwater acoustic communications, where a high estimation accuracy is required. A field experiment conducted in a lake shows significant improvement in the cancellation performance compared to the classical SRLS algorithm.

Abstract: To enable full-duplex (FD) in underwater acoustic (UWA) systems, a high level of self-interference (SI) cancellation (SIC) is required. For digital SIC, adaptive filters are used. In time-invariant channels, the SI can be effectively cancelled by classical recursive least-square (RLS) adaptive filters, such as the sliding-window RLS (SRLS) or exponential-window RLS, but their SIC performance degrades in time-varying channels, e.g., in channels with a moving sea surface. Their performance can be improved by delaying the filter inputs. This delay, however, makes the mean squared error (MSE) unsuitable for measuring the SIC performance. In this paper, we propose a new evaluation metric, the SIC factor (SICF), which gives better indication of the SIC performance compared to MSE. The SICF can be used in experiments and in real FD systems. A new SRLS adaptive filter based on parabolic approximation of the channel variation in time, named SRLS-P, is also proposed. The SIC performance of the SRLS-P adaptive filter and classical RLS algorithms (with and without the delay) is evaluated by simulation and in lake experiments. The results show that the SRLS-P adaptive filter significantly improves the SIC performance, compared to the classical RLS adaptive filters.

This manuscript was submitted to IEEE Access on 12 Jun 2020. Abstract: Simulation forms an important part of the development and empirical evaluation of underwater acoustic network (UAN) protocols. The key feature of a credible network simulation model is a realistic channel model. A common approach to simulating realistic underwater acoustic (UWA) channels is by using specialised beam tracing software such as BELLHOP. However, BELLHOP and similar modeling software typically require knowledge of ocean acoustics and a substantial programming effort from UAN protocol designers to integrate it into their research. In this paper, we bridge the gap between low level channel modeling via beam tracing and automated channel modeling, e.g. via the World Ocean Simulation System (WOSS), by providing a distilled UWA channel modeling tutorial from the network protocol design point of view. The tutorial is accompanied by our MATLAB simulation code that interfaces with BELLHOP to produce channel data for UAN simulations. As part of the tutorial, we describe two methods of incorporating such channel data into network simulations, including a case study for each of them: 1) directly importing the data as a look-up table, 2) using the data to create a statistical channel model. The primary aim of this paper is to provide a useful learning resource and modeling tool for UAN protocol researchers. Initial insights into the UAN protocol design and performance provided by the statistical channel modeling approach presented in this paper demonstrate its potential as a powerful modeling tool for future UAN research.