Search

Unmanned aerial vehicles (UAVs) and Terahertz (THz) technology are envisioned to play paramount roles in next-generation wireless communications. In this paper, we present a novel secure UAV-assisted mobile relaying system operating at THz bands for data acquisition from multiple ground user equipments (UEs) towards a destination. We assume that the UAV-mounted relay may act, besides providing relaying services, as a potential eavesdropper called the untrusted UAV-relay (UUR). To safeguard end-to-end communications, we present a secure two-phase transmission strategy with cooperative jamming. Then, we devise an optimization framework in terms of a new measure $-$ secrecy energy efficiency (SEE), defined as the ratio of achievable average secrecy rate to average system power consumption, which enables us to obtain the best possible security level while taking UUR’s inherent flight power limitation into account. For the sake of quality of service fairness amongst all the UEs, we aim to maximize the minimum SEE (MSEE) performance via the joint design of key system parameters, including UUR’s trajectory and velocity, communication scheduling, and network power allocation. Since the formulated problem is a mixed-integer nonconvex optimization and computationally intractable, we decouple it into four subproblems and propose alternative algorithms to solve it efficiently via greedy/sequential block successive convex approximation and non-linear fractional programming techniques. Numerical results demonstrate significant MSEE performance improvement of our designs compared to other known benchmarks. [ABSTRACT FROM AUTHOR]

The heterogeneous fog radio access networks (Fog-RAN), the integration of fog computing, and traditional heterogeneous radio access networks can be implemented through the next-generation wireless communication networks. However, most of the solutions are limited to the spectrum efficiency optimization, and cross-tier interference existing in the fog access points (F-APs) could affect the network performance seriously. In this paper, the user association, resource allocation (including bandwidth and power), and caching deployment are investigated in the heterogeneous Fog-RAN to consider energy efficiency and cross-tier interference mitigation. Specifically, the user association, resource allocation, and caching strategy are formulated as a non-convex optimization problem and then transformed into a convex problem, which can be solved by a proposed algorithm based on the concept of the alternating direction method of multipliers (ADMM). Then an ADMM-based algorithm is proposed to enhance the energy efficiency of the Fog-RAN. Compared with the current solutions, simulation results illustrate the proposed algorithm’s convergence and effectiveness. [ABSTRACT FROM AUTHOR]

In the past several years, unmanned aerial vehicle (UAV) have been employed to provide enhanced coverage or relay service to mobile users in a scenario with limited or even no infrastructure since they can be deployed to almost everywhere and can be manipulated at anytime. This paper studies UAV as aerial base station (BS) enabled wireless communication system, where a UAV is dispatched to provide wireless communication service to a set of ground users with difference quality-of-experience (QoE) requirements. In real world, user requirements are randomly and unevenly distributed. In addition, UAV communication coverage and on-board energy are limited and system resources are also limited (e.g., transmission power, spectrum). In order to meet the QoE of all users with limited system resources and limited UAV energy, we jointly optimize user communication scheduling, UAV trajectory, transmit power and bandwidth allocation to maximize energy-efficiency and satisfy user QoE requirement. The formulated problem is mixes integer non-convex and non-concave so it is difficult to solve. In this paper, we solvevv the problem with two steps as follows. Firstly, we transform the objective function into a tractable form. Secondly, we divide the optimal problem into four sub-optimal problems, and then use a powerful iterative algorithm with the Dinkelbach and block coordinate descent to solve the optimal problem. That is to say, the user scheduling, UAV trajectory, transmission power and bandwidth allocation are alternately optimized in each iteration. Extensive simulation results present that our proposed method can obtain higher energy efficiency than that of baselines. Specifically, the energy efficiency obtained by our proposed method is 12.5% higher than the approach that only maximizes throughput. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of wireless service provisioning through a rotary-wing UAV which can serve as an aerial base station (BS) to communicate with multiple ground terminals (GTs) in a boost demand area. Our objective is to optimize the UAV control for maximizing the UAV.s energy efficiency, in which both aerodynamic energy and communication energy are considered while ensuring the communication requirements for each GT and backhaul link between the UAV and the terrestrial BS. The mobility of the UAV and GTs lead to time-varying channel conditions that make the environment dynamic. We formulate a nonconvex optimization for controlling the UAV considering the practical angle-dependent Rician fading channels between the UAV and GTs, and between the UAV and the terrestrial BS. Traditional optimization approaches are not able to handle the dynamic environment and high complexity of the problem in real-time. We propose to use a deep reinforcement learning-based approach namely Deep Deterministic Policy Gradient (DDPG) to solve the formulated nonconvex problem of UAV control with continuous action space that takes into account the real-time of the environment including time-varying UAV-ground channel conditions, available onboard energy of the UAV, and the communication requirement of the GTs. However, the DDPG method may not achieve good performance in an unstable environment and will face a large number of hyperparameters. We extend our approach to use the Trust Region Policy Optimization (TRPO) method that can improve the performance of the UAV compared to the DDPG method in such a dynamic environment. [ABSTRACT FROM AUTHOR]

