arXiv subjects

Cunhua Pan

Publications and source records attributed to Cunhua Pan.

At least 235 records · Page 13Linked to original sources

arXiv2020

Intelligent Reflecting Surface Aided Multigroup Multicast MISO Communication Systems

Intelligent reflecting surface (IRS) has recently been envisioned to offer unprecedented massive multiple-input multiple-output (MIMO)-like gains by deploying large-scale and low-cost passive reflection elements. By adjusting the reflection coefficients, the IRS can change the phase shifts on the impinging electromagnetic waves so that it can smartly reconfigure the signal propagation environment and enhance the power of the desired received signal or suppress the interference signal. In this paper, we consider downlink multigroup multicast communication systems assisted by an IRS. We aim for maximizing the sum rate of all the multicasting groups by the joint optimization of the precoding matrix at the base station (BS) and the reflection coefficients at the IRS under both the power and unit-modulus constraint. To tackle this non-convex problem, we propose two efficient algorithms under the majorization--minimization (MM) algorithm framework. Specifically, a concave lower bound surrogate objective function of each user's rate has been derived firstly, based on which two sets of variables can be updated alternately by solving two corresponding second-order cone programming (SOCP) problems. Then, in order to reduce the computational complexity, we derive another concave lower bound function of each group's rate for each set of variables at every iteration, and obtain the closed-form solutions under these loose surrogate objective functions. Finally, the simulation results demonstrate the benefits in terms of the spectral and energy efficiency of the introduced IRS and the effectiveness in terms of the convergence and complexity of our proposed algorithms.

eess.SP↗

arXiv2020

Multicell MIMO Communications Relying on Intelligent Reflecting Surface

Intelligent reflecting surfaces (IRSs) constitute a disruptive wireless communication technique capable of creating a controllable propagation environment. In this paper, we propose to invoke an IRS at the cell boundary of multiple cells to assist the downlink transmission to cell-edge users, whilst mitigating the inter-cell interference, which is a crucial issue in multicell communication systems. We aim for maximizing the weighted sum rate (WSR) of all users through jointly optimizing the active precoding matrices at the base stations (BSs) and the phase shifts at the IRS subject to each BS's power constraint and unit modulus constraint. Both the BSs and the users are equipped with multiple antennas, which enhances the spectral efficiency by exploiting the spatial multiplexing gain. Due to the non-convexity of the problem, we first reformulate it into an equivalent one, which is solved by using the block coordinate descent (BCD) algorithm, where the precoding matrices and phase shifts are alternately optimized. The optimal precoding matrices can be obtained in closed form, when fixing the phase shifts. A pair of efficient algorithms are proposed for solving the phase shift optimization problem, namely the Majorization-Minimization (MM) Algorithm and the Complex Circle Manifold (CCM) Method. Both algorithms are guaranteed to converge to at least locally optimal solutions. We also extend the proposed algorithms to the more general multiple-IRS and network MIMO scenarios. Finally, our simulation results confirm the advantages of introducing IRSs in enhancing the cell-edge user performance.

eess.SP↗

arXiv2020

Outage Analysis for Intelligent Reflecting Surface Assisted Vehicular Communication Networks

Vehicular communication is an important application of the fifth generation of mobile communication systems (5G). Due to its low cost and energy efficiency, intelligent reflecting surface (IRS) has been envisioned as a promising technique that can enhance the coverage performance significantly by passive beamforming. In this paper, we analyze the outage probability performance in IRS-assisted vehicular communication networks. We derive the expression of outage probability by utilizing series expansion and central limit theorem. Numerical results show that the IRS can significantly reduce the outage probability for vehicles in its vicinity. The outage probability is closely related to the vehicle density and the number of IRS elements, and better performance is achieved with more reflecting elements.

eess.SP↗

arXiv2020

Stacked Auto Encoder Based Deep Reinforcement Learning for Online Resource Scheduling in Large-Scale MEC Networks

An online resource scheduling framework is proposed for minimizing the sum of weighted task latency for all the Internet of things (IoT) users, by optimizing offloading decision, transmission power and resource allocation in the large-scale mobile edge computing (MEC) system. Towards this end, a deep reinforcement learning (DRL) based solution is proposed, which includes the following components. Firstly, a related and regularized stacked auto encoder (2r-SAE) with unsupervised learning is applied to perform data compression and representation for high dimensional channel quality information (CQI) data, which can reduce the state space for DRL. Secondly, we present an adaptive simulated annealing based approach (ASA) as the action search method of DRL, in which an adaptive h-mutation is used to guide the search direction and an adaptive iteration is proposed to enhance the search efficiency during the DRL process. Thirdly, a preserved and prioritized experience replay (2p-ER) is introduced to assist the DRL to train the policy network and find the optimal offloading policy. Numerical results are provided to demonstrate that the proposed algorithm can achieve near-optimal performance while significantly decreasing the computational time compared with existing benchmarks.

