Search

Plane spiral orbital angular momentum (PSOAM) mode-groups (MGs) and multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) serve as two emerging techniques for achieving high spectral efficiency (SE) in the next-generation networks. In this paper, a PSOAM MGs based multi-user MIMO-NOMA system is studied, where the base station transmits data to users by utilizing the generated PSOAM beams. For such scenario, the interference between users in different PSOAM mode groups can be avoided, which leads to a significant performance enhancement. We aim to maximize the energy efficiency (EE) of the system subject to the constraints of the total transmission power and the minimum data rate. This designed optimization problem is non-convex owing to the interference among users, and hence is quite difficult to tackle directly. To solve this issue, we develop a dual layer resource allocation algorithm where the bisection method is exploited in the outer layer to obtain the optimal EE and a resource distributed iterative algorithm is exploited in the inner layer to optimize the transmit power. Besides, an alternative resource allocation algorithm with Deep Belief Networks (DBN) is proposed to cope with the requirement for low computational complexity. Simulation results verify the theoretical findings and demonstrate the proposed algorithms on the PSOAM MGs based MIMO-NOMA system can obtain a better performance comparing to the conventional MIMO-NOMA system in terms of EE. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicle (UAV) Base Station (BS) placement optimization is an essential operational task to improve the Quality of Service (QoS) in UAV-aided wireless cellular networks. The existing approaches are almost zeroth order methods, and the few first order methods mainly ignore the allocation fairness, computational efficiency, and backhaul constraints. In this paper, we formulate the UAV placement problem as a constrained optimization problem, with the objective of maximizing the fair coverage versus energy consumption while satisfying the backhaul constraints at different time nodes. To guarantee fair QoS allocation, we introduce a novel fairness index to ensure fair communication opportunity and the novel region coverage ratio to avoid excess QoS on covered spots. An accurate and efficient proximal stochastic gradient descent based alternating algorithm that iteratively executes two optimization steps is proposed to optimize the UAV locations, which enables the fast single point-based first order methods to solve the complex problems with constraints. Experiment results manifest that the proposed algorithm performs well both in synthetic data scenario and in real city scenario. Furthermore, the proposed first order algorithm is more efficient than the existing zeroth order algorithm, typically referring to the meta-heuristic method. [ABSTRACT FROM AUTHOR]

Federated learning (FL) has been considered as a promising paradigm for enabling distributed training/learning in many machine-learning services without revealing users’ local data. Driven by the growing interests in exploiting FL in wireless networks, this paper studies the Non-orthogonal Multiple Access (NOMA) assisted FL in which a group of end-devices (EDs) form a NOMA cluster to send their locally trained models to the cellular base station (BS) for model aggregation. In particular, we consider that the BS adopts wireless power transfer (WPT) to power the EDs (for their data transmission and local training) in each round of FL iteration, and formulate a joint optimization of the BS’s WPT for different EDs, the EDs’ NOMA-transmission for sending the local models to the BS, the BS’s broadcasting of the aggregated model to all EDs, the processing-rates of the BS and EDs, as well as the training-accuracy of the FL, with the objective of minimizing the system-wise cost accounting for the total energy consumption as well as the FL convergence latency. In spite of the strict non-convexity of the joint optimization problem, we analytically characterize the BS’s and all EDs’ optimal processing-rates, based on which we propose a layered algorithm for finding the optimal solutions for the joint optimization problem via exploiting monotonic optimization. Numerical results validate that our algorithm can achieve the optimal solution as LINGO’s global-solver (i.e., a commercial optimization package) while significantly reducing the computation-time. Moreover, the results also demonstrate that our NOMA assisted FL can reduce the system cost compared to the benchmark FL scheme with the fixed local training-accuracy by more than 70% and the conventional frequency division multiple access (FDMA) based FL by 78%. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel resource management scheme that jointly allocates the transmit power and computational resources in a centralized radio access network architecture. The network comprises a set of computing nodes to which the requested tasks of different users are offloaded. The optimization problem minimizes the energy consumption of task offloading while takes the end-to-end-latency, i.e., the transmission, execution, and propagation latencies of each task, into account. We aim to allocate the transmit power and computational resources such that the maximum acceptable latency of each task is satisfied. Since the optimization problem is non-convex, we divide it into two sub-problems, one for transmit power allocation and another for task placement and computational resource allocation. Transmit power is allocated via the convex-concave procedure. In addition, a heuristic algorithm is proposed to jointly manage computational resources and task placement. We also propose a feasibility analysis that finds a feasible subset of tasks. Furthermore, a disjoint method that separately allocates the transmit power and the computational resources is proposed as the baseline of comparison. A lower bound on the optimal solution of the optimization problem is also derived based on exhaustive search over task placement decisions and utilizing Karush–Kuhn–Tucker conditions. Simulation results show that the joint method outperforms the disjoint method in terms of acceptance ratio. Simulations also show that the optimality gap of the joint method is less than 5%. [ABSTRACT FROM AUTHOR]

