Search

In heterogeneous networks (HetNets), energy-efficient resource allocation and intercell-interference management are important issues. In this paper, we address these issues using a two-level dynamic scheme. First, we assign the MUs with the optimum number of subchannels that achieves an operator's required balance between macro users' satisfaction and maximization of network efficiency. Then, the remaining subchannels are left to be shared by a number of small cells. In the latter step, a transmit power adaptation method using a noncooperative game-theoretic approach is developed to reduce cochannel interference in the whole network. The problem is formulated by allowing multiple neighboring small cells to share each subchannel (i.e., universal frequency reuse in the small cell level). We fully characterize the pricing factor in the penalty part of the utility function. The existence and uniqueness of the Nash equilibrium (NE) are analyzed and proved. Then, a distributed iterative algorithm based on the fixed-point theorem is proposed to attain the equilibrium of the game. Simulation results are presented to show the effectiveness of the proposed scheme in different network topologies. [ABSTRACT FROM AUTHOR]

In this paper, we consider the resource-allocation problem for energy efficiency (EE)–spectral efficiency (SE) tradeoff. Unlike traditional research that uses the EE as an objective function and imposes constraints either on the SE or on the achievable rate, we propound a multiobjective optimization approach that can flexibly switch between the EE and SE functions or change the priority level of each function using a tradeoff parameter. Our dynamic approach is more tractable than the conventional approaches and more convenient to realistic communication applications and scenarios. We prove that the multiobjective optimization of the EE and SE is equivalent to a simple problem that maximizes the achievable rate/SE and minimizes the total power consumption. Then, we apply the generalized framework of the resource allocation for the EE–SE tradeoff to optimally allocate the subcarriers' power for orthogonal frequency-division multiplexing (OFDM) with imperfect channel estimation. Finally, we use numerical results to discuss the choice of the tradeoff parameter and study the effect of the estimation error, transmission power budget, and channel-to-noise ratio on the multiobjective optimization. [ABSTRACT FROM AUTHOR]

Energy harvesting (EH) from background radio-frequency signals has recently started to be considered as a promising means of mitigating energy deficiencies in wireless sensors that have limited battery power. In this paper, to deal with the problem of energy shortage, we consider EH and energy efficiency, which is the ratio of the amount of data transferred to the energy dissipated within the system, at the same time. We formulate a nonconvex optimization problem for determining the training interval for channel estimation, user scheduling, and power allocation strategies to maximize the energy efficiency and transform the problem into a tractable convex problem. Based on the convexity of the problem, we propose an energy-efficient resource allocation strategy using an iterative method and provide the convergence of the proposed algorithm based on nonlinear fractional programming. The simulation results show that the proposed algorithm operates in an energy-efficient way, thereby achieving maximum energy efficiency while ensuring the data rate and harvested energy requirements. [ABSTRACT FROM AUTHOR]

In this paper, a resource allocation algorithm for maximizing the energy efficiency (EE) is studied in multicell orthogonal frequency-division multiple-access (OFDMA) wireless networks. The resource allocation is designed based on imperfect channel state information (CSI). Universal frequency reuse is considered, and cochannel interference is dealt with via the cooperation of multiple base stations (BSs) sharing CSI but not user data. We formulate the energy-efficient resource allocation problem as a probabilistic mixed nonconvex optimization problem. The user scheduling, data rate adaptation, and power allocation are jointly designed to maximize the system EE, under the maximum transmitted power constraint and the outage probability constraint. An iterative algorithm is proposed in which the EE keeps improving until algorithm convergence. In each iteration, the energy-efficient power allocation optimization problem is solved by a lower bound problem and a parameterized transformation. Numerical results illustrate the convergence and the effectiveness of the proposed algorithm. In a multicell environment with cochannel interference, the proposed algorithm has large EE gains relative to the spectral efficiency (SE) loss. Compared with noncoordinated methods, the proposed method can achieve higher EE when backhaul power consumption is low. [ABSTRACT FROM AUTHOR]

In this paper, we discuss three different design criteria for a distributed antenna system (DAS). They include maximizing throughput under the constraint of the overall transmit power, minimizing the overall transmit power while guaranteeing the minimum spectral efficiency (SE) requirements, and maximizing energy efficiency (EE) under the constraints of minimum SE requirements and overall transmit power. The optimization problems for the first two criteria are signomial programming (SP) problems when considering the interference among the mobile stations (MSs), which are nonlinear nonconvex and do not lead to the closed-form solutions directly. Exploiting the nature of geometric mean, we transform the SP problems into geometric programming (GP) problems, which can be solved by turning them into convex problems. For the third criterion, using the theorem of fractional programming, we first transform the fractional optimization problem into an equivalent optimization problem in a subtractive form, which is an SP problem. We then obtain its solution by transforming the SP to the GP problem as we have done for the previous two problems. Based on these design criteria, three power allocation algorithms are developed for the downlink multiuser DAS. Depending on the application environments, we can use the first and second criteria to achieve the highest throughput and to save energy, respectively, while balancing throughput and energy consumption using the third criterion. [ABSTRACT FROM AUTHOR]