In this paper, we focus on a wireless powered communication network where a hybrid access point can wirelessly activate the power of source nodes, and receive their information. Considering the time-switching protocol that implies energy harvesting, and energy usage are separated by time, a novel graphics-based multi-epoch power adjustment (GB-MPA) strategy is proposed to maximize the sum-throughput over a finite time horizon consisting of multiple transmission epochs. The proposed strategy relies on graphical constraint conditions, and allows the elimination of restrictions corresponding to the objective of throughput maximization. Moreover, the proposed GB-MPA strategy can be combined with the time-switching factor optimization by employing an alternating optimization procedure for performance enhancement. Simulation results show the accuracy of the proposed strategy, reduced complexity compared with the conventional convex optimization method, and the existing multi-epoch power adjustment strategy, and the compatibility with the alternating optimization procedure for developing the joint power, and time allocation scheme. [ABSTRACT FROM AUTHOR]

Next-generation wireless communications are expected to provide reliable high-rate connectivity. The recent concept of fog-enabled architecture comes to rescue by invoking a substantial amount of data storage close to end-user devices for meeting these challenges. Thus, caching popular contents at heterogeneous devices, e.g., fog nodes (FNs) or fog access points (FAPs), constitutes a promising technique of reducing both the traffic and the energy consumption of the backhaul links. Therefore, in this paper, we propose an energy-efficient caching and node association algorithm for cache-aided fog networks. First, we solve the problem of energy-efficient content caching and delivery in the FNs/FAPs in conjunction with a fixed node association strategy, where the FNs communicate either with other FNs by node-to-node (N2N) communications or with the FAPs in their proximity. In both caching scenarios, we investigate the relationship between the caching probability of the file and the energy-efficient content delivery by formulating the associated energy efficiency (EE) optimization problem under caching memory constraints. Then, we derive a joint modulation mode allocation strategy and caching policy for each content caching node and conceive a joint node association and caching algorithm for maximizing the EE. Finally, we quantify both the overall EE and throughput for demonstrating that the proposed caching and transmission strategy achieves significant performance improvements. [ABSTRACT FROM AUTHOR]

Vehicle-to-everything (V2X) communications, which provide wireless connectivity among vehicles, roadside drivers, passengers, and pedestrians, are attracting great interest. In this paper, we propose an energy-efficient relay assisted transmission scheme based on V2X communications in the uplink cellular networks for delay insensitive applications. We aim to maximize energy efficiency of the uplink while considering both the circuit power and transmit power consumption, as well as the delay constraint. The optimal resource allocation for direct transmission mode and V2X-enabled transmission mode are derived. For the V2X-enabled transmission mode, we first consider the transmission without the delay constraint and obtain the corresponding optimal power allocation. Based on the obtained result, we further propose the optimal resource allocation policy that satisfies the delay constraint and minimizes the energy consumption. Simulation results show that there exists an energy-delay tradeoff and the proposed V2X-enabled scheme can achieve significant energy saving with an acceptable delay compared with the traditional direct scheme, the decoding-and-forward based transmission scheme, and the opportunistic store-carry and forward based transmission scheme, especially when the cell radius is not small. [ABSTRACT FROM AUTHOR]