This paper is concerned with the energy efficiency maximization problem in multiple-input multiple-output interference channels. In the first part of this paper, we design the transmit beamforming matrices based on three approaches. In the first approach, each user tries to maximize their own energy efficiency, resulting in what we call the selfish method. The maximization problem corresponding to the selfish method can be implemented in a distributed manner with a semi-closed-form solution. The second approach aims to maximize the weighted sum-energy efficiency; we refer to it as the unselfish method. The proposed unselfish method has the following advantages. 1) It is easily implementable as the problem can be divided into several sub-problems and solved in a distributed manner. 2) It results in a quadratically constrained quadratic program with a semi-closed-form solution. Also, we consider fairness with the minimum-energy efficiency maximization problem, an approach that results in what we call the worst-case method. In the second part, general energy efficiency maximization in the presence of norm-bounded channel uncertainty is investigated which leads to a semi-definite program; the resulting method is called the robust method. Finally, the effect of the system parameters is evaluated through simulations. [ABSTRACT FROM AUTHOR]

Edge infrastructures, including edge computing servers, are increasingly powered by renewable energy and smart grid combined. Two-way energy trading allows the surplus or shortfall of renewable energy to be traded between a server and the smart grid, but is non-trivial due to randomly varying computation demands and renewables. This paper proposes a new online policy, namely, distributed online resource allocation and load management (DORL), which enables such an edge server and its serving devices to minimize their energy cost and energy consumption, respectively, in a fully distributed manner. The key idea is that we employ the stochastic dual-subgradient method to interpret the battery of the server as a virtual queue. Based on the virtual queue and task queues, the CPU frequencies of the devices and the edge server, the offloading transmit rates of the devices (to the server) and the energy trading decisions of the server (with the smart grid) are decoupled over time and among devices, and optimized on an ongoing basis. Furthermore, we prove that the DORL yields a feasible and asymptotically optimal solution with a cost-backlog tradeoff of $[\eta, 1/\eta]$. Simulations show that the DORL reduces the system cost by nearly 50%, as compared to existing benchmarks. [ABSTRACT FROM AUTHOR]

This paper investigates the energy efficiency (EE) optimization in downlink multi-cell massive multiple-input multiple-output (MIMO). In our research, the statistical channel state information (CSI) is exploited to reduce the signaling overhead. To maximize the minimum EE among the neighbouring cells, we design the transmit covariance matrices for each base station (BS). Specifically, optimization schemes for this max-min EE problem are developed, in the centralized and distributed ways, respectively. To obtain the transmit covariance matrices, we first find out the closed-form optimal transmit eigenmatrices for the BS in each cell, and convert the original transmit covariance matrices designing problem into a power allocation one. Then, to lower the computational complexity, we utilize an asymptotic approximation expression for the problem objective. Moreover, for the power allocation design, we adopt the minorization maximization method to address the non-convexity of the ergodic rate, and use Dinkelbach’s transform to convert the max-min fractional problem into a series of convex optimization subproblems. To tackle the transformed subproblems, we propose a centralized iterative water-filling scheme. For reducing the backhaul burden, we further develop a distributed algorithm for the power allocation problem, which requires limited inter-cell information sharing. Finally, the performance of the proposed algorithms are demonstrated by extensive numerical results. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) has been envisioned as a promising approach for enabling the computation-intensive yet latency-sensitive mobile Internet services in future wireless networks. In this paper, we investigate the secrecy based energy-efficient MEC via cooperative Non-orthogonal Multiple Access (NOMA) transmission. We consider that an edge-computing device (ED) offloads its computation-workload to the edge-computing server (ECS) subject to the overhearing-attack of a malicious eavesdropper. To enhance the secrecy of the ED’s offloading transmission, a group of conventional wireless devices (WDs) are scheduled to form a NOMA-transmission group with the ED for sending data to the cellular base station (BS) while providing cooperative jamming to the eavesdropper. We formulate a joint optimization of the ED’s offloaded workload, transmit-power, NOMA-transmission duration as well as the selection of the WDs, with the objective of minimizing the total energy consumption of the ED and the selected WDs, while subject to the ED’s latency-requirement and the selected WDs’ required data-volumes to deliver. Despite the nature of mixed binary and non-convex programming of the formulated problem, we exploit the vertical decomposition and propose a three-layered algorithm for solving it efficiently. To further address the fairness among different WDs, we investigate a system-wise utility maximization problem that accounts for the fairness in the WDs’ delivered data and the total energy consumption of the ED and WDs. By exploiting our previously designed layered-algorithm, we further propose a stochastic learning based algorithm for determining each WD’s optimal data-volume delivered. Numerical results are provided to validate the effectiveness of our proposed algorithms as well as the performance advantage of the secrecy based computation offloading via NOMA. [ABSTRACT FROM AUTHOR]

