arXiv subjects

Kezhi Wang

Publications and source records attributed to Kezhi Wang.

At least 145 records · Page 8Linked to original sources

arXiv2020

Spectral and Energy Efficiency of IRS-Assisted MISO Communication with Hardware Impairments

In this letter, we analyze the spectral and energy efficiency of an intelligent reflecting surface (IRS)-assisted multiple-input single-output (MISO) downlink system with hardware impairments. An extended error vector magnitude (EEVM) model is utilized to characterize the impact of radio-frequency (RF) impairments at the access point (AP) and phase noise is considered for the imperfect IRS. We show that the spectral efficiency is limited due to the hardware impairments even when the numbers of AP antennas and IRS elements grow infinitely large, which is in contrast with the conventional case with ideal hardware. Moreover, the performance degradation at high SNR is shown to be mainly affected by the AP hardware impairments rather than the phase noise of IRS. We further obtain the optimal transmit power in closed form for energy efficiency maximization. Simulation results are provided to verify these results.

cs.IT↗

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

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↗

arXiv2019

A Novel Cross Entropy Approach for Offloading Learning in Mobile Edge Computing

In this paper, we propose a novel offloading learning approach to compromise energy consumption and latency in multi-tier network with mobile edge computing. In order to solve this integer programming problem, instead of using conventional optimization tools, we apply a cross entropy approach with iterative learning of the probability of elite solution samples. Compared to existing methods, the proposed one in this network permits a parallel computing architecture and is verified to be computationally very efficient. Specifically, it achieves performance close to the optimal and performs well with different choices of the values of hyperparameters in the proposed learning approach.

cs.IT↗

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

Resource Allocation Using Gradient Boosting Aided Deep Q-Network for IoT in C-RANs

In this paper, we investigate dynamic resource allocation (DRA) problems for Internet of Things (IoT) in real-time cloud radio access networks (C-RANs), by combining gradient boosting approximation and deep reinforcement learning to solve the following two major problems. Firstly, in C-RANs, the decision making process of resource allocation is time-consuming and computational-expensive, motivating us to use an approximation method, i.e. the gradient boosting decision tree (GBDT) to approximate the solutions of second order cone programming (SOCP) problem. Moreover, considering the innumerable states in real-time C-RAN systems, we employ a deep reinforcement learning framework, i.e., deep Q-network (DQN) to generate a robust policy that controls the status of remote radio heads (RRHs). We propose a GBDT-based DQN framework for the DRA problem, where the heavy computation to solve SOCP problems is cut down and great power consumption is saved in the whole C-RAN system. We demonstrate that the generated policy is error-tolerant even the gradient boosting regression may not be strictly subject to the constraints of the original problem. Comparisons between the proposed method and existing baseline methods confirm the advantages of our method.

cs.IT↗

arXiv2019

Bit-level Optimized Neural Network for Multi-antenna Channel Quantization

Quantized channel state information (CSI) plays a critical role in precoding design which helps reap the merits of multiple-input multiple-output (MIMO) technology. In order to reduce the overhead of CSI feedback, we propose a deep learning based CSI quantization method by developing a joint convolutional residual network (JCResNet) which benefits MIMO channel feature extraction and recovery from the perspective of bit-level quantization performance. Experiments show that our proposed method substantially improves the performance.

cs.IT↗

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

Achievable Data Rate for URLLC-Enabled UAV Systems with 3-D Channel Model

In this paper, we investigate the average achievable data rate (AADR) of the control information delivery from the ground control station (GCS) to unmanned-aerial-vehicle (UAV) under a 3-D channel, which requires ultra-reliable and low-latency communications (URLLC) to avoid collision. The value of AADR can give insights on the packet size design. Achievable data rate under short channel blocklength is adopted to characterize the system performance. The UAV is assumed to be uniformly distributed within a restricted space. We first adopt the Gaussian-Chebyshev quadrature (GCQ) to approximate the exact AADR. The tight lower bound of AADR is derived in a closed form. Numerical results verify the correctness and tightness of our derived results.

eess.SP↗

arXiv2019

Unified Offloading Decision Making and Resource Allocation in ME-RAN