This paper addresses the resource allocation (RA) problem for orthogonal frequency division multiple access and single carrier frequency division multiple access based networks using hybrid automatic repeat request (HARQ) when considering energy efficiency (EE) as the metric to optimize. The RA is performed considering the Rayleigh channel, and assuming that only statistical channel state information is available, which fits well device-to-device (D2D) communications setup. Moreover, the use of practical modulation and coding schemes is taken into account. We formulate several RA problems with different EE criteria, subject to constraints on the minimum goodput and the maximum transmit power per-link. Based on a packet error probability approximation, we provide a framework which allows us to derive algorithms maximizing most of the common EE criteria, namely the sum of the EE of the links, the product of the EE, the EE of the link with the worst EE, and the EE of the whole network. The complexity of the proposed algorithms is also provided. The performance related to each criterion are evaluated through simulations and ranked according to the network configurations. We also illustrate on a practical example the real effectiveness of the EE criterion to achieve a better user experience than other common criteria such as the maximum sum rate and the minimum transmit power. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the power allocation of primary base station (PBS) and cognitive base station (CBS) across different orthogonal frequency division multiplexing (OFDM) subcarriers for energy-efficient secure downlink communication in OFDM-based cognitive radio networks (CRNs) with the existence of an eavesdropper having multiple antennas. For the sake of defending against eavesdropping, artificial noise is used to confuse the eavesdropper at the cost of extra power consumption. For the purpose of improving the energy efficiency (EE) of secure communications, we propose a secrecy energy efficiency maximization (SEEM) scheme by exploiting the instantaneous channel state information (ICSI) of the eavesdropper, called ICSI-based SEEM (ICSI-SEEM) scheme with a given total transmit power budget for different OFDM subcarriers of both PBS and CBS while guaranteeing a certain secrecy rate (SR) for a cognitive user, where a primary user's SR is also taken into consideration for limiting the interference in CRNs at each subcarrier. As for the case when the eavesdropper's ICSI is unknown, we also propose an SEEM scheme by using the statistical CSI (SCSI) of the eavesdropper, namely SCSI-based SEEM (SCSI-SEEM) scheme. Since the ICSI-SEEM and SCSI-SEEM problems are fractional and non-convex, we first transform them into equivalent subtractive problems, and then achieve approximate convex problems by employing the difference of two-convex functions approximation method. Finally, new two-tier power allocation algorithms are proposed to achieve $\varepsilon$ -optimal solutions of our formulated ICSI-SEEM and SCSI-SEEM problems. Simulation results illustrate that the ICSI-SEEM has a better secrecy energy efficiency (SEE) performance than SCSI-SEEM, and moreover, the proposed ICSI-SEEM and SCSI-SEEM schemes outperform conventional SR maximization and EE maximization approaches in terms of their SEE performance. [ABSTRACT FROM AUTHOR]

This paper considers a multiuser simultaneous wireless information and power transfer system with a nonlinear energy harvesting model, in which a multiantenna base station estimates the downlink channel state information (CSI) via uplink pilots. Each single-antenna user is equipped with a power splitter. Three crucial issues on resource management for this system include: 1) power-efficient improvement, 2) user-fairness guarantee, and 3) nonideal channel reciprocity effect mitigation. Potentially, a resource allocation scheme to address jointly such issues can be devised by using the framework of multiobjective optimization. However, the resulting problem might be complex to solve since the three issues hold different characteristics. Therefore, we propose a novel method to design the resource allocation scheme. In particular, the principle of our method relies on structuralizing mathematically the issues into a cross-layer multilevel optimization problem. On this basis, we then devise solving algorithms and closed-form solutions. Moreover, to instantly adapt the CSI changes in practice while reducing computational burdens, we propose a closed-form suboptimal solution to tackle the problem. Finally, we provide numerical results to show the achievable performance gains using the optimal and suboptimal solutions, and then validate the proposed resource allocation scheme. [ABSTRACT FROM AUTHOR]

