Search

In this paper, we consider a reconfigurable intelligent surface (RIS)-assisted two-way relay network, in which two users exchange information through the base station (BS) with the help of an RIS. By jointly designing the phase shifts at the RIS and beamforming matrix at the BS, our objective is to maximize the minimum signal-to-noise ratio (SNR) of the two users, under the transmit power constraint at the BS. We first consider the single-antenna BS case, and propose two algorithms to design the RIS phase shifts and the BS power amplification parameter, namely the SNR-upper-bound-maximization (SUM) method, and genetic-SNR-maximization (GSM) method. When there are multiple antennas at the BS, the optimization problem can be approximately addressed by successively solving two decoupled subproblems, one to optimize the RIS phase shifts, the other to optimize the BS beamforming matrix. The first subproblem can be solved by using SUM or GSM method, while the second subproblem can be solved by using optimized beamforming or maximum-ratio-beamforming method. The proposed algorithms have been verified through numerical results with computational complexity analysis.

This paper investigates a full-duplex orthogonal-frequency-division multiple access (OFDMA) based multiple unmanned aerial vehicles (UAVs)-enabled wireless-powered Internet-of-Things (IoT) networks. In this paper, a swarm of UAVs is first deployed in three dimensions (3D) to simultaneously charge all devices, i.e., a downlink (DL) charging period, and then flies to new locations within this area to collect information from scheduled devices in several epochs via OFDMA due to potential limited number of channels available in Narrow Band IoT, i.e., an uplink (UL) communication period. To maximize the UL throughput of IoT devices, we jointly optimizes the UL-and-DL 3D deployment of the UAV swarm, including the device-UAV association, the scheduling order, and the UL-DL time allocation. In particular, the DL energy harvesting (EH) threshold of devices and the UL signal decoding threshold of UAVs are taken into consideration when studying the problem. Besides, both line-of-sight (LoS) and non-line-of-sight (NLoS) channel models are studied depending on the position of sensors and UAVs. The influence of the potential limited channels issue in NB-IoT is also considered by studying the IoT scheduling policy. Two scheduling policies, a near-first (NF) policy and a far-first (FF) policy, are studied. It is shown that the NF scheme outperforms FF scheme in terms of sum throughput maximization; whereas FF scheme outperforms NF scheme in terms of system fairness.

Cognitive radio (CR) is an effective solution to improve the spectral efficiency (SE) of wireless communications by allowing the secondary users (SUs) to share spectrum with primary users. Meanwhile, intelligent reflecting surface (IRS), also known as reconfigurable intelligent surface (RIS), has been recently proposed as a promising approach to enhance energy efficiency (EE) of wireless communication systems through intelligently reconfiguring the channel environment. To improve both SE and EE, in this paper, we introduce multiple IRSs to a downlink multiple-input single-output (MISO) CR system, in which a single SU coexists with a primary network with multiple primary user receivers (PU-RXs). Our design objective is to maximize the achievable rate of SU subject to a total transmit power constraint on the SU transmitter (SU-TX) and interference temperature constraints on the PU-RXs, by jointly optimizing the beamforming at SU-TX and the reflecting coefficients at each IRS. Both perfect and imperfect channel state information (CSI) cases are considered in the optimization. Numerical results demonstrate that the introduction of IRS can significantly improve the achievable rate of SU under both perfect and imperfect CSI cases.

Channel-state-information (CSI) feedback methods are considered, especially for massive or very large-scale multiple-input multiple-output (MIMO) systems. To extract essential information from the CSI without redundancy that arises from the highly correlated antennas, a receiver transforms (sparsifies) a correlated CSI vector to an uncorrelated sparse CSI vector by using a Karhunen-Loeve transform (KLT) matrix that consists of the eigen vectors of covariance matrix of CSI vector and feeds back the essential components of the sparse CSI, i.e., a principal component analysis method. A transmitter then recovers the original CSI through the inverse transformation of the feedback vector. Herein, to obtain the covariance matrix at transceiver, we derive analytically the covariance matrix of spatially correlated Rayleigh fading channels based on its statistics including transmit antennas' and receive antennas' correlation matrices, channel variance, and channel delay profile. With the knowledge of the channel statistics, the transceiver can readily obtain the covariance matrix and KLT matrix. Compression feedback error and bit-error-rate performance of the proposed method are analyzed. Numerical results verify that the proposed method is promising, which reduces significantly the feedback overhead of the massive-MIMO systems with marginal performance degradation from full-CSI feedback (e.g., feedback amount reduction by 80%, i.e., 1/5 of original CSI, with spectral efficiency reduction by only 2%). Furthermore, we show numerically that, for a given limited feedback amount, we can find the optimal number of transmit antennas to achieve the largest spectral efficiency, which is a new design framework., Comment: 10 pages, 5 figures