In order to support communication and computation cooperation, we propose ME-RAN architecture, which consists of mobile edge cloud (ME) as the computation provision platform and radio access network (RAN) as the communication interface. Cooperative offloading framework is proposed to achieve the following tasks: (1) to increase user equipment' (UE') computing capacity by triggering offloading action, especially for the UE which cannot complete the computation locally; (2) to reduce the energy consumption for all the UEs by considering limited computing and communication resources. Based on above objectives, we formulate the energy consumption minimization problem, which is shown to be a non-convex mixed-integer programming. Firstly, Decentralized Local Decision Algorithm (DLDA) is proposed for each UE to estimate the possible local resource consumption and decide if offloading is in its interest. This operation will reduce the overhead and signalling in the later stage. Then, Centralized decision and resource Allocation algoRithm (CAR) is proposed to conduct the decision making and resource allocation in ME-RAN. Moreover, two low complexity algorithms, i.e., UE with largest saved energy consumption accepted first (CAR-E) and UE with smallest required data rate accepted first (CAR-D) are proposed. Simulations show that the performance of the proposed algorithms is very close to the exhaustive search but with much less complexity.

cs.NI↗

arXiv2019

RL-Based User Association and Resource Allocation for Multi-UAV enabled MEC

In this paper, multi-unmanned aerial vehicle (UAV) enabled mobile edge computing (MEC), i.e., UAVE is studied, where several UAVs are deployed as flying MEC platform to provide computing resource to ground user equipments (UEs). Compared to the traditional fixed location MEC, UAV enabled MEC (i.e., UAVE) is particular useful in case of temporary events, emergency situations and on-demand services, due to its high flexibility, low cost and easy deployment features. However, operation of UAVE faces several challenges, two of which are how to achieve both 1) the association between multiple UEs and UAVs and 2) the resource allocation from UAVs to UEs, while minimizing the energy consumption for all the UEs. To address this, we formulate the above problem into a mixed integer nonlinear programming (MINLP), which is difficult to be solved in general, especially in the large-scale scenario. We then propose a Reinforcement Learning (RL)-based user Association and resource Allocation (RLAA) algorithm to tackle this problem efficiently and effectively. Numerical results show that the proposed RLAA can achieve the optimal performance with comparison to the exhaustive search in small scale, and have considerable performance gain over other typical algorithms in large-scale cases.

cs.NI↗

arXiv2019

Energy Efficient Resource Allocation in UAV-Enabled Mobile Edge Computing Networks

In this paper, we consider the sum power minimization problem via jointly optimizing user association, power control, computation capacity allocation and location planning in a mobile edge computing (MEC) network with multiple unmanned aerial vehicles (UAVs). To solve the nonconvex problem, we propose a low-complexity algorithm with solving three subproblems iteratively. For the user association subproblem, the compressive sensing based algorithm is accordingly is proposed. For the computation capacity allocation subproblem, the optimal solution is obtained in closed form. For the location planning subproblem, the optimal solution is effectively obtained via one-dimensional search method. To obtain a feasible solution for this iterative algorithm, a fuzzy c-means clustering based algorithm is proposed. Numerical results show that the proposed algorithm achieves better performance than conventional approaches.

cs.IT↗

arXiv2018

MIMO Channel Information Feedback Using Deep Recurrent Network

In a multiple-input multiple-output (MIMO) system, the availability of channel state information (CSI) at the transmitter is essential for performance improvement. Recent convolutional neural network (NN) based techniques show competitive ability in realizing CSI compression and feedback. By introducing a new NN architecture, we enhance the accuracy of quantized CSI feedback in MIMO communications. The proposed NN architecture invokes a module named long short-term memory (LSTM) which admits the NN to benefit from exploiting temporal and frequency correlations of wireless channels. Compromising performance with complexity, we further modify the NN architecture with a significantly reduced number of parameters to be trained. Finally, experiments show that the proposed NN architectures achieve better performance in terms of both CSI compression and recovery accuracy.

cs.IT↗

arXiv2018

Proportional fairness in wireless powered CSMA/CA based IoT networks

