skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 10 until 2:00 AM ET on Friday, October 11 due to maintenance. We apologize for the inconvenience.


Title: Adaptive Switching for Multimodal Underwater Acoustic Communications Based on Reinforcement Learning
The underwater acoustic (UWA) channel is a complex and stochastic process with large spatial and temporal dynamics. This work studies the adaptation of the communication strategy to the channel dynamics. Specifically, a set of communication strategies are considered, including frequency shift keying (FSK), single-carrier communication, and multicarrier communication. Based on the channel condition, a reinforcement learning (RL) algorithm, the Depth Determined Strategy Gradient (DDPG) method along with a Gumbel-softmax scheme is employed for intelligent and adaptive switching among those communication strategies. The adaptive switching is performed on a transmission block-by-block basis, with the goal of maximizing a long-term system performance. The reward function is defined based on the energy efficiency and the spectral efficiency of the communication strategies. Simulation results reveal that the proposed method outperforms a random selection method in time-varying channels.  more » « less
Award ID(s):
1651135
NSF-PAR ID:
10314505
Author(s) / Creator(s):
;
Date Published:
Journal Name:
the 15th International Conference on Underwater Networks & Systems (WUWNet)
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We investigate the performance of parallel and adaptive quantum channel discrimination strategies for a finite number of channel uses. It has recently been shown that, in the asymmetric setting with asymptotically vanishing type I error probability, adaptive strategies are asymptotically not more powerful than parallel ones. We extend this result to the non-asymptotic regime with finitely many channel uses, by explicitly constructing a parallel strategy for any given adaptive strategy, and bounding the difference in their performances, measured in terms of the decay rate of the type II error probability per channel use. We further show that all parallel strategies can be optimized over in time polynomial in the number of channel uses, and hence our result can also be used to obtain a poly-time-computable asymptotically tight upper bound on the performance of general adaptive strategies. 
    more » « less
  2. The multiple-user terminals in a satellite transponder’s communication channel compete for limited radio resources to meet their own data rate needs. Because inter-user interference limits on the satellite transponder’s performance, the transponder’s power-control system needs to coordinate all its users to reduce interference and maximizes overall performance of this channel. This paper studies Stackelberg competition among the asymmetrical users in a transponder’s channel, where some users called leader have priority to choose their power control strategy, but other users called followers have to optimize their power control strategy with given leader’s controls. A Stackelberg Differential Game (SDG) is set up to model the Stackelberg competition in a transponder’s communication channel. Each user’s utility function is a trade-off between transmission data rate and power consumption. The dynamics of the system is the changing of channel gain. The optimality condition of Stackelberg equilibrium of leaders and followers is a set of Differential Algebraic Equations (DAE) with an imbedded control strategies from its counterpart. In order to solve for Stackelberg equilibrium, an algorithm based on optimizing leaders’ and followers’ Hamiltonians iteratively is developed. The numerical solution of the SDG model provides the transponder’s power control system with each user’s power-control strategy at the Stackelberg equilibrium. 
    more » « less
  3. null (Ed.)
    The resource-constrained nature of the Internet of Things (IoT) edges, poses a challenge in designing a secure and high-performance communication for this family of devices. Although side-channel resistant ciphers (either block or stream) could guarantee the security of the communication, the energy intensive nature of these ciphers makes them undesirable for lightweight IoT solutions. In this paper, we introduce ExTru, an encrypted communication protocol based on stream ciphers that adds a configurable switching & toggling network (CSTN) to not only boost the performance of the communication in these devices, it also consumes far less energy than the conventional side-channel resistant ciphers. Although the overall structure of the proposed scheme is leaky against physical attacks, we introduce a dynamic encryption mechanism that removes this vulnerability. We demonstrate how each communicated message in the proposed scheme reduces the level of trust. Accordingly, since a specific number of messages, N, could break the communication and extract the key, by using the dynamic encryption mechanism, ExTru can re-initiate the level of trust periodically after T messages where T <; N, to protect the communication against side-channel and scan-based attacks (e.g. SAT attack). Furthermore, we demonstrate that by properly configuring the value of T, ExTru not only increases the strength of security from per “device” to per “message”, it also significantly improves energy saving as well as throughput vs. an architecture that only uses a conventional side-channel resistant block/stream cipher. 
    more » « less
  4. Abstract—As wireless communication systems strive to improve spectral efficiency, there has been a growing interest in employing machine learning (ML)-based approaches for adaptive modulation and coding scheme (MCS) selection. In this paper, we introduce a new adaptive MCS selection framework for massive MIMO systems that operates without any feedback from users by solely relying on instantaneous uplink channel estimates. Our proposed method can effectively operate in multi-user scenarios where user feedback imposes excessive delay and bandwidth overhead. To learn the mapping between the user channel matrices and the optimal MCS level of each user, we develop a Convolutional Neural Network (CNN)-Long Short-Term Memory Network (LSTM)-based model and compare the performance with the state-of-the-art methods. Finally, we validate the effectiveness of our algorithm by evaluating it experimentally using real-world datasets collected from the RENEW massive MIMO platform. Index Terms—Adaptive MCS Selection, Machine Learning, Convolutional Neural Network, Long Short-Term Memory Network, Channel State Information, Feedback Delay. 
    more » « less
  5. Achieving high throughput and reliability in underwater acoustic networks is a challenging task due to the bandwidth-limited and unpredictable nature of the channel. In a multi-node structure, such as in the Internet of Underwater Things (IoUT), the efficiency of links varies dynamically because of the channel variations. When the channel is not in good condition, e.g., when in deep fade, channel-coding techniques fail to deliver the required information even with multiple rounds of retransmissions. An efficient and agile collaborative strategy among the nodes is required to assign appropriate resources to each link based on their status and capability. Hence, a cross-layer collaborative strategy is introduced to increase the throughput of the network by allocating unequal share of system resources to different nodes/links. The proposed solution adjusts the physical- and link-layer parameters in a collaborative manner for a Code Division Multiple Access (CDMA)-based underwater network. An adaptive Hybrid Automatic Repeat Request (HARQ) solution is employed to guarantee reliable communications against errors in poor communication links. Results are being validated using data collected from the LOON underwater testbed, which is hosted by the NATO STO Centre for Maritime Research and Experimentation (CMRE) in La Spezia, Italy. 
    more » « less