cs.LG↗

arXiv2020

Reconfigurable Intelligent Surfaces-Assisted Multiuser MIMO Uplink Transmission with Partial CSI

This paper considers the application of reconfigurable intelligent surfaces (RISs) (a.k.a. intelligent reflecting surfaces (IRSs)) to assist multiuser multiple-input multiple-output (MIMO) uplink transmission from several multi-antenna user terminals (UTs) to a multi-antenna base station (BS). For reducing the signaling overhead, only partial channel state information (CSI), including the instantaneous CSI between the RIS and the BS as well as the slowly varying statistical CSI between the UTs and the RIS, is exploited in our investigation. In particular, an optimization framework is proposed for jointly designing the transmit covariance matrices of the UTs and the RIS phase shift matrix to maximize the system global energy efficiency (GEE) with partial CSI. We first obtain closed-form solutions for the eigenvectors of the optimal transmit covariance matrices of the UTs. Then, to facilitate the design of the transmit power allocation matrices and the RIS phase shifts, we derive an asymptotically deterministic equivalent of the objective function with the aid of random matrix theory. We further propose a suboptimal algorithm to tackle the GEE maximization problem with guaranteed convergence, capitalizing on the approaches of alternating optimization, fractional programming, and sequential optimization. Numerical results substantiate the effectiveness of the proposed approach as well as the considerable GEE gains provided by the RIS-assisted transmission scheme over the traditional baselines.

cs.IT↗

arXiv2020

Resource Allocation for Intelligent Reflecting Surface Aided Wireless Powered Mobile Edge Computing in OFDM Systems

Wireless powered mobile edge computing (WP-MEC) has been recognized as a promising technique to provide both enhanced computational capability and sustainable energy supply to massive low-power wireless devices. However, its energy consumption becomes substantial, when the transmission link used for wireless energy transfer (WET) and for computation offloading is hostile. To mitigate this hindrance, we propose to employ the emerging technique of intelligent reflecting surface (IRS) in WP-MEC systems, which is capable of providing an additional link both for WET and for computation offloading. Specifically, we consider a multi-user scenario where both the WET and the computation offloading are based on orthogonal frequency-division multiplexing (OFDM) systems. Built on this model, an innovative framework is developed to minimize the energy consumption of the IRS-aided WP-MEC network, by optimizing the power allocation of the WET signals, the local computing frequencies of wireless devices, both the sub-band-device association and the power allocation used for computation offloading, as well as the IRS reflection coefficients. The major challenges of this optimization lie in the strong coupling between the settings of WET and of computing as well as the unit-modules constraint on IRS reflection coefficients. To tackle these issues, the technique of alternative optimization is invoked for decoupling the WET and computing designs, while two sets of locally optimal IRS reflection coefficients are provided for WET and for computation offloading separately relying on the successive convex approximation method. The numerical results demonstrate that our proposed scheme is capable of monumentally outperforming the conventional WP-MEC network without IRSs.

eess.SP↗

arXiv2020

IRS-aided Large-Scale MIMO Systems with Passive Constant Envelope Precoding

In this paper, an intelligent reflecting surface (IRS)-aided large-scale MIMO system is investigated in which constant envelope precoding (CEP) is utilized at each base station (BS). It is both cost-effective and energy-efficient to implement CEP in a large-scale antenna array. We aim to optimize the discrete phase shifts at both the BS and the IRS to minimize the sum power of multi-user interference (MUI) in the system via our proposed three algorithms. For the sake of simplicity, a simple single-cell scenario is considered, where the optimization of the BS and IRS phase shifts is solved by a low-complexity trellis-based algorithm. Then, this algorithm is extended to a multi-cell scenario, where the precoding operation in each BS is performed individually. With the aid of stochastic optimization method, a low-overhead trellis-based solution is proposed which has better performance than the first one. Finally, we solve the optimization problem via the semi-definite relaxation (SDR) scheme, to serve as a performance benchmark for the proposed algorithms. Meanwhile, interference and complexity analysis is provided for the proposed algorithms. Numerical results demonstrate that while the performance of the trellis-based algorithms is negligibly lower than that of the continuous-phase SDR-based solution, the computational complexity and the implementation cost of the former is much lower than the latter, which is appealing for practical applications.

eess.SP↗

arXiv2020

Intelligent Reflecting Surface Aided MIMO Broadcasting for Simultaneous Wireless Information and Power Transfer

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 alternatively 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.

eess.SP↗

arXiv2020

Resource Allocation for Secure URLLC in Mission-Critical IoT Scenario

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.

eess.SP↗

arXiv2020

