In this work, we examine ultra-narrowband IoT networks in the case of basestation (BS) over-deployment, where we necessitate smartly turning on/off BSs for an energy-efficient network. We consider a dynamic environment and varying network traffic, where the optimal choice of BSs changes frequently. Therefore, we want to often re-evaluate if BSs should be on/off. Addressing this problem, we find a low time-complexity algorithm minimizing the number of active BSs while maintaining a high network coverage, measured by the network's packet decoding probability (PDP). The proposed strategy is based on solving an integer convex optimization problem maximizing an approximate term for PDP using collected signal-to-interference-and-noise ratio (SINR) values and constrains the number of BSs remaining on. Therefore, the comprehensive proposed algorithm includes our development of a model to estimate how many BSs should minimally be on to satisfy our high PDP value, denoted the “coverage constraint.” Our algorithm has a complexity scaling linearly with the BSs on, O(B), far better than the exhaustive search complexity to find the optimal choice of BSs, O(2B), and the greedy algorithm complexity used as an on/off strategy in the static case of cell-free MIMO wireless networks, which has O(B3). The proposed strategy's low complexity not only aids in the dynamic case-our proposed algorithm performs closer to the optimal when the number of available BSs is high, which is also when greedy and exhaustive methods become infeasible due to their complexity. As a result, our algorithm is also advantageous specifically for excessive over-deployment of BSs.

In this paper, we introduce a runtime-efficient radio frequency (RF) map prediction method based on UNet convolutional neural networks (CNNs), trained on a large-scale 3D maps dataset. The proposed method calculates the line-of-sight maps and feeds them as input for the UNet CNN. A special Kullback–Leibler divergence loss function is adopted, enabling the proposed method to minimize both error’s mean and variance. The performance of our model is evaluated in the context of the 2023 IEEE ICASSP Signal Processing Grand Challenge, namely, the First Pathloss Radio Map Prediction Challenge. The evaluation results demonstrate that the proposed method achieves an average normalized root-mean-square error (RMSE) of 0.045 with an average of 14 milliseconds (ms) runtime.

Distributed transmit beamforming enables cooperative radios to act as one virtual antenna array, extending their communications’ range beyond the capabilities of a single radio. Most existing distributed beamforming approaches rely on the destination radio sending feedback to adjust the transmitters’ signals for coherent combining. However, relying on the destination radio's feedback limits the communications range to that of a single radio. Existing destination-feedback-free approaches rely on phase synchronization and knowing the node locations with sub-wavelength accuracy, which becomes impractical for radios mounted on high-mobility platforms like UAVs. In this article, we propose and demonstrate a destination-feedback-free distributed beamforming approach that leverages the radio's mobility and coarse location information in a dominant line-of-sight channel. In the proposed approach, one radio acts as a guide and moves to point the beam of the remaining radios towards the destination. We specify the radios’ position requirements and verify their relation to the combined signal at the destination using simulations. A proof of concept demo was implemented using software defined radios, showing up to 9 dB SNR improvement in the beamforming direction just by relying on the coarse placement of four radios.

We consider a novel ultra-narrowband (UNB) low-power wide-area network (LPWAN) architecture design for uplink transmission of a massive number of Internet of Things (IoT) devices over multiple multiplexing bands. An IoT device can randomly choose any of the multiplexing bands to transmit its packet. Due to hardware constraints, a base station (BS) is able to listen to only one multiplexing band. Our main objective is to maximize the packet decoding probability (PDP) by optimizing the placement of the BSs and frequency assignment of BSs to multiplexing bands. We develop two online approaches that adapt to the environment based on the statistics of (un)successful packets at the BSs. The first approach is based on a predefined model of the environment, while the second approach is measurement-based model-free approach, which is applicable to any environment. The benefit of the model-based approach is a lower training complexity, at the risk of a poor fit in a model-incompatible environment. The simulation results show that our proposed approaches to band assignment and BS placement offer significant improvement in PDP over baseline random approaches and perform closely to the theoretical upper bound.