Taking full advantage of both heterogeneous networks and cloud access radio access networks, heterogeneous cloud radio access networks (H-CRANs) are presented to enhance both spectral and energy efficiencies, where remote radio heads (RRHs) are mainly used to provide high data rates for users with high quality of service (QoS) requirements, whereas the high-power node (HPN) is deployed to guarantee seamless coverage and serve users with low-QoS requirements. To mitigate the intertier interference and improve energy efficiency (EE) performances in H-CRANs, characterizing user association with RRH/HPN is considered in this paper, and the traditional soft fractional frequency reuse (S-FFR) is enhanced. Based on the RRH/HPN association constraint and the enhanced S-FFR, an energy-efficient optimization problem with the resource assignment and power allocation for the orthogonal-frequency-division-multiple-access-based H-CRANs is formulated as a nonconvex objective function. To deal with the nonconvexity, an equivalent convex feasibility problem is reformulated, and closed-form expressions for the energy-efficient resource allocation solution to jointly allocate the resource block and transmit power are derived by the Lagrange dual decomposition method. Simulation results confirm that the H-CRAN architecture and the corresponding resource allocation solution can enhance the EE significantly. [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]

In this paper, we investigate the power allocation issue for cooperative-sensing-based code-division multiple access (CDMA) cognitive radio (CR) networks. We consider a network consisting of multiple secondary users (SUs) and a secondary base station (BS) implementing a two-phase protocol. In the first phase, censor-based cooperative spectrum sensing is carried out to detect the PU's presence. When the channel is estimated to be free, SUs transmit data in the uplink to the BS in the second phase by using CDMA. We optimize the sensing parameters and transmit power of SUs jointly to minimize the total energy consumption with the constraints on SUs' quality of service (QoS) and detection probability of the PU. This is a nonconvex problem, which we represent as a monotonic optimization problem and solve by means of monotonic programming. Furthermore, we study the separate optimization problem in which sensing parameters and transmit power are optimized to minimize the energy consumption of the first phase and the second phase disjointly. Numerical results show that the proposed joint optimization method saves energy consumption significantly in lower signal-to-noise ratios (SNRs). It can introduce as high as 3.9 and 8.7 dB joule energy saving per time slot in zero-sensing SNR under the same data rate constraints of 0.5 and 1 bit/s/Hz, respectively. [ABSTRACT FROM PUBLISHER]

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]

In this paper, a new approach to energy harvesting and data transmission optimization in a heterogeneous-based multi-class and multiple resource wireless transmission wireless sensor network system that focus on monitoring water and its quality is presented. Currently, energy is a scarce resource in wireless sensor networks due to the limited energy budget of batteries, which are typically employed for powering sensors. Once the available energy of a particular sensor node battery is depleted, such sensor node becomes inactive in a network. As a consequence, such node may not be able to participate in the transmission of the application signal in the uplink stage of the network, resulting in a lack of ability to communicate vital signals in a timely manner. Energy scarcity has been a long standing problem in wireless sensor network applications. To address this problem, energy harvesting from intended radiofrequency power source is considered in this work. However, wirelessly powered wireless sensor network systems are confronted by unfairness in resource allocation problem, as well as interference problem in multiple energy resource transmissions. These problems adversely impact the performance of the system in the context of the harvested energy by the sensor nodes, sensors information transmission rates, and the overall system throughput rate. These problems are tackled in this paper by formulating a sum-throughput maximization problem to reduce system energy consumption and enhance the system overall throughput rate. The throughput optimization problem is formulated as a non-convex function. Through the exploitation of the problem structure, it is converted to a convex function. The mathematical models of the optimization problem are validated through numerical simulations. The simulation results reveal that the proposed wireless powered sensor network system outperforms an existing wireless powered sensor network system, by comparison of the numerical simulations of this work to the numerical simulations of the existing WPSN system, regardless of the distances of the sensor nodes to the IPS and the base station. Also, the newly proposed method performs efficiently using parameters that include path-loss exponent impact, performance comparison of systems, convergence based on iteration, comparison based on unequal network distances to the BS, transmission power impact on the attainable throughput and on fraction of energy consumed on information transmissions, and influence of different number of nodes in the network classes. [ABSTRACT FROM AUTHOR]

Considering the recent exponential growth in the amount of information processed in Big Data, the high energy consumed by data processing engines in datacenters has become a major issue, underlining the need for efficient resource allocation for more energy-efficient computing. We previously proposed the Best Trade-off Point (BToP) method, which provides a general approach and techniques based on an algorithm with mathematical formulas to find the best trade-off point on an elbow curve of performance vs. resources for efficient resource provisioning in Hadoop MapReduce. The BToP method is expected to work for any application or system which relies on a trade-off elbow curve, non-inverted or inverted, for making good decisions. In this paper, we apply the BToP method to the emerging cluster computing framework, Apache Spark, and show that its performance and energy consumption are better than Spark with its built-in dynamic resource allocation enabled. Our Spark-Bench tests confirm the effectiveness of using the BToP method with Spark to determine the optimal number of executors for any workload in production environments where job profiling for behavioral replication will lead to the most efficient resource provisioning. [ABSTRACT FROM AUTHOR]

Because the energy consumption is growing rapidly, green radio, which lays emphasis on the energy efficiency (EE) in wireless networks, is becoming increasingly important. As potential paradigms for future wireless network design, cognitive radio (CR) is a promising technology to solve the spectrum shortage and inefficiency issues, while cooperative relay is capable of improving spectral efficiency by combating severe fading in wireless environment. In this paper, we investigate the energy-efficient power allocation problem in orthogonal frequency division multiplexing (OFDM)-based relaying CR networks. We develop a general framework to maximize the overall EE of the CR system, under the constraints of transmission power budget, traffic demands, and the interference constraints of the primary users. Our problem formulation is a nonconvex optimization task, and it is hard to obtain the optimal solution. We first convert our formulated problem into a convex optimization problem via its hypograph form, which can be solved by the barrier method. Then we further speed up the computation of Newton step during the barrier method, significantly reducing the complexity of the algorithm by exploiting its special structure. Numerical results validate that our method can exploit the overall EE of CR systems, while the algorithm converges efficiently and stably. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]