Intelligent Reflecting Surface Meets Mobile Edge Computing: Enhancing Wireless Communications for Computation Offloading

We consider computation offloading for edge computing in a wireless network equipped with intelligent reflecting surfaces (IRSs). IRS is an emerging technology and has recently received great attention since they can improve the wireless propagation environment in a configurable manner and enhance the connections between mobile devices (MDs) and access points (APs). At this point not many papers consider edge computing in the novel context of wireless communications aided by IRS. In our studied setting, each MD offloads computation tasks to the edge server located at the AP to reduce the associated comprehensive cost, which is a weighted sum of time and energy. The edge server adjusts the IRS to maximize its earning while maintaining MDs' incentives for offloading and guaranteeing each MD a customized information rate. This problem can be formulated into a difficult optimization problem, which has a sum-of-ratio objective function as well as a bunch of nonconvex constraints. To solve this problem, we first develop an iterative evaluation procedure to identify the feasibility of the problem when confronting an arbitrary set of information rate requirement. This method serves as a sufficient condition for the problem being feasible and provides a feasible solution. Based on that we develop an algorithm to optimize the objective function. Our numerical results show that the presence of IRS enables the AP to guarantee higher information rate to all MDs and at the same time improve the earning of the edge server.

eess.SP↗

arXiv2020

An Achievable Region for the Multiple Access Wiretap Channels with Confidential and Open Messages

This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver but only the confidential messages need to be protected from the eavesdropper. By using random coding, we find an achievable secrecy rate region, within which perfect secrecy can be realized, i.e., all users can communicate with the legitimate receiver with arbitrarily small probability of error, while the confidential information leaked to the eavesdropper tends to zero.

cs.IT↗

arXiv2019

Joint Pilot and Payload Power Allocation for Massive-MIMO-enabled URLLC IIoT Networks

The Fourth Industrial Revolution (Industrial 4.0) is coming, and this revolution will fundamentally enhance the way the factories manufacture products. The conventional wired lines connecting central controller to robots or actuators will be replaced by wireless communication networks due to its low cost of maintenance and high deployment flexibility. However, some critical industrial applications require ultra-high reliability and low latency communication (URLLC). In this paper, we advocate the adoption of massive multiple-input multiple output (MIMO) to support the wireless transmission for industrial applications as it can provide deterministic communications similar as wired lines thanks to its channel hardening effects. To reduce the latency, the channel blocklength for packet transmission is finite, and suffers from transmission rate degradation and decoding error probability. Thus, conventional resource allocation for massive MIMO transmission based on Shannon capacity assuming the infinite channel blocklength is no longer optimal. We first derive the closed-form expression of lower bound (LB) of achievable uplink data rate for massive MIMO system with imperfect channel state information (CSI) for both maximum-ratio combining (MRC) and zero-forcing (ZF) receivers. Then, we propose novel low-complexity algorithms to solve the achievable data rate maximization problems by jointly optimizing the pilot and payload transmission power for both MRC and ZF. Simulation results confirm the rapid convergence speed and performance advantage over the existing benchmark algorithms.

eess.SP↗

arXiv2019

Throughput Maximization for Full-Duplex UAV Aided Small Cell Wireless Systems

This paper investigates full-duplex unmanned aerial vehicle (UAV) aided small cell wireless systems, where the UAV serving as the base station (BS) is designed to transmit data to the downlink users and receive data from the uplink users simultaneously. To maximize the total system capacity, including uplink and downlink capacity, the UAV trajectory, downlink/uplink user scheduling, and uplink user transmit power are alternately optimized. The resulting optimization problem is mixed-integer and non-convex, which is challenging to solve. To address it, the block coordinate descent method and successive convex approximation techniques are leveraged. Simulation results demonstrate the significant capacity gain can be achieved by our design compared with the other designs.

cs.IT↗

arXiv2019

Joint Power and Blocklength Optimization for URLLC in a Factory Automation Scenario

In URLLC, short packet transmission is adopted to reduce latency, such that conventional Shannon's capacity formula is no longer applicable, and the achievable data rate in finite blocklength becomes a complex expression with respect to the decoding error probability and the blocklength. To provide URLLC service in a factory automation scenario, we consider that the central controller transmits different packets to a robot and an actuator, where the actuator is located far from the controller, and the robot can move between the controller and the actuator. In this scenario, we consider four fundamental downlink transmission schemes, including orthogonal multiple access (OMA), non-orthogonal multiple access (NOMA), relay-assisted, and cooperative NOMA (C-NOMA) schemes. For all these transmission schemes, we aim for jointly optimizing the blocklength and power allocation to minimize the decoding error probability of the actuator subject to the reliability requirement of the robot, the total energy constraints, as well as the latency constraints. We further develop low-complexity algorithms to address the optimization problems for each transmission scheme. { For the general case with more than two devices, we also develop a low-complexity efficient algorithm for the OMA scheme.} Our results show that the relay-assisted transmission significantly outperforms the OMA scheme, while NOMA scheme performs well when the blocklength is very limited. We further show that the relay-assisted transmission has superior performance over the C-NOMA scheme due to larger feasible region of the former scheme.