By offloading tasks from the mobile device (MD) to its nearby deployed access points (APs), each of which is connected to one server for task processing, computation offloading can strike a balance between MD’s task execution delay and energy consumption in mobile edge computing (MEC) systems. Considering communication and computation dynamics in MEC systems, we aim to design online computation offloading mechanisms in this paper to minimize the time average expected task execution delay under the constraint of average energy consumption. Firstly, with known current channel gains between the MD and APs as well as available computing capability at MEC servers, we leverage the Lyapunov optimization framework to make an optimal one-slot decision on MD’s transmit power allocation and MEC server selection. On this basis, we then consider a more realistic scenario, where it is difficult to capture current available computing capability at MEC servers, and combine the multi-armed bandit framework for an online learning based MEC server selection algorithm. Finally, through theoretical analyses and extensive simulations, we demonstrate the near-optimality and feasibility of our proposed algorithms, and present that our proposed algorithms fully explore the interplay between communication and computation with enriched user experience and reduced energy consumption. [ABSTRACT FROM AUTHOR]

Terahertz (THz) band has attracted considerable interest recently due to its superior high frequency and large available bandwidth. THz could act a vital part in the sixth generation (6G) mobile communication networks. In this paper, we introduce the downlink non-orthogonal multiple access (NOMA) technology into THz band small cell networks, where the total performance is optimized considering the two key enabling technologies. In order to decrease the energy consumption triggered by increasing of wireless services, we pay great attention to energy efficiency (EE) optimization and resource allocation in the THz-NOMA downlink systems by solving the subchannel assignment and power optimization. We first exploit a channel model for the THz-NOMA downlink system by using the key features of THz-NOMA networks. Then we utilize Dinkelbach-style algorithm to solve the resource allocation problem and decompose it into two subproblems. A subchannel assignment algorithm and a power optimization based on alternative direction method of multipliers (ADMM) algorithm are developed to get the solution. Finally, to embody the strengths of THz-NOMA performance, we compare our proposed schemes against the conventional schemes. Simulation results yield substantially higher EE and further prove the availability of our proposed schemes. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) is one of the most significant technologies to meet the demand of high spectral efficiency (SE) in the fifth generation (5G) cellular networks. The utilization of simultaneous wireless information and power transfer (SWIPT) contributes to prolonging the battery life of the mobile users (MUs) and enhancing the system energy efficiency (EE), especially in the NOMA scenario where the inter-user interference can be reused for energy harvesting (EH). In this paper, we study the achievable data rate maximization problem for the downlink multi-carrier NOMA (MC-NOMA) network with power splitting (PS)-based SWIPT, in which power allocation and PS control are jointly optimized with the limitation of available power budget as well as the requirement for EH. The considered non-convex optimization problem is arduous to tackle, resulting from the presence of the coupled variables and the inter-user interference. To cope with the problem, a decoupled approach is developed, in which the power allocation and PS control are separated and the corresponding sub-problems are respectively solved through Lagrangian duality method. Furthermore, an alternative approach based on deep learning is proposed, which is capable of effectively obtaining the approximate optimal solution according to the empirical data. Simulation results confirm the effectiveness of the proposed schemes, and demonstrate the superiority of the combination of PS-based SWIPT with MC-NOMA over SWIPT-aided single-carrier NOMA (SC-NOMA) and SWIPT-aided orthogonal multiple access (OMA). [ABSTRACT FROM AUTHOR]

In a wirelessly-powered communication network (WPCN), an energy access point (E-AP) supplies the energy needs of the network nodes through radio frequency wave transmission, and the nodes store their received energy in their batteries for possible data transmission. In this paper, we propose an online control policy for energy transfer from the E-AP to the wireless nodes and for data transfer among the nodes. With our proposed control policy, all data queues of the nodes are stable, while the average energy consumption of the network is shown to be within a bounded gap of the minimum energy required for stabilizing the network. Our proposed policy is designed using a quadratic Lyapunov function to capture the limitations on the energy consumption of the nodes imposed by their battery levels. We show that under the proposed control policy, the backlog level in the data queues and the stored energy level in the batteries fluctuate in small intervals around some constant levels. Consequently, by imposing a negligible average data drop rate, the data buffer size and the battery capacity of the nodes can be significantly reduced. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel hybrid user pairing (HUP) scheme in multiuser multiple-input single-output non-orthogonal multiple access networks with simultaneous wireless information and power transfer. In this system, two information users with distinct channel conditions are optimally paired while energy users perform energy harvesting (EH) under non-linearity of the EH circuits. We consider the problem of jointly optimizing user pairing and power allocation to maximize the overall spectral efficiency (SE) and energy efficiency (EE) subject to user-specific quality-of-service and harvested power requirements. A new paradigm for the EE-EH trade-off is then proposed to achieve a good balance of network power consumption. Such design problems are formulated as the maximization of non-concave functions subject to the class of mixed-integer non-convex constraints, which are very challenging to solve optimally. To address these challenges, we first relax binary pairing variables to be continuous and transform the design problems into equivalent non-convex ones, but with more tractable forms. We then develop low-complexity iterative algorithms to improve the objectives and converge to a local optimum by means of the inner approximation framework. Simulation results show the convergence of proposed algorithms and the SE and EE improvements of the proposed HUP scheme over state-of-the-art designs. In addition, the effects of key parameters such as the number of antennas and dynamic power at the BS, target data rates, and energy threshold, on the system performance are evaluated to show the effectiveness of the proposed schemes in balancing resource utilization. [ABSTRACT FROM AUTHOR]

