An intelligent reflecting surface (IRS) is invoked for enhancing the energy harvesting performance of a simultaneous wireless information and power transfer (SWIPT) aided system. Specifically, an ...IRS-assisted SWIPT system is considered, where a multi-antenna aided base station (BS) communicates with several multi-antenna assisted information receivers (IRs), while guaranteeing the energy harvesting requirement of the energy receivers (ERs). To maximize the weighted sum rate (WSR) of IRs, the transmit precoding (TPC) matrices of the BS and passive phase shift matrix of the IRS should be jointly optimized. To tackle this challenging optimization problem, we first adopt the classic block coordinate descent (BCD) algorithm for decoupling the original optimization problem into several subproblems and alternately optimize the TPC matrices and the phase shift matrix. For each subproblem, we provide a low-complexity iterative algorithm, which is guaranteed to converge to the Karush-Kuhn-Tucker (KKT) point of each subproblem. The BCD algorithm is rigorously proved to converge to the KKT point of the original problem. We also conceive a feasibility checking method to study its feasibility. Our extensive simulation results confirm that employing IRSs in SWIPT beneficially enhances the system performance and the proposed BCD algorithm converges rapidly, which is appealing for practical applications.
Computation off-loading in mobile edge computing (MEC) systems constitutes an efficient paradigm of supporting resource-intensive applications on mobile devices. However, the benefit of MEC cannot be ...fully exploited, when the communications link used for off-loading computational tasks is hostile. Fortunately, the propagation-induced impairments may be mitigated by intelligent reflecting surfaces (IRS), which are capable of enhancing both the spectral- and energy-efficiency. Specifically, an IRS comprises an IRS controller and a large number of passive reflecting elements, each of which may impose a phase shift on the incident signal, thus collaboratively improving the propagation environment. In this paper, the beneficial role of IRSs is investigated in MEC systems, where single-antenna devices may opt for off-loading a fraction of their computational tasks to the edge computing node via a multi-antenna access point with the aid of an IRS. Pertinent latency-minimization problems are formulated for both single-device and multi-device scenarios, subject to practical constraints imposed on both the edge computing capability and the IRS phase shift design. To solve this problem, the block coordinate descent (BCD) technique is invoked to decouple the original problem into two subproblems, and then the computing and communications settings are alternatively optimized using low-complexity iterative algorithms. It is demonstrated that our IRS-aided MEC system is capable of significantly outperforming the conventional MEC system operating without IRSs. Quantitatively, about 20 % computational latency reduction is achieved over the conventional MEC system in a single cell of a 300 m radius and 5 active devices, relying on a 5-antenna access point.
This paper jointly optimizes the precoding matrices and the set of active remote radio heads (RRHs) to minimize the network power consumption for a user-centric cloud radio access network, where both ...the RRHs and users have multiple antennas and each user is served by its nearby RRHs. Both users' rate requirements and per-RRH power constraints are considered. Due to these conflicting constraints, this optimization problem may be infeasible. In this paper, we propose to solve this problem in two stages. In Stage I, a low-complexity user selection algorithm is proposed to find the largest subset of feasible users. In Stage II, a low-complexity algorithm is proposed to solve the optimization problem with the users selected from Stage I. Specifically, the re-weighted l 1 -norm minimization method is used to transform the original problem with non-smooth objective function into a series of weighted power minimization (WPM) problems, each of which can be solved by the weighted minimum mean square error (WMMSE) method. The solution obtained by the WMMSE method is proved to satisfy the Karush-Kuhn-Tucker conditions of the WPM problem. Moreover, a low-complexity algorithm based on Newton's method and the gradient descent method is developed to update the precoder matrices in each iteration of the WMMSE method. Simulation results demonstrate the rapid convergence of the proposed algorithms and the benefits of equipping multiple antennas at the user side. Moreover, the proposed algorithm is shown to achieve near-optimal performance in terms of NPC.
This letter investigates a power allocation problem in a downlink single-input single-output non-orthogonal multiple access (NOMA) system. Our goal is to maximize the sum rate of users subject to ...minimum user rate requirements. We rigorously prove the optimal user decoding order, and show that the sum rate maximization problem is convex, which guarantees the globally optimal solution. Numerical results validate the performance gain by the proposed NOMA compared with conventional schemes.
Ultra-reliable low latency communication (URLLC) is one of three primary use cases in the fifth-generation (5G) networks, and its research is still in its infancy due to its stringent and conflicting ...requirements in terms of extremely high reliability and low latency. To reduce latency, the channel blocklength for packet transmission is finite, which incurs transmission rate degradation and higher decoding error probability. In this case, conventional resource allocation based on Shannon capacity achieved with infinite blocklength codes is not optimal. Security is another critical issue in mission-critical internet of things (IoT) communications, and physical-layer security is a promising technique that can ensure the confidentiality for wireless communications as no additional channel uses are needed for the key exchange as in the conventional upper-layer cryptography method. This paper is the first work to study the resource allocation for a secure mission-critical IoT communication system with URLLC. Specifically, we adopt the security capacity formula under finite blocklength and consider two optimization problems: weighted throughput maximization problem and total transmit power minimization problem. Each optimization problem is non-convex and challenging to solve, and we develop efficient methods to solve each optimization problem. Simulation results confirm the fast convergence speed of our proposed algorithm and demonstrate the performance advantages over the existing benchmark algorithms.
Non-orthogonal multiple access (NOMA) is potentially capable of circumventing the limitations of the classic orthogonal multiple access schemes. Hence, it has recently received significant research ...attention in both industry and academia. This article is focused on exploiting multiple antenna techniques in NOMA networks, with an emphasis on investigating the rate region of MIMO-NOMA, while reviewing two popular multiple antennas aided NOMA structures, as well as underlining resource management problems of both single-carrier and multi-carrier MIMO-NOMA networks. This article also points out several effective methods of tackling the practical implementation constraints of multiple-antenna NOMA networks. Finally, some promising open research directions are provided in the context of multiple- antenna-aided NOMA.
This letter investigates an uplink power control problem for unmanned aerial vehicles (UAVs)-assisted wireless communications. We jointly optimize the UAV's flying altitude, antenna beamwidth, UAV's ...location, and ground terminals' allocated bandwidth, and transmit power to minimize the sum uplink power subject to the minimal rate demand. An iterative algorithm is proposed with low complexity to obtain a suboptimal solution. Numerical results show that the proposed algorithm can achieve good performance in terms of uplink sum power saving.
This paper considers the unavailability of complete channel state information (CSI) in ultra-dense cloud radio access networks. The user-centric cluster is adopted to reduce the computational ...complexity, while the incomplete CSI is considered to reduce the heavy channel training overhead, where only large-scale inter-cluster CSI is available. Channel estimation for intra-cluster CSI is also considered, where we formulate a joint pilot allocation and user equipment (UE) selection problem to maximize the number of admitted UEs with fixed number of pilots. A novel pilot allocation algorithm is proposed by considering the multi-UE pilot interference. Then, we consider robust beam-vector optimization problem subject to UEs' data rate requirements and fronthaul capacity constraints, where the channel estimation error and incomplete inter-cluster CSI are considered. The exact data rate is difficult to obtain in closed form, and instead we conservatively replace it with its lower-bound. The resulting problem is non-convex, combinatorial, and even infeasible. A practical algorithm, based on UE selection, successive convex approximation and semi-definite relaxation approach, is proposed to solve this problem with guaranteed convergence. We strictly prove that the semidefinite relaxation is tight with probability 1. Finally, extensive simulation results are presented to show the fast convergence of our proposed algorithm and demonstrate its superiority over the existing algorithms.
This paper studies energy efficient resource allocation for a machine-to-machine enabled cellular network with nonlinear energy harvesting, especially focusing on two different multiple access ...strategies, namely nonorthogonal multiple access (NOMA) and time division multiple access (TDMA). Our goal is to minimize the total energy consumption of the network via joint power control and time allocation while taking into account circuit power consumption. For both NOMA and TDMA strategies, we show that it is optimal for each machine type communication device (MTCD) to transmit with the minimum throughput, and the energy consumption of each MTCD is a convex function with respect to the allocated transmission time. Based on the derived optimal conditions for the transmission power of MTCDs, we transform the original optimization problem for NOMA to an equivalent problem which can be solved suboptimally via an iterative power control and time allocation algorithm. Through an appropriate variable transformation, we also transform the original optimization problem for TDMA to an equivalent tractable problem, which can be iteratively solved. Numerical results verify the theoretical findings and demonstrate that NOMA consumes less total energy than TDMA at low circuit power regime of MTCDs, while at high circuit power regime of MTCDs TDMA achieves better network energy efficiency than NOMA.