This paper considers the deployment of a hybrid wireless data/power access point in an 802.11-based wireless powered IoT network. The proportionally fair allocation of throughputs across IoT nodes is considered under the constraints of energy neutrality and CPU capability for each device. The joint optimization of wireless powering and data communication resources takes the CSMA/CA random channel access features, e.g. the backoff procedure, collisions, protocol overhead into account. Numerical results show that the optimized solution can effectively balance individual throughput across nodes, and meanwhile proportionally maximize the overall sum throughput under energy constraints.

cs.NI↗

arXiv2017

Optimal Task Allocation in Near-Far Computing Enhanced C-RAN for Wireless Big Data Processing

With the increasing popularity of user equipments (UEs), the corresponding UEs' generating big data (UGBD) is also growing substantially, which makes both UEs and current network structures struggling in processing those data and applications. This paper proposes a Near-Far Computing Enhanced C-RAN (NFC-RAN) architecture, which can better process big data and its corresponding applications. NFC-RAN is composed of near edge computing (NEC) and far edge computing (FEC) units. NEC is located in remote radio head (RRH), which can fast respond to delay sensitive tasks from the UEs, while FEC sits next to baseband unit (BBU) pool which can do other computational intensive tasks. The task allocation between NEC or FEC is introduced in this paper. Also WiFi indoor positioning is illustrated as a case study of the proposed architecture. Moreover, simulation and experiment results are provided to show the effectiveness of the proposed task allocation and architecture.

cs.NI↗

arXiv2017

Computation Diversity in Emerging Networking Paradigms

Nowadays, computation is playing an increasingly more important role in the future generation of computer and communication networks, as exemplified by the recent progress in software defined networking (SDN) for wired networks as well as cloud radio access networks (C-RAN) and mobile cloud computing (MCC) for wireless networks. This paper proposes a unified concept, i.e., computation diversity, to describe the impact and diverse forms of the computation resources on both wired and wireless communications. By linking the computation resources to the communication networks based on quality of service (QoS) requirements, we can show how computation resources influence the networks. Moreover, by analyzing the different functionalities of computation resources in SDN, C-RAN, and MCC, we can show diverse and flexible form that the computation resources present in different networks. The study of computation diversity can provide guidance to the future networks design, i.e., how to allocate the resources jointly between computation (e.g., CPU capacity) and communication (e.g., bandwidth), and thereby saving system energy and increase users' experiences.

cs.NI↗

arXiv2017

A Resource Management Protocol for Mobile Cloud Using Auto-Scaling

Cloud radio access networks (C-RAN) and Mobile Cloud Computing (MCC) have emerged as promising candidates for the next generation access network techniques. MCC enables resource limited mobile devices to offload computationally intensive tasks to the cloud, while C-RAN offers a technology that addresses the increasing mobile traffic. In this paper, we propose a protocol for task offloading and for managing resources in both C-RAN and mobile cloud together using a centralised controller. Experiments on resource management using cloud auto-scaling shows that resource (CPU, RAM, Storage) scaling times vary.

cs.DC↗

arXiv2016

Joint Energy Minimization and Resource Allocation in C-RAN with Mobile Cloud

Cloud radio access network (C-RAN) has emerged as a potential candidate of the next generation access network technology to address the increasing mobile traffic, while mobile cloud computing (MCC) offers a prospective solution to the resource-limited mobile user in executing computation intensive tasks. Taking full advantages of above two cloud-based techniques, C-RAN with MCC are presented in this paper to enhance both performance and energy efficiencies. In particular, this paper studies the joint energy minimization and resource allocation in C-RAN with MCC under the time constraints of the given tasks. We first review the energy and time model of the computation and communication. Then, we formulate the joint energy minimization into a non-convex optimization with the constraints of task executing time, transmitting power, computation capacity and fronthaul data rates. This non-convex optimization is then reformulated into an equivalent convex problem based on weighted minimum mean square error (WMMSE). The iterative algorithm is finally given to deal with the joint resource allocation in C-RAN with mobile cloud. Simulation results confirm that the proposed energy minimization and resource allocation solution can improve the system performance and save energy.

cs.NI↗