In this paper, we study the trajectory and resource allocation design for downlink energy-efficient secure unmanned aerial vehicle (UAV) communication systems, where an information UAV assisted by a multi-antenna jammer UAV serves multiple ground users in the existence of multiple ground eavesdroppers. The resource allocation strategy and the trajectory of the information UAV, and the jamming policy of the jammer UAV are jointly optimized for maximizing the system energy efficiency. The joint design is formulated as a non-convex optimization problem taking into account the quality of service (QoS) requirement, the security constraint, and the imperfect channel state information (CSI) of the eavesdroppers. The formulated problem is generally intractable. As a compromise approach, the problem is divided into two subproblems which facilitates the design of a low-complexity suboptimal algorithm based on alternating optimization approach. Simulation results illustrate that the proposed algorithm converges within a small number of iterations and demonstrate some interesting insights: (1) the introduction of a jammer UAV facilitates a highly flexible trajectory design of the information UAV which is critical to improving the system energy efficiency; (2) by exploiting the spatial degrees of freedom brought by the multi-antenna jammer UAV, our proposed design can focus the artificial noise on eavesdroppers offering a strong security mean to the system. [ABSTRACT FROM AUTHOR]

In this paper, we consider a downlink non-orthogonal multiple access (NOMA) enabled heterogeneous small cells network (HSCN), where the macro base station simultaneously communicates with multiple small cell base stations (SBSs) through wireless backhaul. In each small cell, users are grouped by NOMA bases and then served by their respective SBS. The proposed framework considers the realistic imperfect channel state information and quality of service requirements of users. The goal is to investigate an energy-efficient joint power, and bandwidth allocation scheme, which aims to maximize the energy efficiency (EE) of the small cells in downlink NOMA-HSCN constrained by the maximum transmit power and the minimum required data rate simultaneously. The optimization problem is non-convex due to the fractional objective function and non-convex constraint and thus challenging to obtain an exact solution efficiently. To this end, the joint optimization is first decomposed into two subproblems. Then, an iterative algorithm to solve the power optimization subproblem is proposed with guaranteed convergence. Furthermore, we derive a closed-form solution for the bandwidth allocation subproblem. Simulation results reveal that the effectiveness of the proposed schemes in terms of EE compared to the existing NOMA and the orthogonal multiple access schemes. [ABSTRACT FROM AUTHOR]

Multi-view videos (MVVs) provide immersive viewing experience, at the cost of traffic load increase for wireless networks. In this paper, we would like to optimize MVV transmission in a multiuser wireless network by exploiting both natural multicast opportunities and view synthesis-enabled multicast opportunities. Specifically, we first establish a mathematical model to specify view synthesis at the server and each user, and characterize its impact on multicast opportunities. This model is highly nontrivial and fundamentally enables the optimization of view synthesis-based multicast opportunities. For given video quality requirements of all users, we consider the optimization of view selection, transmission time and power allocation to minimize the average weighted sum energy consumption for view transmission and synthesis. In addition, under the energy consumption constraints at the server and each user respectively, we consider the optimization of view selection, transmission time and power allocation and video quality selection to maximize the total utility. These two optimization problems are challenging mixed discrete-continuous optimization problems. For the first problem, we propose an algorithm to obtain an optimal solution with reduced computational complexity by exploiting optimality properties. For each problem, to reduce computational complexity, we also propose a low-complexity algorithm to obtain a suboptimal solution, using Difference of Convex (DC) programming. Finally, numerical results show the advantage of the proposed solutions over existing ones, and demonstrate the importance of the optimization of view synthesis-enabled multicast opportunities in MVV transmission. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) has attracted both academic and industrial interest since it has been considered as one of the promising 5G technologies in order to increase connectivity and spectral efficiency. In this paper, we focus on a downlink multicarrier (MC) NOMA network, where a single base station serves a set of users through multiple subchannels. The goal is to jointly optimize energy efficiency (EE) and fairness among users with respect to the subcarrier and power allocation parameters. To achieve this with acceptable complexity, a novel greedy subcarrier assignment scheme based on the worst-user first principle is proposed. Due to the fractional form of the EE expression and the existence of interference, the power allocation problem is non-convex and NP-hard. To this end, we first transform this into an equivalent subtractive form, which is then solved by using fractional programming with sequential optimization of the inter/intra-subchannel power allocation vectors. Simulation results reveal the effectiveness of the proposed scheme in terms of EE and fairness among users compared to baseline schemes. Finally, the proposed algorithms are of fast convergence, low complexity, and insensitive to the initial values. [ABSTRACT FROM AUTHOR]