Providing femto access points (FAPs) with computational capabilities will allow (either total or partial) offloading of highly demanding applications from smartphones to the so-called femto-cloud. Such offloading promises to be beneficial in terms of battery savings at the mobile terminal (MT) and/or in latency reduction in the execution of applications. However, for this promise to become a reality, the energy and/or the time required for the communication process must be compensated by the energy and/or the time savings that result from the remote computation at the FAPs. For this problem, we provide in this paper a framework for the joint optimization of the radio and computational resource usage exploiting the tradeoff between energy consumption and latency. Multiple antennas are assumed to be available at the MT and the serving FAP. As a result of the optimization, the optimal communication strategy (e.g., transmission power, rate, and precoder) is obtained, as well as the optimal distribution of the computational load between the handset and the serving FAP. This paper also establishes the conditions under which total or no offloading is optimal, determines which is the minimum affordable latency in the execution of the application, and analyzes, as a particular case, the minimization of the total consumed energy without latency constraints. [ABSTRACT FROM PUBLISHER]

This paper addresses the problem of energy-aware multihop cooperation among the mobile terminals (MTs) that cooperatively download a common content from a wireless network. The base station (BS) unicasts or multicasts the content to selected MTs that, in turn, either unicast or multicast it to other MTs, forming a multihop ad hoc network with a predefined maximum allowed number of hops. This paper presents the optimization formulations whose solution gives the exact optimal set of receiving MTs from the BS, the optimal multihop ad hoc network, and the optimal unicasting and multicasting transmission bit rates that minimize the total energy consumption of the MTs. Second, a simplified multicasting formulation is proposed that has a close-to-optimal performance with notably lower computational complexity. Third, interference avoidance among the transmitting MTs is considered. For each presented formulation, the complexity is identified, and results show that some formulations can be efficiently solved for medium network sizes, while others are more computationally complex. Thus, polynomial-time heuristic solutions are presented that have close-to-optimal performance. Results demonstrate remarkable energy consumption reduction gains and wireless resources savings under various network scenarios. [ABSTRACT FROM PUBLISHER]

This paper aims at solving two classes of energy efficiency (EE) maximization problems in multiple channels wireless communication systems. First, the EE maximization problem with sum power constraint is solved based on the geometric water-filling approach; and second, the approach is extended into the EE maximization problem with additional least throughput requirement constraint. Our proposed algorithms make use of the water-filling structure of the optimal solution and provide exact and computation efficient solution to the energy-efficient power allocation problems. The proposed algorithms also have excellent scalability, which is applicable for large-scale wireless communication systems. Optimality of the proposed algorithms is strictly proved, and the proposed algorithms only require low-degree polynomial computational complexity. Numerical results are presented to demonstrate the efficiency of the proposed algorithms. To the best of our knowledge, no prior algorithms in the existing literature could provide such solutions to the EE maximization problems under the merit of exactness and the efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we study the energy efficiency (EE) optimization for simultaneous wireless information and power transfer in multiple-input-multiple-output two-way amplify-and-forward relay networks, where the energy-constrained relay harvests energy from two sources’ signals by power splitting (PS) scheme to forward the information of two sources. Our objective is to jointly design the sources and relay precoding matrices and the PS ratio to maximize the EE of the network, under the transmit power constraints at sources and relay and the minimum spectral efficiency requirement. We transform the nonconvex precoding and PS design problem into a difference of convex programming and propose an efficient iterative algorithm based on the constrained concave convex procedure to obtain a local optimum. To reduce computational complexity, we propose a generalized singular value decomposition based channel diagonalization scheme to simplify the optimization into a joint source and relay power allocation problem. The alternating optimization method is employed to solve this problem and a suboptimal solution to the EE maximization problem is obtained. Simulation results demonstrate the effectiveness of the proposed schemes. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) have been recently considered as means to provide enhanced coverage or relaying services to mobile users (MUs) in wireless systems with limited or no infrastructure. In this paper, a UAV-based mobile cloud computing system is studied in which a moving UAV is endowed with computing capabilities to offer computation offloading opportunities to MUs with limited local processing capabilities. The system aims at minimizing the total mobile energy consumption while satisfying quality of service requirements of the offloaded mobile application. Offloading is enabled by uplink and downlink communications between the mobile devices and the UAV, which take place by means of frequency division duplex via orthogonal or nonorthogonal multiple access schemes. The problem of jointly optimizing the bit allocation for uplink and downlink communications as well as for computing at the UAV, along with the cloudlet's trajectory under latency and UAV's energy budget constraints is formulated and addressed by leveraging successive convex approximation strategies. Numerical results demonstrate the significant energy savings that can be accrued by means of the proposed joint optimization of bit allocation and cloudlet's trajectory as compared to local mobile execution as well as to partial optimization approaches that design only the bit allocation or the cloudlet's trajectory. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the performance advantages achieved by using a symbol combining (SC) approach in a random linear network coding (RLNC) scheme for broadcast communications over lossy channels. In particular, the focus is on a modified RLNC scheme that makes use of the repeated transmissions of each data symbol belonging to the same coded packet to implement the SC approach at the receiving ends. By considering the mean number of transmissions and energy consumption for each coded packet as objective metrics, two optimization procedures are proposed and compared in this paper. We consider a broadcast network model where an access point (AP) has to broadcast coded packets to a set of receiving nodes. In addition, the analysis presented in this paper is extended to broadcast communications in butterfly topology networks. For all the considered scenarios, the better behavior of the SC RLNC scheme results is clearly evident in comparison with the basic RLNC, without requiring additional implementation complexity at each receiving end. [ABSTRACT FROM PUBLISHER]

