Constructing three-dimensional (3D) radio environment maps (REMs) has emerged as a promising solution to visualize the spectrum information over the geographical map. In this paper, we propose a novel online path planning method for unmanned aerial vehicle (UAV)-based 3D spectrum mapping in unknown environments. The UAV can effectively collect spectrum data along dynamically planned paths while adhering to budget constraints. We formulate the path planning problem by a surrogate objective that maximizes the information gain along the sampling path. Specifically, a Gaussian process (GP) is adopted to estimate the spatial distribution of received signal strength (RSS) based on observations. A goal location decision algorithm based on the negative integrated posterior variance (NIPV) criterion is developed, which identifies high-value locations by maximizing the reduction in uncertainty. Besides, an uncertainty-aware local path planner is introduced to optimize sampling paths during flight. Simulation results demonstrate that it achieves at least a 66.49% improvement in REM construction accuracy and 42.74% reduction in mapping uncertainty compared to traditional methods.

Radio environment maps (REMs) have been used to visualize the information of invisible electromagnetic spectrum. Although in the past there have been many research activities dealing with the reconstruction of static REMs, they did not consider the time variation of the dynamic spectrum operational environment. In this article, we present a novel time-variant REM reconstruction methodology based on sparsely distributed sensors which jointly considers sensor layout optimization, propagation model improvement, and missing spectrum data recovery. First, a low complexity and computationally efficient method is proposed to improve the sampling efficiency. The proposed method jointly employs the gradient descent method and an upgraded greedy matching algorithm to optimize the sensor positions even when large-scale scenarios are considered. Then, by using the sampled spectrum data obtained from these sensors, the accuracy of commonly employed propagation models is improved and subsequently used to construct a channel dictionary for such time-varying environments. By exploring the heterogeneity of dynamic spectrum operational environments, an improved optimal reconstruction method is designed to recover the spectrum data using their spatial-temporal correlation. By considering a typical university campus environment as a case study, simulation and measurement data are obtained to reconstruct the time-variant REM. Through the simulation data, the reconstruction performance results are compared with those obtained from other state-of-the-art methods showing that the proposed methodology outperforms the others with respect to the sampling scheme and missing rate. Additionally, field measurement results have demonstrated that the proposed approach can effectively reconstruct time-variant REMs under dynamic scenarios.

The implementation of Scenario Classification (SC) plays a pivotal role in various edge intelligence applications, notably in fields such as autonomous driving, navigation, and remote sensing. With recent advancements, deep learning (DL) techniques have substantially improved SC, delivering remarkable results in classification tasks. However, the integration of DL in SC brings significant computational demands, posing challenges for deployment on edge devices where resources are constrained. Addressing this issue, we propose a novel Low-Resource Scenario Classification (LR-SC) approach, primarily focused on model pruning. This strategy aims to reduce computational power and storage needs, thus optimizing resource utilization in edge intelligence applications. Our approach involves the application of an ℓ2 regularization and a threshold-based pruning method, which selectively eliminates non-essential connections. This is followed by a systematic process of alternating pruning and fine-tuning to mitigate any performance loss due to the pruning. Experimental evaluations of the LR-SC method have shown its effectiveness; it substantially lowers the parameter count to merely 24% of the original model, while simultaneously achieving a 0.42% increase in classification accuracy.

The radio environment map (REM) visually displays the spectrum information over the geographical map and plays a significant role in monitoring, management, and security of spectrum resources. In this paper, we present an efficient 3D REM construction scheme based on the sparse Bayesian learning (SBL), which aims to recover the accurate REM with limited and optimized sampling data. In order to reduce the number of sampling sensors, an efficient sparse sampling method for unknown scenarios is proposed. For the given construction accuracy and the priority of each location, the quantity and sampling locations can be jointly optimized. With the sparse sampled data, by mining the sparsity of the spectrum situation and channel propagation characteristics, a SBL-based spectrum data hierarchical recovery algorithm is developed to estimate the missing data of unsampled locations. Finally, the simulated three-dimensional (3D) REM data in the campus scenario are used to verify the proposed methods as well as to compare with the state-of-the-art. We also analyze the recovery performance and the impact of different parameters on the constructed REMs. Numerical results demonstrate that the proposed scheme can ensure the construction accuracy and improve the computational efficiency under the low sampling rate.

Abstract Spectrum resources are becoming harder to come by for wireless communications. The spectrum environment map (SEM), which depicts the electromagnetic environment's current state and future trend, is a valuable technique for managing and allocating spectrum resources. Most SEM construction approaches only take static SEMs into account and cannot forecast time‐domain changes and trends of SEMs in dynamic scenes. In this paper, a brand‐new temporal SEM prediction method for the high dynamic spectrum environment is proposed. This method is based on knowledge of radiation source and the optical flow driven by propagation channel models. First, a novel radiation source localization strategy is designed to obtain the radiation source movement information. Then, the optical flow field of the available SEMs is combined with the information regarding radiation source movement. In order to forecast future SEMs, a propagation model driven reconstruction technique is developed. Simulation findings demonstrate how well the suggested strategy is tailored to capture the spatiotemporal correlation of SEMs. This technique performs better than the state‐of‐the‐art in terms of single‐ and multiple‐step SEM predictions.