In this paper, we optimize the energy efficiency (bits/s/Hz/J) of device-to-multi-device (D2MD) wireless communications. While the device-to-device scenario has been extensively studied to improve the spectral efficiency in cellular networks, the use of multicast communications opens the possibility of reusing the spectrum resources also inside the groups. The optimization problem is formulated as a mixed integer non-linear joint optimization for the power control and allocation of resource blocks (RBs) to each group. Our model explicitly considers resource sharing by letting co-channel transmission over a RB (up to a maximum of $r$ transmitters) and/or transmission through $s$ different channels in each group. We use an iterative decomposition approach, using first matching theory to find a stable even if sub-optimal channel allocation, to then optimize the transmission power vectors in each group via fractional programming. In addition, within this framework, both the network energy efficiency and the max-min individual energy efficiency are investigated. We characterize numerically the energy-efficient capacity region, and our results show that the normalized energy efficiency is nearly optimal (above 90% of the network capacity) for a wide range of minimum-rate constraints. This performance is better than that of other matching-based techniques previously proposed. [ABSTRACT FROM AUTHOR]

In this paper, a fundamental study of energy efficiency (EE) optimization for coordinated multi-point (CoMP) simultaneous wireless information and power transfer (SWIPT) heterogeneous networks (HetNets) is provided. We aim to optimize the EE while satisfying certain quality-of-service requirements in regard to transmission rate and energy harvesting at both the macro cell and small cells. The corresponding joint beamforming and power allocation in the presence of intra- and inter-cell interference constitutes an EE maximization problem that is non-convex, and hence, very challenging to solve. In order to solve this problem, we propose to separate the beamforming design and power allocation processes. First, we adopt linear zero-forcing (ZF) beamforming to suppress the multi-user interference from both the energy harvesting users (EH-UEs) as well as the information decoding UEs (ID-UEs), thus transforming the HetNet under consideration to a virtual point-to-point system. An efficient power allocation algorithm is then developed to maximize the corresponding EE. On the other hand, the ZF strategy does not utilize the notion that interference benefits the EH-UEs. As a result, we propose a partial ZF approach by differentiating the EH-UEs and ID-UEs in order to further improve the EE. Our findings show that the EE can be significantly improved through the integration of CoMP-SWIPT in HetNets. [ABSTRACT FROM AUTHOR]

In this paper, we concentrate on the robust multi-objective optimization (MOO) for the tradeoff between energy efficiency (EE) and spectral efficiency (SE) in device-to-device (D2D) communications underlaying heterogeneous networks (HetNets). Different from traditional resource optimization, we focus on finding robust Pareto optimal solutions for spectrum allocation and power coordination in D2D communications underlaying HetNets with the consideration of interference channel uncertainties. The problem is formulated as an uncertain MOO problem to maximize EE and SE of cellular users (CUs) simultaneously while guaranteeing the minimum rate requirements of both CUs and D2D pairs. With the aid of $\varepsilon$ -constraint method and strict robustness, we propose a general framework to transform the uncertain MOO problem into a deterministic single-objective optimization problem. As exponential computational complexity is required to solve this highly non-convex problem, the power coordination and the spectrum allocation problems are solved separately, and an effective two-stage iterative algorithm is developed. Finally, simulation results validate that our proposed robust scheme converges fast and significantly outperforms the non-robust scheme in terms of the effective EE-SE tradeoff and the quality of service satisfying probability of D2D pairs. [ABSTRACT FROM AUTHOR]