This paper investigates the energy-efficient traffic splitting for time-varying wireless networks, which have been configured with multiple radio access technologies (multi-RATs). A single stream of the media content is split into multiple segments, which could be transmitted over multiple RATs simultaneously so that the complementary advantages of different RATs can be exploited. To address this problem, we formulate the traffic splitting as a long-term energy efficiency (EE) maximization problem with respect to the time-varying channel state information (CSI). An equivalent transformation method is proposed to convert the long-term nonconvex EE maximization problem into a concave optimization. To reduce the computational complexity, we develop a dynamic traffic splitting (DTS) algorithm, which iterates only one time when the network state changes. Then, we use the definition of tracking error to describe the difference between the DTS and the target optimal traffic splitting solution. After that, an adaptive-compensation traffic splitting (ACTS) algorithm is proposed to offset the tracking error so as to enhance the EE performance. More specifically, we give a sufficient condition for significantly eliminating the tracking errors of the ACTS algorithm. Simulation results show that the proposed ACTS algorithm obtains the EE performance comparable with the optimal solution at the overhead of only a single iteration at each timeslot of the network state acquisition. [ABSTRACT FROM AUTHOR]

In this paper, we study resource allocation for a multicarrier-based cognitive radio (CR) network. More specifically, we investigate the problem of secondary users’ energy-efficiency (EE) maximization problem under secondary total power and primary interference constraints. First, assuming cooperation among the secondary base stations (BSs), a centralized approach is considered to solve the EE optimization problem for the CR network where the primary and secondary users are using either orthogonal frequency-division multiplexing (OFDM) or filter bank based multicarrier (FBMC) modulations. We propose an alternating-based approach to solve the joint power-subcarrier allocation problem. More importantly, in the first place, subcarriers are allocated using a heuristic method for a given feasible power allocation. Then, we conservatively approximate the nonconvex power control problem and propose a joint successive convex approximation-Dinkelbach algorithm (SCADA) to efficiently obtain a solution to the nonconvex power control problem. The proposed algorithm is shown to converge to a solution that coincides with the stationary point of the original nonconvex power control subproblem. Moreover, we propose a dual decomposition-based decentralized version of the SCADA. Second, under the assumption of no cooperation among the secondary BSs, we propose a fully distributed power control algorithm from the perspective of game theory. The proposed algorithm is shown to converge to a Nash-equilibrium (NE) point. Moreover, we propose a sufficient condition that guarantees the uniqueness of the achieved NE. Extensive simulation analyses are further provided to highlight the advantages and demonstrate the efficiency of our proposed schemes. [ABSTRACT FROM AUTHOR]

