Search

We consider the uplink transmission in multiuser wireless systems with multiple single-antenna transmitting users and a multiantenna receiver. We address two problems in this paper. The first problem is user admission, i.e., given a large number of users, how to admit the maximum number of users that can simultaneously satisfy quality of service (QoS) and power constraints. The second problem is how to distribute the data among the users when they are allowed to share data before transmission. The aim is to minimize the total data exchange cost. Such a problem is called user clustering. We formulate those problems into sparsity-maximization problems, which are NP-hard. Inspired by compressive sensing techniques, we propose a common framework to tackle those problems by first applying the \ell1 -norm relaxation and then solving them with convex optimization methods. Simulations show that the proposed algorithms achieve excellent performance. For user admission, the numbers of admitted users by the proposed algorithms are close to the optimum numbers of admitted users obtained by exhaustive search (ES) . For user clustering, the total data exchange cost is reduced by more than 10% after only a few iterations. When the QoS requirement is low, the user data exchange can be avoided using the proposed method, which achieves the optimum result obtained by ES. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the beamformer design of the energy-efficient downlink multicast cloud radio access network (C-RAN) with the compression and data-sharing strategies, respectively. With the imperfect channel state information, we aim to maximize the worst-case energy efficiency (EE), which is defined as the ratio of the sum of worst-case group rates to the total power consumption of the network. The formulated problems for both strategies are non-convex and challenging to solve. In order to find the solutions, we develop a two-layer iterative algorithm that recast the formulated problems as a series of convex quadratic matrix inequality problems which can be solved by the generated Augmented Lagrangian method. The convergence of the proposed algorithms is proved via both analytical and simulated ways, and the effectiveness of them on improving EE is also validated. Moreover, through the comparison of the two transmission strategies considered, we find that the compression strategy can achieve higher worst-case EE than the data-sharing strategy in most scenarios, except for the case with low rate requirement in small-size network. Our conclusions can be used as meaningful references for the practical system design. [ABSTRACT FROM AUTHOR]

In this paper, we establish a framework for enabling ultra-reliable and low-latency communications in the control and non-payload communications (CNPC) links of the unmanned aerial vehicle (UAV) communication systems. We first derive the available range of the CNPC links between UAVs and a ground control station. The available range is defined as the maximal horizontal communication distance within which the round-trip delay and the overall packet loss probability can be ensured with a required probability. To exploit the macro-diversity gain of the distributed multi-antenna systems (DAS) and the array gain of the centralized multi-antenna systems (CAS), we consider a modified DAS (M-DAS), where the ground control station is equipped with the distributed access points (APs), and each AP can have multiple antennas. We then show that the available range can be maximized by judiciously optimizing the altitude of UAVs, the duration of the uplink and downlink phases, and the antenna configuration. To solve the non-convex problem, we propose an algorithm that can converge to the optimal solution in DAS and CAS, and then extend it into more general M-DAS. The simulation and numerical results validate our analysis and show that the available range of M-DAS can be significantly larger than those of the DAS and CAS. [ABSTRACT FROM AUTHOR]

Supporting ultra-reliable and low-latency communications (URLLC) is one of the major goals for the fifth-generation cellular networks. Since spectrum usage efficiency is always a concern, and large bandwidth is required for ensuring stringent quality-of-service (QoS), we minimize the total bandwidth under the QoS constraints of URLLC. We first propose a packet delivery mechanism for URLLC. To reduce the required bandwidth for ensuring queueing delay, we consider a statistical multiplexing queueing mode, where the packets to be sent to different devices are waiting in one queue at the base station, and broadcast mode is adopted in downlink transmission. In this way, downlink bandwidth is shared among packets of multiple devices. In uplink transmission, orthogonal subchannels are allocated to different devices to avoid strong interference. Then, we jointly optimize uplink and downlink bandwidth configuration and delay components to minimize the total bandwidth required to guarantee the overall packet loss and end-to-end delay, which includes uplink and downlink transmission delays, queueing delay, and backhaul delay. We propose a two-step method to find the optimal solution. Simulation and numerical results validate our analysis and show remarkable performance gain by jointly optimizing uplink and downlink configuration. [ABSTRACT FROM PUBLISHER]

Supporting ultra-reliable and low-latency communications (URLLC) is one of the major goals in 5G communication systems. Previous studies focus on ensuring end-to-end delay requirement by reducing transmission delay and coding delay, and only consider reliability in data transmission. However, the reliability reflected by overall packet loss also includes other components such as queueing delay violation. Moreover, which tools are appropriate to design radio resource allocation under constraints on delay, reliability, and availability is not well understood. As a result, how to optimize resource allocation for URLLC is still unclear. In this article, we first discuss the delay and packet loss components in URLLC and the network availability for supporting the quality of service of users. Then we present tools for resource optimization in URLLC. Last, we summarize the major challenges related to resource management for URLLC, and perform a case study. [ABSTRACT FROM AUTHOR]