This paper considers the problem of dynamic power allocation in the downlink of multi-cell networks, where each cell utilizes non-orthogonal multiple access (NOMA)-based resource allocation. Also, coordinated multi-point (CoMP) transmission is utilized among multiple cells to serve users experiencing severe inter-cell interference (ICI). Under this CoMP- NOMA framework, CoMP transmission is applied to a user experiencing less distinctive channel gain with multiple base stations (BSs)/cells (i.e., severe ICI-prone user) and non-CoMP transmission (i.e., transmission without any coordination among multiple BSs) is applied to a user experiencing dominating channel gain with only one BS/cell, while NOMA is utilized at each BS to schedule CoMP and non-CoMP users over the same transmission resources, i.e., time, spectrum and space. After discussing various CoMP- NOMA models for downlink power allocation in multi-cell networks, we focus on a joint transmission CoMP- NOMA (JT-CoMP-NOMA) model. For the JT-CoMP-NOMA model, an optimal joint power allocation problem is formulated and the solution is derived for each CoMP- set consisting of multiple cooperating BSs (i.e., CoMP BSs). To avoid the huge computational complexity of the joint power optimization approach, we propose a distributed power optimization approach at each cooperating BS whose optimal solution is independent of the solution of other coordinating BSs. The distributed solution for the joint power optimization problem is validated and numerical performance evaluation is carried out for the proposed CoMP- NOMA models including JT-CoMP-NOMA and coordinated scheduling CoMP- NOMA (CS-CoMP-NOMA). The obtained results reveal significant gains in spectral and energy efficiency in comparison with conventional CoMP- orthogonal multiple access (CoMP-OMA) systems. [ABSTRACT FROM AUTHOR]

In this paper, an optimization problem to maximize the energy efficiency of a hybrid automatic repeat request with incremental redundancy (HARQ-IR) is considered for massive multiple-input multiple-output (MIMO) systems. Because a sum rate for multiple HARQ-IR rounds is approximated by a Gaussian distribution, a problem maximizing energy efficiency becomes tractable. In particular, a simplified form of energy efficiency for massive MIMO transmissions with an HARQ-IR protocol is derived using an outage probability, which is given by a tail probability of the Gaussian distribution. By exploiting the proposed simplified form, we show that the energy efficiency of the system is approximated by a piecewise quasi-concave function. Using these properties, an algorithm finding the optimal transmission power and number of transmission rounds for maximizing energy efficiency is proposed. Moreover, we show that the optimal number of HARQ transmission rounds can be less than the maximum allowable retransmissions when considering the constant power consumption of the massive MIMO system with an HARQ-IR protocol. Simulation results verify the theoretical analysis and show the performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

To improve the spectral efficiency in long-term evolution systems, the resource blocks (RBs) are shared among different cells/base stations (BSs) resulting in interference among the cells/BSs on each RB, although all the sub-carriers (SCs) in an RB may not be used in a cell. Defining the load of a given BS per RB as the fraction of the active SCs in that RB, in this paper, we present a generalized signal-to-interference-and-noise-ratio (SINR) model for downlink users on a given RB. This model considers both the transmit powers of the BSs and the loads of the cells over that RB. Under this load-coupled SINR model, to study the feasibility of a given rate demand vector for users, we formulate an optimization problem of minimizing the total load of the BSs on the RBs. Then, for two different scenarios of feasible and infeasible demand vectors, respectively, we study the load management problem (i.e., minimizing the total load of the BSs on the RBs) and admission control problem (i.e., finding the sub-set of users with maximum cardinality whose demands can be concurrently satisfied), respectively. Our theoretical investigations, which provide guidelines for designing radio resource management methods for load-coupled OFDMA networks, are complemented through Monte Carlo simulations. [ABSTRACT FROM PUBLISHER]