We propose a multicast scheduling scheme to exploit content reuse when there is asynchronicity in user requests. A unicast transmission setup is used for content delivery, while multicast transmission is employed opportunistically to reduce wireless resource usage. We then develop a multicast scheduling scheme for the downlink multiple-input multiple output orthogonal-frequency division multiplexing system in IEEE 802.11 wireless local area network (WLAN). At each time slot, the scheduler serves the users by either unicast or multicast transmission. Out-sequence data received by a user is stored in user's cache for future use.Multicast precoding and user selection for multicast grouping are also considered and compliance with the IEEE 802.11 WLAN transmission protocol. The scheduling scheme is based on the Lyapunov optimization technique, which aims to maximize system rate. The resulting scheme has low complexity and requires no prior statistical information on the channels and queues. Furthermore, in the absence of channel error, the proposed scheme restricts the worst case of frame dropping deadline, which is useful for delivering real-time traffic. Simulation results show that our proposed algorithm outperforms existing techniques by 17 % to 35 % in term of user capacity., Comment: 6 pages, conference

Large-scale distributed-antenna system (L-DAS) with very large number of distributed antennas, possibly up to a few hundred antennas, is considered. A few major issues of the L-DAS, such as high latency, energy consumption, computational complexity, and large feedback (signaling) overhead, are identified. The potential capability of the L-DAS is illuminated in terms of an energy efficiency (EE) throughout the paper. We firstly and generally model the power consumption of an L-DAS, and formulate an EE maximization problem. To tackle two crucial issues, namely the huge computational complexity and large amount of feedback (signaling) information, we propose a channel-gain-based antenna selection (AS) method and an interference-based user clustering (UC) method. The original problem is then split into multiple subproblems by a cluster, and each cluster's precoding and power control are managed in parallel for high EE. Simulation results reveal that i) using all antennas for zero-forcing multiuser multiple-input multiple-output (MU-MIMO) is energy inefficient if there is nonnegligible overhead power consumption on MU-MIMO processing, and ii) increasing the number of antennas does not necessarily result in a high EE. Furthermore, the results validate and underpin the EE merit of the proposed L-DAS complied with the AS, UC, precoding, and power control by comparing with non-clustering L-DAS and colocated antenna systems., Comment: 29 pages, 7 figures, submitted to JSTSP

In wireless communication systems, the nonlinear effect and inefficiency of power amplifier (PA) have posed practical challenges for system designs to achieve high spectral efficiency (SE) and energy efficiency (EE). In this paper, we analyze the impact of PA on the SE-EE tradeoff of orthogonal frequency division multiplex (OFDM) systems. An ideal PA that is always linear and incurs no additional power consumption can be shown to yield a decreasing convex function in the SE-EE tradeoff. In contrast, we show that a practical PA has an SE-EE tradeoff that has a turning point and decreases sharply after its maximum EE point. In other words, the Pareto-optimal tradeoff boundary of the SE-EE curve is very narrow. A wide range of SE-EE tradeoff, however, is desired for future wireless communications that have dynamic demand depending on the traffic loads, channel conditions, and system applications, e.g., high-SE-with-low-EE for rate-limited systems and high-EE-with-low-SE for energy-limited systems. For the SE-EE tradeoff improvement, we propose a PA switching (PAS) technique. In a PAS transmitter, one or more PAs are switched on intermittently to maximize the EE and deliver an overall required SE. As a consequence, a high EE over a wide range SE can be achieved, which is verified by numerical evaluations: with 15% SE reduction for low SE demand, the PAS between a low power PA and a high power PA can improve EE by 323%, while a single high power PA transmitter improves EE by only 68%., Comment: to be published, IEEE J. Sel. Areas Commun

Joint channel and rate allocation with power minimization in orthogonal frequency-division multiple access (OFDMA) has attracted extensive attention. Most of the research has dealt with the development of sub-optimal but low-complexity algorithms. In this paper, the contributions comprise new insights from revisiting tractability aspects of computing optimum. Previous complexity analyses have been limited by assumptions of fixed power on each subcarrier, or power-rate functions that locally grow arbitrarily fast. The analysis under the former assumption does not generalize to problem tractability with variable power, whereas the latter assumption prohibits the result from being applicable to well-behaved power-rate functions. As the first contribution, we overcome the previous limitations by rigorously proving the problem's NP-hardness for the representative logarithmic rate function. Next, we extend the proof to reach a much stronger result, namely that the problem remains NP-hard, even if the channels allocated to each user is restricted to a consecutive block with given size. We also prove that, under these restrictions, there is a special case with polynomial-time tractability. Then, we treat the problem class where the channels can be partitioned into an arbitrarily large but constant number of groups, each having uniform gain for every individual user. For this problem class, we present a polynomial-time algorithm and prove optimality guarantee. In addition, we prove that the recognition of this class is polynomial-time solvable., Comment: 20 pages