The base station (BS) density configuration is a crucial factor in improving energy efficiency (EE) in cellular networks, particularly when the sleeping strategy is used to reduce energy consumption. In this paper, the optimization of BS density for enhancing EE through traffic-aware sleeping strategies in both one- and two-tier cellular networks is researched, where the BS location is modeled as a Poisson point process. In the one-tier scenario, the EE optimization objective function is proved to be quasi-concave, and the optimal BS density solution is derived, where the maximum achievable EE is demonstrated to be independent of user density. In the two-tier scenario, both the activation probability of BSs and the coverage probability are analyzed, where the EE optimization objective function is proved to be not necessarily quasi-concave. To handle this nonconvex issue, an equivalent optimization problem that jointly optimizes the ratio and weighted sum of BS densities is proposed and solved by a dynamic gradient iterative algorithm. Meanwhile, a data fitting method is utilized to quantitatively analyze EE performances, in which the relationship between the optimal BS density and the user density is approximately linear when the user density is sufficiently high. Simulation results verify the relevant derivations and reflect that the sleeping strategy can not only save energy but improve the quality of radio links as well. [ABSTRACT FROM PUBLISHER]

Apart from spectral efficiency (SE), energy efficiency (EE) has become an important metric for future wireless communication systems. However, how to achieve balance between SE and EE for a multicell multiuser coordinated beamforming system remains an open problem. In this paper, we propose a new paradigm for EE–SE balancing, namely, using a new metric called resource efficiency (RE) as the objective function to achieve a reasonable tradeoff between SE and EE. The considered optimization problem is more complex than traditional problems and, in general, is NP-hard for finding the globally optimal solution. To obtain insight into the problem, we first equivalently transform the original problem into a parameterized subtractive form optimization problem with some auxiliary variables by using the fraction programming theory. Then, a successive convex approximation method and the classical second-order cone programming method are jointly used to solve the equivalent problem. Finally, an effective algorithm with proven convergence is proposed to obtain the solution to the considered RE optimization. In addition, the algorithm is further extended to consider imperfect channel state information (CSI) using the worst-case design. Extensive numerical simulations are given to validate the effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]

This paper studies joint scheduling and network coding in wireless multicast networks with independent sources. Designing a network coding solution for wireless networks involves scheduling interference-free transmissions and optimizing a performance measure for the predetermined scheduling sets, followed by constructing network codes for the specific solution. In such a design process, the results of prior steps need to provide enough information to the subsequent steps. In this paper, we formulate a linear optimization problem whose results can be used to design a coding solution. We build our work on previous works and present statistics that show the importance of incorporating unequal timeshares in designing network codes. In particular, our statistics show a throughput improvement of about 35% in maximum flow problems and energy savings between 13% and 30%, depending on the network size, in minimum energy problems. We also present the requirements of code construction algorithms for wireless networks that capture the broadcast property of these networks and can design proper codes when timeshares are unequal. In particular, the adaptation of a centralized network coding scheme for wireless networks is discussed. Overall, the work reported here provides a three-step solution to derive network codes that optimize a performance criterion of interest while also solving the scheduling problem in multihop wireless networks. [ABSTRACT FROM PUBLISHER]

Both energy efficiency (EE) and spectral efficiency (SE) are two important design criteria that can hardly be achieved simultaneously. In this paper, we investigate the EE–SE tradeoff for a two-way relaying system with amplify-and-forward (AF) strategy. Applying a unified EE–SE tradeoff metric, a power-allocation problem is formulated as the joint EE and SE maximization problem with a tradeoff factor. In particular, only statistical channel-state information (CSI) is required, and the asymmetric traffic requirements are taken into consideration in our design. Through the exploitation of the theorem of nonlinear fractional programming, a unique closed-form optimum solution is obtained, and some useful insights are also achieved. It has been proved that the provided optimal solution is Pareto optimal for EE–SE optimization. Utilizing these results, one can flexibly make the tradeoff between EE and SE by simply setting the tradeoff factor. Simulation results highlight the effect of the proposed power-allocation scheme. [ABSTRACT FROM AUTHOR]