eess.SP↗

arXiv2019

Deep Learning Based Joint Resource Scheduling Algorithms for Hybrid MEC Networks

In this paper, we consider a hybrid mobile edge computing (H-MEC) platform, which includes ground stations (GSs), ground vehicles (GVs) and unmanned aerial vehicle (UAVs), all with mobile edge cloud installed to enable user equipments (UEs) or Internet of thing (IoT) devices with intensive computing tasks to offload. Our objective is to obtain an online offloading algorithm to minimize the energy consumption of all the UEs, by jointly optimizing the positions of GVs and UAVs, user association and resource allocation in real-time, while considering the dynamic environment. To this end, we propose a hybrid deep learning based online offloading (H2O) framework where a large-scale path-loss fuzzy c-means (LSFCM) algorithm is first proposed and used to predict the optimal positions of GVs and UAVs. Secondly, a fuzzy membership matrix U-based particle swarm optimization (U-PSO) algorithm is applied to solve the mixed integer nonlinear programming (MINLP) problems and generate the sample datasets for the deep neural network (DNN) where the fuzzy membership matrix can capture the small-scale fading effects and the information of mutual interference. Thirdly, a DNN with the scheduling layer is introduced to provide user association and computing resource allocation under the practical latency requirement of the tasks and limited available computing resource of H-MEC. In addition, different from traditional DNN predictor, we only input one UE information to the DNN at one time, which will be suitable for the scenarios where the number of UE is varying and avoid the curse of dimensionality in DNN.

eess.SP↗

arXiv2019

Ergodic Rate Analysis of Cooperative Ambient Backscatter Communication

Ambient backscatter communication has shown great potential in the development of future wireless networks. It enables a backscatter transmitter (BTx) to send information directly to an adjacent receiver by modulating over ambient radio frequency (RF) carriers. In this paper, we consider a cooperative ambient backscatter communication system where a multi-antenna cooperative receiver separately decodes signals from an RF source and a BTx. Upper bounds of the ergodic rates of both links are derived. The power scaling laws are accordingly characterized for both the primary cellular transmission and the cooperative backscatter. The impact of additional backscatter link is also quantitatively analyzed. Simulation results are provided to verify the derived results.

cs.IT↗

arXiv2019

Efficient Resource Allocation for Mobile-Edge Computing Networks with NOMA: Completion Time and Energy Minimization

This paper investigates an uplink non-orthogonal multiple access (NOMA)-based mobile-edge computing (MEC) network. Our objective is to minimize a linear combination of the completion time of all users' tasks and the total energy consumption of all users including transmission energy and local computation energy subject to computation latency, uploading data rate, time sharing and edge cloud capacity constraints. This work can significantly improve the energy efficiency and end-to-end delay of the applications in future wireless networks. For the general minimization problem, it is first transformed into an equivalent form. Then, an iterative algorithm is accordingly proposed, where closed-form solution is obtained in each step. For the special case with only minimizing the completion time, we propose a bisection-based algorithm to obtain the optimal solution. Also for the special case with infinite cloud capacity, we show that the original minimization problem can be transformed into an equivalent convex one. Numerical results show the superiority of the proposed algorithms compared with conventional algorithms in terms of completion time and energy consumption.

cs.IT↗

arXiv2019

A Caching Strategy Towards Maximal D2D Assisted Offloading Gain

Device-to-Device (D2D) communications incorporated with content caching have been regarded as a promising way to offload the cellular traffic data. In this paper, the caching strategy is investigated to maximize the D2D offloading gain with the comprehensive consideration of user collaborative characteristics as well as the physical transmission conditions. Specifically, for a given content, the number of interested users in different groups is different, and users always ask the most trustworthy user in proximity for D2D transmissions. An analytical expression of the D2D success probability is first derived, which represents the probability that the received signal to interference ratio is no less than a given threshold. As the formulated problem is non-convex, the optimal caching strategy for the special unbiased case is derived in a closed form, and a numerical searching algorithm is proposed to obtain the globally optimal solution for the general case. To reduce the computational complexity, an iterative algorithm based on the asymptotic approximation of the D2D success probability is proposed to obtain the solution that satisfies the Karush-Kuhn-Tucker conditions. The simulation results verify the effectiveness of the analytical results and show that the proposed algorithm outperforms the existing schemes in terms of offloading gain.

eess.SP↗