Cooperation between the fog and the cloud in mobile cloud computing environments could offer improved offloading services to smart mobile user equipment (UE) with computation intensive tasks. In this paper, we tackle the computation offloading problem in a mixed fog/cloud system by jointly optimizing the offloading decisions and the allocation of computation resource, transmit power, and radio bandwidth while guaranteeing user fairness and maximum tolerable delay. This optimization problem is formulated to minimize the maximal weighted cost of delay and energy consumption (EC) among all UEs, which is a mixed-integer non-linear programming problem. Due to the NP-hardness of the problem, we propose a low-complexity suboptimal algorithm to solve it, where the offloading decisions are obtained via semidefinite relaxation and randomization, and the resource allocation is obtained using fractional programming theory and Lagrangian dual decomposition. Simulation results are presented to verify the convergence performance of our proposed algorithms and their achieved fairness among UEs, and the performance gains in terms of delay, EC, and the number of beneficial UEs over existing algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we propose a general framework to study the tradeoff between energy efficiency (EE) and spectral efficiency (SE) in massive multiple-input-multiple-output-enabled heterogenous networks while ensuring proportional rate fairness among users and taking into account the backhaul capacity constraint. We aim at jointly optimizing user association, spectrum allocation, power coordination, and the number of activated antennas, which is formulated as a multi-objective optimization problem maximizing EE and SE simultaneously. With the help of weighted Tchebycheff method, it is then transformed into a single-objective optimization problem, which is a mixed-integer non-convex problem and requires unaffordable computational complexity to find the optimum. Hence, a low-complexity effective algorithm is developed based on primal decomposition, where we solve the power coordination and number of antenna optimization problem and the user association and spectrum allocation problem separately. Both theoretical analysis and numerical results demonstrate that our proposed algorithm can fast converge within several iterations and significantly improve both the EE-SE tradeoff performance and rate fairness among users compared with other algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we investigate utility-based joint subcarrier and power allocation algorithms for improving the energy efficiency (EE) in multi-user two-way regenerative relay networks. With the objective of determining the best subcarrier allocation for each user pair, subcarrier pairing permutation, and power allocation to all the nodes, a network price is introduced to the power consumption as a penalty for the achievable sum rate, followed by the examination of its impact on the tradeoff between the EE and spectral efficiency. The formulated optimization problem is a non-convex mixed-integer nonlinear programming problem, and thus a concave lower bound on the objective function and a series of convex transformations are applied to transform the problem into a convex one. Through dual decomposition, we propose a utility-based resource allocation algorithm for iteratively tightening the lower bound and finding the optimal solution of the primal problem. By exploring the structure of the obtained optimal solution, an optimal price that enables green resource allocation is found from the perspective of maximizing EE. Additionally, a suboptimal algorithm is investigated to strike a balance between computational complexity and optimality. Simulation results evince the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, the total system effective capacity (EC) maximization problem for the uplink transmission, in a multi-user multi-carrier orthogonal frequency division multiple access system, is formulated as a combinatorial integer programming problem, subject to each user’s link-layer energy efficiency (EE) requirement as well as the individual’s average transmission power limit. To solve this challenging problem, we first decouple it into a frequency provisioning problem and an independent multi-carrier link-layer EE–EC tradeoff problem for each user. In order to obtain the subcarrier assignment solution, a low-complexity heuristic algorithm is proposed, which not only offers close-to-optimal solutions, while serving as many users as possible, but also has a complexity linearly relating to the size of the problem. After obtaining the subcarrier assignment matrix, the multi-carrier link-layer EE–EC tradeoff problem for each user is formulated and solved by using Karush–Kuhn–Tucker conditions. The per-user optimal power allocation strategy, which is across both frequency and time domains, is then derived. Further, we theoretically investigate the impact of the circuit power and the EE requirement factor on each user’s EE level and optimal average power value. The low-complexity heuristic algorithm is then simulated to compare with the traditional exhaustive algorithm and a fair-exhaustive algorithm. Simulation results confirm our proofs and design intentions, and further show the effects of delay quality-of-service exponent, the total number of users, and the number of subcarriers on the system tradeoff performance. [ABSTRACT FROM PUBLISHER]

In green communications, it is imperative to reduce the total on-grid energy consumption as well as minimize the peak on-grid energy consumption, since the large peak on-grid energy consumption will translate into the high operational expenditure (OPEX) for mobile network operators. In this paper, we consider the two-dimensional optimization to lexicographically minimize the on-grid energy consumption in heterogeneous networks (HetNets). All the base stations (BSs) therein are envisioned to be powered by both power grid and renewable energy sources, and the harvested energy can be stored in rechargeable batteries. The lexicographic minimization of on-grid energy consumption involves the optimization in both the space and time dimensions, due to the temporal and spatial dynamics of mobile traffic and green energy generation. The reasonable assumption of time scale separation allows us to decompose the problem into two sub-optimization problems without loss of optimality of the original optimization problem. We first formulate the user association optimization in space dimension via convex optimization to minimize total energy consumption through distributing the traffic across different BSs appropriately in a certain time slot. We then optimize the green energy allocation across different time slots for an individual BS to lexicographically minimize the on-grid energy consumption. To solve the optimization problem, we propose a low complexity optimal offline algorithm with infinite battery capacity by assuming non-causal green energy and traffic information. The proposed optimal offline algorithm serves as performance upper bound for evaluating practical online algorithms. We further develop some heuristic online algorithms with finite battery capacity which require only causal green energy and traffic information. The performance of the proposed optimal offline and online algorithms is evaluated by simulations. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the energy consumption issue in cognitive radio (CR) networks. We aim to maximize the energy efficiency of the CR network while considering practical restrictions, including the power budget of the system, the interference thresholds of the primary users (PUs), the rate requirements of the secondary users, and the fairness among them. Particularly, due to the lack of explicit support from the PU system, perfect channel state information may not be acquired. Thus, the interference constraint is posed as chance-constrained form and tackled by Bernstein approximation. Then, we convert the optimization task into a quasi-convex problem via relaxing the integer variables, followed by a simple rounding technique to yield feasible subchannels assignment. We derive a fast algorithm to distribute power among subchannels by exploiting the structure of the power-allocation problem. Moreover, we give an efficient heuristic algorithm for subchannels assignment, which reduces the computation load dramatically. Simulation results show that both our proposed resource allocation schemes perform well in practical scenarios. The energy efficiency obtained by the integer subchannels assignment and the fast power distribution achieves more than 98% of the upper bound. On the other hand, the proposed heuristic subchannels assignment with optimal power allocation achieves a good tradeoff between computation complexity and energy efficiency. [ABSTRACT FROM AUTHOR]