This paper investigates advanced energy-efficient wireless systems in orthogonal frequency-division multiple access (OFDMA) downlink networks using coordinated multipoint (CoMP) transmissions between the base stations (BSs) in a heterogeneous network (HetNet), which is adopted by Third-Generation Partnership Project (3GPP) Long-Term Evolution (LTE)-Advanced to meet International Mobile Telecommunications-Advanced targets. HetNet CoMP has received significant attention as a way of achieving spectral efficiency (SE) and energy efficiency (EE). Usually, in the literature, the total network power consumption is restricted to the sum of the power consumption of all BSs. The significance of the power consumption of the backhaul links in wireless networks is normally omitted for its trivial effect with respect to that of the radio BSs. For SE and EE analysis of HetNet CoMP, the energy and bandwidth consumption of the backhaul is considered, without which, the investigation remains incomplete. However, SE and EE are design criteria in conflict with each other, and a careful study of their tradeoff is mandatory for designing future wireless communication systems. The EE is measured as “throughput (bits) per joule,” whereas the power consumption model includes RF transmit (radiated), circuit, and backhaul power. Furthermore, a nonideal backhaul model such as a microwave link is also investigated within intra-HetNet-CoMP (inside one cell), where an implementing fiber is not feasible. An intercell interference (ICI) coordination method is also studied to mitigate ICI. At the end, a novel resource allocation algorithm is proposed—modeled as an optimization problem—which takes into account the total power consumption, including radiated, circuit, and backhaul power, and the minimum required data rate to maximize EE. Given an SE requirement, the EE optimization problem is formulated as a constrained optimization problem. The considered optimization problem is transformed into a convex optimization problem by redefining the constraint using cubic inequality, which results in an efficient iterative resource allocation algorithm. In each iteration, the transformed problem is solved by using dual decomposition with a projected gradient method. Simulations results demonstrate how backhaul has a significant impact on total power consumption and the effectiveness of the studied schemes. In addition, the results demonstrate that the proposed iterative resource allocation algorithm converges within a small number of iterations and illustrate the fundamental tradeoffs between SE and EE. Our analytical results shed light on future “green” network planning in advanced OFDMA wireless systems like those envisioned for a fifth-generation (5G) system. [ABSTRACT FROM PUBLISHER]

Interference alignment (IA) is a promising technique for interference management in wireless networks. However, the sum rate may fall short of the theoretical maximum, particularly at low signal-to-noise ratio (SNR) levels since IA mainly concentrates on mitigating the interference, instead of improving the quality of desired signal. Moreover, most of the previous works focused on improving spectrum efficiency, but the energy efficiency (EE) aspect is largely ignored. In this paper, an adaptive energy-efficient IA algorithm is proposed through power allocation (PA) and transmission-mode adaptation for green IA-based wireless networks. The PA problem for IA is first analyzed; then, we propose a PA scheme that optimizes the EE of IA-based wireless networks. When the SNR is low, the transmitted power of some users may become zero. Thus, the users with low transmitted power are turned into the sleep mode in our scheme to save energy. The transmitted power and transmission mode of the remaining active users are adapted again to further improve the EE of the network. To guarantee the interests of all the users, fairness among users is also considered in the proposed scheme. Simulation results are presented to show the effectiveness of the proposed algorithm in improving the EE of IA-based wireless networks. [ABSTRACT FROM PUBLISHER]

