We develop an efficient and near-optimal solution for beamforming in multi-user multiple-input-multiple-output single-hop wireless ad-hoc interference networks. Inspired by the weighted minimum mean squared error (WMMSE) method, a classical approach to solving this problem, and the principle of algorithm unfolding, we present unfolded WMMSE (UWMMSE) for MU-MIMO. This method learns a parameterized functional transformation of key WMMSE parameters using graph neural networks (GNNs), where the channel and interference components of a wireless network constitute the underlying graph. These GNNs are trained through gradient descent on a network utility metric using multiple instances of the beamforming problem. Comprehensive experimental analyses illustrate the superiority of UWMMSE over the classical WMMSE and stateof-the-art learning-based methods in terms of performance, generalizability, and robustness.
We study the problem of optimal power allocation in a single-hop ad hoc wireless network. In solving this problem, we depart from classical purely model-based approaches and propose a hybrid method that retains key modeling elements in conjunction with data-driven components. More precisely, we put forth a neural network architecture inspired by the algorithmic unfolding of the iterative weighted minimum mean squared error (WMMSE) method, that we denote by unfolded WMMSE (UWMMSE). The learnable weights within UWMMSE are parameterized using graph neural networks (GNNs), where the time-varying underlying graphs are given by the fading interference coefficients in the wireless network. These GNNs are trained through a gradient descent approach based on multiple instances of the power allocation problem. We show that the proposed architecture is permutation equivariant, thus facilitating generalizability across network topologies. Comprehensive numerical experiments illustrate the performance attained by UWMMSE along with its robustness to hyper-parameter selection and generalizability to unseen scenarios such as different network densities and network sizes.Index terms-WMMSE, power allocation, graph neural networks, deep learning, algorithm unfolding. I. INTRODUCTIONPower and bandwidth are fundamental resources in communication, playing a key role in determining the effective capacity of a wireless channel [1], [2]. In modern wireless communication systems, the scope of resources has been broadened to include beams in a multiple-input-multipleoutput (MIMO) system, time slots in a time-division multiple access system (TDMA), frequency sub-bands in a frequencydivision multiple access (FDMA) system, spreading codes in a code-division multiple access (CDMA) system, among several others [3]. Optimal allocation of these resources under randomly varying channel characteristics and user demands is essential for the smooth operation of wireless systems. In particular, power allocation in a wireless ad hoc network is crucial to mitigate multi-user interference, one of the main performance-limiting factors. In addition, transmission power of a mobile user is in itself a scarce resource. Indeed, careful
We study the problem of adaptive contention window (CW) design for random-access wireless networks. More precisely, our goal is to design an intelligent node that can dynamically adapt its minimum CW (MCW) parameter to maximize a network-level utility knowing neither the MCWs of other nodes nor how these change over time.To achieve this goal, we adopt a reinforcement learning (RL) framework where we circumvent the lack of system knowledge with local channel observations and we reward actions that lead to high utilities. To efficiently learn these preferred actions, we follow a deep Q-learning approach, where the Q-value function is parametrized using a multi-layer perceptron. In particular, we implement a rainbow agent, which incorporates several empirical improvements over the basic deep Q-network. Numerical experiments based on the NS3 simulator reveal that the proposed RL agent performs close to optimal and markedly improves upon existing learning and non-learning based alternatives.
The lower VHF band has potential for low-power, short-range communications, as well as for geolocation applications, in both indoor and urban environments. Most prior work at low VHF focuses on longer range path loss modeling, often with one node elevated. In this paper, we study indoor/outdoor nearground scenarios through experiments and electromagnetic wave propagation simulations. These include the effects of indoor penetration through walls and obstacles, as well as indoor/outdoor cases, for both line of sight (LoS) and nonLoS (NLoS), at ranges up to 200 m. Mounting our receiver (Rx) on a robotic platform enabled the collection of thousands of measurements over an extended indoor/outdoor test area. We measure the channel transfer function, employing bandpass waveform sampling, with pulse and tone probe signals. Based on statistical tests, we show that the measured channels have a nearly ideal scalar attenuation and delay transfer function, with minimal phase distortion, and little to no evidence of multipath propagation. Compared with higher VHF and above, the measured short-range VHF channels do not exhibit small-scale fading, which simplifies communications Rx signal processing, and enables phase-based geolocation techniques.
Efficient scheduling of transmissions is a key problem in wireless networks. The main challenge stems from the fact that optimal link scheduling involves solving a maximum weighted independent set (MWIS) problem, which is known to be NP-hard. For practical link scheduling schemes, centralized and distributed greedy heuristics are commonly used to approximate the solution to the MWIS problem. However, these greedy schemes mostly ignore important topological information of the wireless network. To overcome this limitation, we propose fast heuristics based on graph convolutional networks (GCNs) that can be implemented in centralized and distributed manners. Our centralized MWIS solver is based on tree search guided by a trainable GCN module and 1-step rollout. In our distributed MWIS solver, a trainable GCN module learns topology-aware node embeddings that are combined with the network weights before calling a distributed greedy solver. Test results on mediumsized wireless networks show that a GCN-based centralized MWIS solver can reach a near-optimal solution quickly. Moreover, we demonstrate that a shallow GCN-based distributed MWIS scheduler can reduce by nearly half the suboptimality gap of the distributed greedy solver with minimal increase in complexity. The proposed scheduling solutions also exhibit good generalizability across graph and weight distributions.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.