1 September 2020 in IEEE Transactions on Cognitive Communications and Networking
We develop a framework based on drl to solve the spectrum allocation problem in the emerging iab architecture with large scale deployment and dynamic environment. The available spectrum is divided into several orthogonal sub-channels, and the mbs and all iab nodes have the same spectrum resource for allocation, where a mbs utilizes those sub-channels for access links of associated ue as well as for backhaul links of associated iab nodes, and an iab node can utilize all for its associated ues. This is one of key features in which 5G differs from traditional settings where the backhaul networks are designed independently from the access networks. With the goal of maximizing the sum log-rate of all ue groups, we formulate the spectrum allocation problem into a mix-integer and non-linear programming. However, it is intractable to find an optimal solution especially when the IAB network is large and time-varying. To tackle this problem, we propose to use the latest DRL method by integrating an actor-critic spectrum allocation (ACSA) scheme and dnn to achieve real-time spectrum allocation in different scenarios. The proposed methods are evaluated through numerical simulations and show promising results compared with some baseline allocation policies.
18 December 2020 in IEEE Wireless Communications Letters
Cell-free networks are considered to be a promising distributed network architecture to satisfy the increasing number of users and high rate expectations in beyond-5G systems. However, to further enhance network capacity, an increasing number of high-cost base stations (BSs) is required. To address this problem and inspired by the cost-effective intelligent reflecting surface (IRS) technique, we propose a fully decentralized design framework for cooperative beamforming in IRS-aided cell-free networks. We first transform the centralized weighted sum-rate maximization problem into a tractable consensus optimization problem, and then an incremental alternating direction method of multipliers (ADMM) algorithm is proposed to locally update the beamformer. The complexity and convergence of the proposed method are analyzed, and these results show that the performance of the new scheme can asymptotically approach that of the centralized one as the number of iterations increases. Results also show that IRSs can significantly increase the system sum-rate of cell-free networks and the proposed method outperforms existing decentralized methods.
7 July 2021 in IEEE Communications Letters
To handle the data explosion in the era of Internet-of-things, it is of interest to investigate the decentralized network, with the aim at relaxing the burden at the central server along with preserving data privacy. In this work, we develop a fully decentralized federated learning (FL) framework with an inexact stochastic parallel random walk alternating direction method of multipliers (ISPW-ADMM). Performing more efficient communication and enhanced privacy preservation compared with the current state-of-the-art, the proposed ISPW-ADMM can be partially immune to the effect of time-varying dynamic network and stochastic data collection, while still in fast convergence. Benefiting from the stochastic gradients and biased first-order moment estimation, the proposed framework can be applied to any decentralized FL tasks over time-varying graphs. Thus, to demonstrate the practicability of such a framework in providing fast convergence, high communication efficiency, noise robustness for a specific on-board mission to some extent, we study the extreme learning machine-based FL model beamforming design in unmanned aerial vehicle communications, as verified by the numerical simulations.
26 August 2020 in IEEE Transactions on Cognitive Communications and Networking
Millimeter Wave (mmWave) communications with full-duplex (FD) have the potential of increasing the spectral efficiency, relative to those with half-duplex. However, the residual self-interference (SI) from FD and high pathloss inherent to mmWave signals may degrade the system performance. Meanwhile, hybrid beamforming (HBF) is an efficient technology to enhance the channel gain and mitigate interference with reasonable complexity. However, conventional HBF approaches for FD mmWave systems are based on optimization processes, which are either too complex or strongly rely on the quality of channel state information (CSI). We propose two learning schemes to design HBF for FD mmWave systems, i.e., extreme learning machine based HBF (ELM-HBF) and convolutional neural networks based HBF (CNN-HBF). Specifically, we first propose an alternating direction method of multipliers (ADMM) based algorithm to achieve SI cancellation beamforming, and then use a majorization-minimization (MM) based algorithm for joint transmitting and receiving HBF optimization. To train the learning networks, we simulate noisy channels as input, and select the hybrid beamformers calculated by proposed algorithms as targets. Results show that both learning based schemes can provide more robust HBF performance and achieve at least 22.1% higher spectral efficiency compared to orthogonal matching pursuit (OMP) algorithms. Besides, the online prediction time of proposed learning based schemes is almost 20 times faster than the OMP scheme. Furthermore, the training time of ELM-HBF is about 600 times faster than that of CNN-HBF with 64 transmitting and receiving antennas.
15 June 2018 in IEEE Transactions on Signal Processing
Chinese Remainder Theorem (CRT) has been widely studied with its applications in frequency estimation, phase unwrapping, coding theory and distributed data storage. Since traditional CRT is greatly sensitive to the errors in residues due to noises, the problem of robustly reconstructing integers via the erroneous residues has been intensively studied in the literature. In order to robustly reconstruct integers, there are basically two approaches: one is to introduce common divisors in the moduli and the other is to directly decrease the dynamic range. In this paper, we take further insight into the geometry property of the linear space associated with CRT. Echoing both ways to introduce redundancy, we propose a pseudo metric as a uniform framework to analyze the trade-off between the error bound and the dynamic range for robust CRT. Furthermore, we present the first robust CRT for multiple numbers to solve the problem raised by CRT- based undersampling frequency estimation in general. Based on symmetric polynomials proposed, we proved that in most cases, the problem can be solved in polynomial time efficiently.
6 October 2020 in IEEE Transactions on Signal Processing