In this paper, we present an analytical framework to improve the energy consumption of mobile nodes through traffic offloading via wireless local area networks (WLANs), taking into account the energy consumption for both data transmission and network discovery operations. More specifically, we formulate an optimization problem, according to which the network scanning period is optimized to minimize the total energy consumption and the energy consumption per transmitted bit in a scenario where a user moves with a constant, either pedestrian or vehicular, speed along a road covered by a long-range cellular network and a number of randomly deployed WLANs. The performance of the system that employs the proposed framework, which uses information on the user speed as well as on the availability and the load level of neighboring networks and performs periodic network scanning with the optimal period, is compared against a suboptimal system that does not take into consideration the user and network context information when determining the network scanning period. According to performance evaluation results, the use of the optimal network scanning period achieves significant improvement in terms of total energy consumption, energy efficiency, and network detection delay. [ABSTRACT FROM PUBLISHER]

This paper addresses the problem of adaptive power control of a two-way amplify-and-forward (AF) relaying network based on outage probability minimization. Unlike most of the existing works, our network scenario has asymmetric traffic requirements, and each terminal in the network is subject to an individual power constraint in addition to a total power consumption constraint of the network. To fulfill power control, instantaneous or statistical channel state information (CSI) is assumed to be available at the transmitter of each terminal. By dividing the overall power control problem into a few subproblems corresponding to different power constraints, and using the traffic knowledge along with the CSI, two power control strategies, called short- and long-term strategies, are proposed, leading to closed-form solutions for individual transmit powers at the relay and the sources that are adapted to certain traffic requirements and channel conditions. Simulation results are provided to demonstrate the effectiveness of the proposed power control strategies. It is shown that the short-term strategy can achieve a significant performance gain in terms of the outage probability, regardless of symmetric or asymmetric traffics and channels, and meanwhile, the long-term strategy is more appropriate to asymmetric traffic and channel conditions. [ABSTRACT FROM AUTHOR]

Energy-efficient transmission is crucial for future wireless communication systems and has attracted much attention. In this paper, we study coordinated beamforming optimization for multicell multiple-input–single-output (MISO) downlink systems using energy efficiency as a criterion, which is still an open problem to the best of our knowledge. The optimization problem of interest is nonconvex and in a fractional form. To solve it, we first reveal that finding the solution of the problem is equivalent to searching for a particular point on the Pareto boundary of the newly defined energy-efficiency rate tuples. Then, we propose to use a set of interference temperature (IT)-constrained beamforming optimization problems to characterize the energy-efficiency rate Pareto boundary. Based on that, two efficient iterative algorithms are developed to reach the Pareto optimality and thus to solve the primary problem. We show that the proposed algorithms can be carried out in a decentralized manner and are guaranteed to converge. Then, these algorithms are extended to consider imperfect channel state information (CSI) using the worst-case design. Numerical results are finally provided to verify the effectiveness of the proposed schemes and they exhibit the great potential of the coordinated beamforming optimization in improving the energy efficiency of the cellular network. In particular, the results also illustrate that our proposed algorithms achieve most of the achievable performance gain with a small number of iterations and thereby with limited backhaul overhead in a time-division duplexing (TDD) system. [ABSTRACT FROM AUTHOR]

In the area of energy-efficient (EE) resource allocation, only limited work has been done on consideration of both transmitter and receiver energy consumption. In this paper, we propose a novel EE resource-allocation scheme for orthogonal frequency-division multiple-access (OFDMA) networks, where both transmitter energy consumption and receiver energy consumption are considered. In addition, different quality-of-service (QoS) requirements, including minimum-rate guarantee service and best effort service, are taken into account. The time slot, subcarrier (frequency), and power-allocation policies are jointly considered to optimize system EE. With all these considerations, the EE resource-allocation problem is formulated as a mixed combinatorial and nonconvex optimization problem, which is extremely difficult to solve. To reduce the computational complexity, we tackle this problem in three steps. First, for a given power allocation, we obtain the time–frequency resource unit (RU) allocation policy via binary quantum-behaved particle swarm optimization (BQPSO) algorithm. Second, under the assumption of known RU allocation, we transform the original optimization problem into an equivalent concave optimization problem and obtain the optimal power-allocation policy through the Lagrange dual approach. Third, an iteration algorithm is developed to obtain the joint time–frequency power–resource-allocation strategy. We validate the convergence and effectiveness of the proposed scheme by extensive simulations. [ABSTRACT FROM PUBLISHER]