Accurate downlink channel state information (CSI) is one of the essential requirements for harnessing the potential advantages of frequency-division duplexing (FDD) massive multi-input multi-output (MIMO) systems. The current state-of-art in this vibrant research area include the use of deep learning to compress and feedback downlink CSI at the user equipments (UEs). These approaches focus mainly on achieving CSI feedback with high reconstruction performance and low complexity, but at the expense of inflexible compression rate (CR). High training overheads and limited storage capacity requirements are some of the challenges associated with the design of dynamic CR, which instantaneously adapt to propagation environment. This paper applies transfer learning (TL) to develop a multi-rate CSI compression and recovery neural network (TL-MRNet) with reduced training overheads. Simulation results are presented to validate the superiority of the proposed TL-MRNet over traditional methods in terms of normalized mean square error and cosine similarity.

Nonorthogonal multiple access (NOMA) significantly improves the connectivity opportunities and enhances the spectrum efficiency (SE) in the fifth generation and beyond (B5G) wireless communications. Meanwhile, emerging B5G services demand for higher SE in the NOMA-based wireless communications. However, traditional ground-to-ground (G2G) communications are hard to satisfy these demands, especially for the cellular uplinks. To solve these challenges, this article proposes a multiple unmanned-aerial-vehicles (UAVs)-aided uplink NOMA method. In detail, multiple hovering UAVs relay data for a half of ground users (GUs) and share the spectrums with the other GUs that communicate with the base station (BS) directly. Furthermore, this article proposes a K-means clustering-based UAV deployment scheme and location-based user pairing (UP) scheme to optimize the transceiver association for the multiple UAVs-aided NOMA uplinks. Finally, a sum power minimization-based resource allocation problem is formulated with the lowest Quality-of-Service (QoS) constraints. We solve it with the message-passing algorithm and evaluate the superior performances of the proposed scheduling and paring schemes on SE and energy efficiency (EE). Extensive simulations are conducted to compare the performances of the proposed schemes with those of the single UAV-aided NOMA uplinks, G2G-based NOMA uplinks, and the proposed multiple UAVs-aided uplinks with a facility location framework-based UAV deployment. Simulation results demonstrate that the proposed multiple UAVs deployment and UP-based NOMA scheme significantly improves the EE and the SE of the cellular uplinks at the cost of only a little relaying power consumption of UAVs.

Accurate downlink channel state information (CSI) is required to be fed back to the base station (BS) in frequency division duplexing (FDD) massive multiple-input multiple-output (MIMO) systems in order to achieve maximum antenna diversity and multiplexing. However, downlink CSI feedback overhead scales with the number of transceiver antennas, a major hurdle for practical deployment of FDD massive MIMO systems. To solve this problem, we propose a compressive sampled CSI feedback method based on deep learning (SampleDL). In SampleDL, the massive MIMO channel matrix is sampled uniformly in time/frequency dimension before being fed into neural networks (NNs), which will reduce the computational resource/time at user equipment (UE) as well as enhance the CSI recovery accuracy at the BS. Both theoretical analysis and normalized mean square errors (NMSE) results confirm the advantages of the proposed method in terms of time complexity and recovery accuracy. Besides, a suitable CSI feedback period is explored by link level simulations, which aims to further reduce the overhead of CSI feedback without degrading the communication quality.

For image semantic segmentation, a fully convolutional network is usually employed as the encoder to abstract visual features of the input image. A meticulously designed decoder is used to decoding the final feature map of the backbone. The output resolution of backbones which are designed for image classification task is too low to match segmentation task. Most existing methods for obtaining the final high-resolution feature map can not fully utilize the information of different layers of the backbone. To adequately extract the information of a single layer, the multi-scale context information of different layers, and the global information of backbone, we present a new attention-augmented module named Dense-attention Context Module (DCM), which is used to connect the common backbones and the other decoding heads. The experiments show the promising results of our method on Cityscapes dataset.

The ‐norm penalised (LP) normalised least mean square algorithm converges faster than the LP normalised least mean fourth algorithm does, but the latter can achieve better steady‐state performance, particularly in regions with low signal‐to‐noise ratios (SNRs). To simultaneously take advantage of both merits, a sparse hybrid adaptive filtering algorithm is proposed in various SNR environments. Specifically, the authors construct a cost function that uses the statistical error term and sparse penalty term. The first term is designed by a hybrid error function of the second‐ and fourth‐order statistical errors, respectively, and the second term is obtained using a sparse constraint function. The hybrid error term can be easily balanced by a proportional parameter . Moreover, they devise a non‐uniform step size in the proposed algorithm to further balance the convergence speed and estimation error. Simulation results are provided to validate the proposed algorithm in various SNR environments.