Energy efficiency (EE) has become an important design goal for mobile communication systems. Since the EE of a system is evaluated during a period of time, a transmission strategy designed from maximizing instantaneous EE (INEE) may not achieve the maximal EE of the system. To exploit the accumulative nature of the energy, accumulative EE (ACEE) can be used as the objective function, which is the ratio of the accumulated amount of data transmitted to the accumulated energy consumed until the time for optimization. In this paper, we study when ACEE is beneficial to EE-oriented optimization. By taking a single user multi-antenna multi-subcarrier system serving two classes of traffic as an example, we formulate three problems to optimize rate allocation among subcarriers and time slots respectively maximizing the INEE, ACEE and EE upper-bound, which can be easily extended to multi-user systems. We proceed to analyze the behavior and performance of the corresponding solutions. Analytical and simulation results show that using ACEE yields a more energy efficient design for the systems serving best effort traffic with less transmit antennas, serving less users simultaneously or at low signal to noise ratio under time-varying channels. However, the conclusions for real-time traffic are different. [ABSTRACT FROM PUBLISHER]

Energy efficiency (EE) is very crucial for future wireless communication systems, especially for cognitive radio networks (CRNs). The EE performance relies on channel state information (CSI) of channels. Besides, the interference from secondary users (SUs) to primary users (PUs) also closely depends on CSI in underlay CRNs. However, available works on EE usually assume that CSI is perfect, which is often inaccurate in practical systems. Thus, in this paper we investigate the robust EE maximization problem in underlay CRNs with multiple SUs and PUs. Assuming CSI error to be bounded, we consider that all channels lie in some bounded uncertainty regions. From the perspective of worst-case optimization, we formulate it as the max-min problem with infinite constraint, which is nontrivial even without this constraint. This is because that the outer-maximization problem is non-convex and the inner-minimization problem is a concave minimization problem known as NP-hard in general. We propose a scheme to handle this problem via the fractional programming and global optimization techniques. Particularly, we efficiently solve this problem in two special cases. Simulation results validate that our proposed scheme can improve the worst-case EE of SUs distinctly and strictly guarantee the quality-of-service (QoS) of PUs under all parameters' uncertainties. [ABSTRACT FROM AUTHOR]

The widespread application of multimedia wireless services and requirements of ubiquitous access have triggered rapidly booming energy consumption at both the base station side and the user equipment (UE) side. Hence, energy-efficient design in wireless networks is very important and is becoming an inevitable trend. In this paper, we study the energy-efficient resource allocation in both downlink and uplink cellular networks with orthogonal frequency division multiple access (OFDMA). For the downlink transmission, the generalized energy efficiency (EE) is maximized while for the uplink case the minimum individual EE is maximized, both under certain prescribed per-UE quality-of-service (QoS) requirements. For both transmission scenarios, we first provide the optimal solution and then develop a suboptimal but low-complexity approach by exploring the inherent structure and property of the energy-efficient design. For the downlink case, by modifying the original problem, we also find a computationally efficient and numerically tractable upper bound on the EE, which indicates the performance limit and is demonstrated to be quite tight if the number of subcarriers is larger than that of UEs and motivates us to find a near-optimal approach relying on the quasiconcave relation between the modified EE and transmit power. Simulation results show that the energy-efficient design greatly improves EE compared with the conventional spectral-efficient design and the low-complexity suboptimal approaches can achieve a promising tradeoff between performance and complexity. [ABSTRACT FROM AUTHOR]

In this paper, power allocation between pilots and data symbols is investigated to maximize energy efficiency (EE) for downlink orthogonal frequency division multiple access (OFDMA) networks. We first derive an EE function considering channel estimation error, which depends on large-scale channel gains of multiple users, allocated power to pilots and data symbols, and circuit power consumption. Then an optimization problem is formulated to maximize the EE under overall transmit power constraint. Exploiting the quasiconcavity property of the EE function, we propose an alternating optimization method in the low transmit power region and reformulate a joint quasiconcave problem in the high transmit power region. Analysis and simulation results show that the power ratio for pilots decreases with the circuit power. When the circuit power is small, the optimal overall transmit power increases with the circuit power. Otherwise, the optimal transmit power does not depend on it. Transmitting more data symbols to the users with higher channel gains improves the EE but at a cost of sacrificing the fairness among multiple users. Simulation results also demonstrate that compared with spectral efficiency (SE)-oriented design, the EE-oriented design can improve the EE performance significantly with a relatively small SE loss. [ABSTRACT FROM PUBLISHER]