12 November 2018 in IEEE Transactions on Communications
In this paper, the edge caching problem in fog radio access network (F-RAN) is investigated. By maximizing the overall cache hit rate, the edge caching optimization problem is formulated to find the optimal policy. Content popularity in terms of time and space is considered from the perspective of regional users. We propose an online content popularity prediction algorithm by leveraging the content features and user preferences, and an offline user preference learning algorithm by using the online gradient descent (OGD) method and the follow the (proximally) regularized leader (FTRL-Proximal) method. Our proposed edge caching policy not only can promptly predict the future content popularity in an online fashion with low complexity, but also can track the content popularity with spatial and temporal popularity dynamic in time without delay. Furthermore, we design two learning based edge caching architectures. Moreover, we theoretically derive the upper bound of the popularity prediction error, the lower bound of the cache hit rate, and the regret bound of the overall cache hit rate of our proposed edge caching policy. Simulation results show that the overall cache hit rate of our proposed policy is superior to those of the traditional policies and asymptotically approaches the optimal performance.
23 March 2020 in IEEE Internet of Things Journal
Non-orthogonal multiple access (NOMA) is one of the promising technologies to meet the huge access demand and high data rate requirements of the next generation networks. In this paper, we investigate the joint subchannel assignment and power allocation problem in an uplink multi-user NOMA system to maximize the energy efficiency (EE). Different from conventional model-based resource allocation methods, we propose three deep reinforcement learning (DRL) based frameworks to solve this non-convex optimization problem, referred to as discrete DRL based resource allocation (DDRA) framework, continuous DRL based resource allocation (CDRA) framework and joint DRL and optimization resource allocation (DORA) framework. Specifically, for the DDRA framework, a multi-DQN based network is designed to dynamically allocate resources discretely, which can reduce the output dimension and improve the learning efficiency. To overcome the loss of power discretization in DDRA, a joint DQN and deep deterministic policy gradient (DDPG) based network (CDRA framework) is designed to generate the resource allocation policy. The DORA framework is then proposed as a performance boundary. Finally, an event triggered learning method is combined with all three frameworks to further reduce the computational consumption. Numerical results show that the proposed frameworks can improve the EE performance of the uplink NOMA system and reduce the computation time.
8 May 2020 in IEEE Transactions on Vehicular Technology
As softwares may be used by multiple users, caching popular softwares at the wireless edge has been considered to save computation and communications resources for mobile edge computing (MEC). However, fetching uncached softwares from the core network and multicasting popular softwares to users have so far been ignored. Thus, existing design is incomplete and less practical. In this paper, we propose a joint caching, computation and communications mechanism which involves software fetching, caching and multicasting, as well as task input data uploading, task executing (with non-negligible time dura- tion) and computation result downloading, and mathematically characterize it. Then, we optimize the joint caching, offloading and time allocation policy to minimize the weighted sum energy consumption subject to the caching and deadline constraints. The problem is a challenging two-timescale mixed integer nonlinear programming (MINLP) problem, and is NP-hard in general. We convert it into an equivalent convex MINLP problem by using some appropriate transformations and propose two low- complexity algorithms to obtain suboptimal solutions of the original non-convex MINLP problem. Specifically, the first sub- optimal solution is obtained by solving a relaxed convex problem using the consensus alternating direction method of multipliers (ADMM), and then rounding its optimal solution properly. The second suboptimal solution is proposed by obtaining a station- ary point of an equivalent difference of convex (DC) problem using the penalty convex-concave procedure (Penalty-CCP) and consensus ADMM. Finally, by numerical results, we show that the proposed solutions outperform existing schemes and reveal their advantages in efficiently utilizing storage, computation and communications resources.
18 February 2022 in IEEE Transactions on Vehicular Technology
Cache-enabled UAVs are widely used as edge servers to provide on-demand content services for ground users. Most of prior works deploy UAVs based on user locations and explore the benefits of UAV caching under static content library. Motivated by this observation, we further consider heterogeneous user activity level and dynamic content library. We formulate a joint optimization problem of UAV deployment and content placement to minimize the average request delay, which is proved to be NP-hard. To tackle this problem efficiently, we decompose this optimization problem into two sub-problems, UAV deployment problem and content placement problem. Specifically, we first jointly consider user activity level and user locations for UAV deployment using weighted K-means method. After the UAV deployment, we propose a Q-learning algorithm to learn the content placement directly, rather than estimating the content popularity first, which is not effective when content library is dynamically changing. The simulation results show that the proposed algorithm outperforms the benchmark algorithms when dynamic content library and heterogeneous user activity level are considered.
20 February 2018 in IEEE Transactions on Communications
Base station cooperation in heterogeneous wireless networks (HetNets) is a promising approach to improve the network performance, but it also imposes a significant challenge on backhaul. On the other hand, caching at small base stations (SBSs) is considered as an efficient way to reduce backhaul load in HetNets. In this paper, we jointly consider SBS caching and cooperation in a downlink large-scale HetNet. We propose two SBS cooperative transmission schemes under random caching at SBSs with the caching distribution as a design parameter. Using tools from stochastic geometry and adopting appropriate integral transformations, we first derive a tractable expression for the successful transmission probability under each scheme. Then, under each scheme, we consider the successful transmission probability maximization by optimizing the caching distribution, which is a challenging optimization problem with a non-convex objective function. By exploring optimality properties and using optimization techniques, under each scheme, we obtain a locally optimal solution in the general case and a globally optimal solution in some special cases. Compared with some existing caching designs in the literature, e.g., the most popular caching, the i.i.d. caching and the uniform caching, the optimal random caching under each scheme achieves a promising successful transmission probability. The analysis and optimization results provide valuable design insights for practical HetNets.
24 December 2018 in IEEE Transactions on Vehicular Technology
In this paper, we investigate an unmanned aerial vehicle (UAV)-enabled full-duplex relaying system. By assuming that the UAV follows a circular trajectory and applies decode-and-forward relaying strategy, we study the joint design of beamforming and power allocation to maximize the instantaneous data rate, under both the individual and the sum power constraints over the source and relay nodes. As the problem is non-convex, we propose an efficient sub-optimal solution based on block-coordinate descent method by decomposing the problem into two sub-problems: a beamforming optimization sub-problem with given power allocation and a power allocation sub-problem with fixed beamforming. For the beamforming design sub-problem, the optimal solution is obtained based on the semi-definite relaxation technique. For low-complexity implementation, we also propose two sub-optimal designs based on transmit zero-forcing/ maximum ratio combing and maximum ratio transmission/ receive zero-forcing. For the power allocation sub-problem, the optimal solution is obtained in closed form. Then, closed form cumulative distribution function and outage probability expressions for sub-optimal beamforming with both uniform power allocation and optimal power allocation are derived. In addition, simple and informative high signal-to-noise ratio (SNR) approximations for outage probability expressions are presented to gain insights, in terms of diversity order, average SNR and relations between outage probability and UAV position. We show that the proposed power allocation does not affect the diversity order but it increases the average SNR, and hence reduces the outage probability in the high SNR regime. The optimal flying altitude that minimizes the average outage probability can be obtained via a one-dimensional search. The fixed wing UAV based mobile relay following a circular trajectory is much more energy efficient than the rotary wing UAV based static relay hovering at a fixed location.