Physical layer authentication relies on detecting unique imperfections in signals transmitted by radio devices to isolate their fingerprint. Recently, deep learning-based authenticators have increasingly been proposed to classify devices using these fingerprints, as they achieve higher accuracies compared to traditional approaches. However, it has been shown in domains such as computer vision that adding carefully crafted perturbations to legitimate inputs can fool such classifiers. This can undermine the security provided by the authenticator. Unlike adversarial attacks applied in other domains, an adversary has no control over the propagation environment. Therefore, to investigate the severity of this type of attack in wireless communications, we consider an unauthorized transmitter attempting to have its signals classified as authorized by a deep learning-based authenticator. We demonstrate a reinforcement learning-based attack where the impersonator—using only the authenticator’s binary authentication decision—distorts its signals in order to penetrate the system. Extensive simulations and experiments on a software-defined radio testbed indicate that at appropriate channel conditions and bounded by a maximum distortion level, it is possible to fool the authenticator reliably at a success rate of more than 90%.

Machine learning (ML) and artificial neural networks (ANNs) have been successfully applied to simulating complex physics by learning physics models thanks to large data. Inspired by the successes of ANNs in physics modeling, we use deep neural networks (DNNs) to predict the radio signal strength field in an urban environment. Our algorithm relies on samples of signal strength collected across the prediction space and a 3D map of the environment, which enables it to predict the scattering of radio waves through the environment. While already extensive body of research exists in spatial signal strength prediction, our approach differs from most existing approaches in that it does not require the knowledge of the transmitter location, it does not require side channel information such as attenuation and shadowing parameters, and it is the first work, to the best of our knowledge, to use 3D maps to accomplish the task of signal strength prediction.

A swarm of cooperating UAVs communicating with a distant multiantenna ground station can leverage MIMO spatial multiplexing to scale the capacity. Due to the line-of-sight propagation between the swarm and the ground station, the MIMO channel is highly correlated, leading to limited multiplexing gains. In this paper, we optimize the UAV positions to attain the maximum MIMO capacity given by the single user bound. An infinite set of UAV placements that attains the capacity bound is first derived. Given an initial swarm placement, we formulate the problem of minimizing the distance traveled by the UAVs to reach a placement within the capacity maximizing set of positions. An offline centralized solution to the problem using block coordinate descent is developed assuming known initial positions of UAVs. We also propose an online distributed algorithm, where the UAVs iteratively adjust their positions to maximize the capacity. Our proposed approaches are shown to significantly increase the capacity at the expense of a bounded translation from the initial UAV placements. This capacity increase persists when using a massive MIMO ground station. Using numerical simulations, we show the robustness of our approaches in a Rician channel under UAV motion disturbances.

In this work, we consider a novel type of Internet of Things (IoT) ultra-narrowband (UNB) network architecture that involves multiple multiplexing bands or channels for uplink transmission. An IoT device can randomly choose any of the multiplexing bands and transmit its packet. Due to hardware constraints, a base station (BS) is able to listen to only one multiplexing band. The hardware constraint is mainly due to the complexity of performing fast Fourier transform (FFT) at a very small sampling interval over the multiplexing bands in order to counter the uncertainty of IoT device frequency and synchronize onto transmissions. The objective is to find an assignment of BSs to multiplexing bands in order to maximize the packet decoding probability (PDP). We develop a learning-based algorithm based on a sub-optimal solution to PDP maximization. The simulation results show that our approach to band assignment achieves near-optimal performance in terms of PDP, while at the same time, significantly exceeding the performance of random assignment. We also develop a heuristic algorithm with no learning overhead based on the locations of the BSs that also outperforms random assignment and serves as a performance reference to our learning-based algorithm.

In this work, we propose the use of hybrid offloading of computing tasks simultaneously to edge servers (vertical offloading) via LTE communication and to nearby cars (horizontal offloading) via V2V communication, in order to increase the rate at which tasks are processed compared to local processing. Our main contribution is an optimized resource assignment and scheduling framework for hybrid offloading of computing tasks. The framework optimally utilizes the computational resources in the edge and in the micro cloud, while taking into account communication constraints and task requirements. While cooperative perception is the primary use case of our framework, the framework is applicable to other cooperative vehicular applications with high computing demand and significant transmission overhead. The framework is tested in a simulated environment built on top of car traces and communication rates exported from the Veins vehicular networking simulator. We observe a significant increase in the processing rate of cooperative perception sensor frames when hybrid offloading with optimized resource assignment is adopted. Furthermore, the processing rate increases with V2V connectivity as more computing tasks can be offloaded horizontally.