Cloud radio access network (C-RAN) has recently attracted much attention as a promising architecture for future mobile networks to sustain the exponential growth of data rate. In C-RAN, one data processing center or baseband unit (BBU) communicates with users via distributed remote radio heads (RRHs), which are connected to the BBU via high capacity, low latency fronthaul links. In this paper, we study the compression on fronthaul uplinks and propose a joint decompression algorithm at the BBU. The central premise behind the proposed algorithm is to exploit the correlation between RRHs. Our contribution is threefold. First, we propose a joint decompression and detection (JDD) algorithm which jointly performs decompressing and detecting. The JDD algorithm takes into consideration both the fading and compression effect in a single decoding step. Second, block error rate (BLER) of the proposed algorithm is analyzed in closed-form by using pair-wise error probability analysis. Third, based on the analyzed BLER, we propose adaptive compression schemes subject to quality of service (QoS) constraints to minimize the fronthaul transmission rate while satisfying the pre-defined target QoS. As a dual problem, we also propose a scheme to minimize the signal distortion subject to fronthaul rate constraint. Numerical results demonstrate that the proposed adaptive compression schemes can achieve a compression ratio of 300% in experimental setups. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) relay networks are convinced to be a significant complement to terrestrial infrastructures to provide robust network capacity. However, most of the existing works either considered enhanced mobile broadband (eMBB) payload communication or ultra-reliable and low latency communications (URLLC) control information communication. In this paper, we investigate resource allocation for the eMBB payload and URLLC control information communication multiplexing in a multi-UAV relay network. We firstly propose a multi-UAV relay model comprehensively considering path loss, small-scale channel fading and different quality of service requirements of eMBB and URLLC communications. Then we formulate the multiplexing problem as a joint user association, bandwidth and transmit power optimization problem to improve total transmission data rate and reduce power consumption. The solution of this problem is challenging due to different capacity characteristics of eMBB and URLLC communications, the coupling of continuous variables and integer variables, and the non-convexity. To mitigate these challenges, we equivalently decompose the original optimization problem into a URLLC problem and an eMBB problem. For the URLLC problem, we derive closed-form expressions of the optimal bandwidth and transmit power. For the eMBB problem, we develop an iterative solution framework of alternatively optimizing user association, bandwidth and transmit power. [ABSTRACT FROM AUTHOR]

This work exploits the advantages of two prominent techniques in future communication networks, namely caching and non-orthogonal multiple access (NOMA). Particularly, a system with Rayleigh fading channels and cache-enabled users is analyzed. It is shown that the caching-NOMA combination provides a new opportunity of cache hit which enhances the cache utility as well as the effectiveness of NOMA. Importantly, this comes without requiring users’ collaboration, and thus, avoids many complicated issues such as users’ privacy and security, selfishness, etc. In order to optimize users’ quality of service and, concurrently, ensure the fairness among users, the probability that all users can decode the desired signals is maximized. In NOMA, a combination of multiple messages are sent to users, and the defined objective is approached by finding an appropriate power allocation for message signals. To address the power allocation problem, two novel methods are proposed. The first one is a divide-and-conquer-based method for which closed-form expressions for the optimal resource allocation policy are derived making this method simple and flexible to the system context. The second one is based on deep reinforcement learning method that allows all users to share the full bandwidth. Finally, simulation results are provided to demonstrate the effectiveness of the proposed methods and to compare their performance. [ABSTRACT FROM AUTHOR]

Ultra-reliable and low-latency communications (URLLC) have stringent requirements on quality-of-service and network availability. Due to path loss and shadowing, it is very challenging to guarantee the stringent requirements of URLLC with satisfactory communication range. In this paper, we first provide a quantitative definition of network availability in the short blocklength regime: the probability that the reliability and latency requirements can be satisfied when the blocklength of channel codes is short. Then, we establish a framework to maximize the available range, defined as the maximal communication distance subject to the network availability requirement, by exploiting multi-connectivity. The basic idea is using both device-to-device (D2D) and cellular links to transmit each packet. The practical setup with correlated shadowing between D2D and cellular links is considered. Besides, since processing delay for decoding packets cannot be ignored in URLLC, its impacts on the available range are studied. By comparing the available ranges of different transmission modes, we obtained some useful insights on how to choose transmission modes. Simulation and numerical results validate our analysis and show that multi-connectivity can improve the available ranges of D2D and cellular links remarkably. [ABSTRACT FROM AUTHOR]

Supporting cooperative radio among remote radio heads (RRHs) and elastic cloud service in the baseband unit (BBU) pool, cloud radio access network (C-RAN) is perceived as a promising solution for the next mobile network. In C-RAN, cooperative radio can enhance power saving at RRHs, along with impact on computation effort and power saving in the BBU pool. In turn, power saving at RRHs, benefited from cooperative radio is restricted by the constrained computation capacity provisioned by processors in the BBU pool. Besides, limited fronthauls, which support baseband signal transfer between the BBU pool and RRHs, affect the cooperative radio design and power consumption at RRH as well. By jointly optimizing transmit beamforming among RRHs and processor sleeping in the BBU pool, we exploit such interplay between communication and computation for system power minimization in C-RAN with limited fronthaul and computation capacity. Specifically, we formulate this problem as a mixed-integer non-linear programming problem (MINLP), and then leverage the special structure of the MINLP to make a near optimal decision on the set of active processors and transmit beamforming vectors with high efficiency. Finally, extensive numerical results demonstrate that our proposed algorithms can enforce processor sleeping and reduce system power consumption significantly. [ABSTRACT FROM AUTHOR]