Search

Plug-in hybrid electric vehicles (PHEVs) with fuel and electricity have demonstrated the capability to reduce fuel consumption and emissions by adopting appropriate energy management strategies. In the existing energy management strategies, the dynamic programming (DP)-based energy management strategy (EMS) can realize the global optimization of the fuel consumption if the global vehicle-speed trajectory is known in advance. The global vehicle-speed trajectory can be obtained by applying GPS data of vehicles when the trip path is determined. However, for a trip path without GPS data, the global vehicle-speed trajectory is difficult to be gained. In this case, the DP-based EMS cannot be utilized to achieve the globally optimal fuel consumption, which is the issue discussed in this paper. This paper makes the following two contributions to solve this issue. First of all, the cell transmission model of the road traffic flow and the vehicle kinematics are introduced to obtain the traffic speeds of road segments and the accelerations of the PHEV. On this basis, a hybrid trip model is presented to obtain the vehicle-speed trajectory for the trip path without GPS data. Next, a DP-based EMS with prediction horizon is proposed, and moreover, in order to improve its real-time implementation, a search range optimization algorithm of the state of charge (SOC) is designed to reduce the computational load of DP. In summary, we propose a computation-optimized DP-based EMS through applying the hybrid trip model. Finally, a simulation study is conducted for applying the proposed EMS to a practical trip path in Beijing road network. The results show that the hybrid trip model can effectively construct the vehicle-speed trajectory online, and the average accuracy of the vehicle-speed trajectory is more than 78%. In addition, compared with the existing optimization algorithm for DP calculation, the SOC search range optimization algorithm can further reduce the calculation load of DP. More importantly, compared to the globally optimal DP-based EMS, although the proposed EMS makes the fuel consumption grow less than 5.36%, it can be implemented in real time. Moreover, compared with the existing real-time strategies, it can further reduce the fuel consumption and emissions. Thus, the proposed EMS can offer an effective solution for the PHEV applying it online in the trip path without GPS data. [ABSTRACT FROM PUBLISHER]

In this paper, we study the problem of utility maximization in the uplink of vehicle-to-infrastructure communication systems. The studied scenarios consider four practical aspects of mobile radio communication links: i) Interference between adjacent channels, ii) interference between roadside units along the way, iii) fast and slow channel fadings, and iv) Doppler shift effects. We present first the system model for the IEEE 802.11p standard, which considers a communication network between vehicles and roadside infrastructure. Next, we formulate the problem of utility maximization in the network, and propose a distributed optimization scheme. This distributed scheme is based on a two-loop feedback configuration, where an outer-loop establishes the optimal signal to interference-noise ratio (SINR) that maximizes the utility function per vehicle and defines a quality-of-service objective. Meanwhile, inner-control loops adjust the transmission power to achieve this optimal SINR reference in each vehicle node regardless of interference, time-varying channel profiles and network latency. The computation complexity of the distributed utility maximization scheme is analyzed for each feedback loop. Simulation results indicate that the proposed scheme reaches the objective SINRs that maximize utility and improve energy efficiency in the network with a low time cost. The results also show that the maximum utility is consistently achieved for different propagation scenarios inside the vehicular communication network. [ABSTRACT FROM AUTHOR]

In this paper, weighted sum energy efficiency (WSEE) in uplink and downlink of a multi-user non-orthogonal multiple access (NOMA) system is considered. we adopt a more realistic power consumption model where signal processing power is modeled as a linear function of transmit power. Rather than the well-known network-centric global energy efficiency (GEE) metric, which is a pseudo-concave (PC) function, the weighted sum energy efficiency metric is considered, which is not PC in general. To find the optimum user power allocation Dinkelbach-like algorithm is adopted, by which each individual fractional EE function is converted to a parametric function where under some conditions on the weights falls into a class of convex optimization problems and it is solved in the dual domain. The dual variables are updated using a sub-gradient and cutting plane-based algorithm, which here ellipsoid method is used. Since the optimum solution restricts user weights, a low complexity suboptimum algorithm that does not consider any condition on user's weights is proposed. The problem is non-convex in general; hence, epigraph form followed by successive convex approximation (SCA) is used to deal with that problem. Results demonstrate that with the user-oriented metric, one can provide different priorities to users, and by choosing proper weights entail fairness among users. [ABSTRACT FROM AUTHOR]

Energy Harvesting (EH) technology enables Device-to-Device (D2D) User Equipments (DUEs) to harvest energy from ambient energy, making contributions to green communications and breaking the single battery-powered and the regional limitations of device deployment. The joint problem of energy harvesting and resource allocation in EH-based D2D Communication Networks (EH-DCNs) is a challenge issue. In this paper, we investigate the joint problem of resource allocation and EH time slot allocation of DUEs in EH-DCNs, where the DUEs harvest energy and multiplex Cellular User Equipments (CUEs) uplink resources. A channel assignment, power allocation and EH time slot allocation problem in EH-DCNs is formulated. The goal is to maximize energy- and spectral-efficiency with α-fairness while guaranteeing the EH constraints of DUEs and the quality of service of CUEs. The formulated problem is a non-convex mixed-integer multi-objective optimization problem. In order to solve the formulated problem, the multi-objective optimization problem is transformed into a single-objective optimization problem based on the weight sum method. We propose a joint iterative algorithm based on Lagrangian dual decomposition for α > 0 and α = 0, respectively. Numerical results illustrate that the proposed algorithm achieves higher energy efficiency and spectral efficiency for different network parameter settings. [ABSTRACT FROM AUTHOR]

In order to help user terminal devices (UTDs) efficiently handle computation-intensive and time-delay sensitive computing task, multi-access edge computing (MEC) has been proposed. However, due to the differences among the performance of UTDs, and the resource limitation of MEC servers, the joint optimization between the offloading decisions of UTDs and the allocation of resources in network is still a focus of the research. This paper studies the joint computation offloading and resource allocation strategy in multi-user and multi-server scenarios. Firstly, we formulate the joint optimization problem of computation offloading and resource allocation as a mixed integer nonlinear programming (MINP) problem to minimize the energy consumption of UTDs, by constraining the offloading decision, channel selection, power allocation and resource allocation. Secondly, we propose a two-stage heuristic optimization algorithm based on genetic algorithms, which divides the joint optimization problem of computation offloading and resource allocation in two stages. Based on the coupling relationship between the offloading decision and the resource allocation scheme, we iteratively update the solution of the problem, and finally obtain the stable convergence solution of the optimization problem. Finally, the proposed algorithm is compared with other classical methods to prove the effectiveness. [ABSTRACT FROM AUTHOR]

This paper aims at investigating the tradeoff between ergodic energy efficiency (EE) and spectral efficiency (SE) for device-to-device (D2D) communications underlaying cellular networks. Assuming average-based resource allocation, we propose a multiobjective optimization problem (MOOP) approach to deal with the EE and SE maximization problem. Specifically, the formulated MOOP results in the maximization of the total ergodic sum rate of the D2D users and the minimization of the total average transmit power of the D2D transmitters. Two practical scenarios are considered, i.e., a limited interference scenario, which includes the sparsely deployed scenario, and a densely deployed scenario, where for each scenario the maximum achievable EE and SE are derived. Specifically, considering the limited interference scenario, an upper bound is imposed on the received interference across different D2D communications, and closed-form expressions for the optimal power allocation, ergodic sum rate, and maximum EE are obtained. In the general, densely deployed scenario, however, the cross D2D network interference needs to be taken into account. We provide an optimal solution for the power control based on sequential fractional programming to tradeoff between complexity and performance gain. Simulation results unveil an interesting tradeoff to strike a balance between EE and SE. [ABSTRACT FROM AUTHOR]

In this paper, we design the UAV trajectory to minimize the total energy consumption while satisfying the requested timeout (RT) requirement and energy budget, which is accomplished via jointly optimizing the path and UAV's velocities along subsequent hops. The corresponding optimization problem is difficult to solve due to its non-convexity and combinatorial nature. To overcome this difficulty, we solve the original problem via two consecutive steps. Firstly, we propose two algorithms, namely heuristic search, and dynamic programming (DP) to obtain a feasible set of paths without violating the GU's RT requirements based on the traveling salesman problem with time window (TSPTW). Then, they are compared with exhaustive search and traveling salesman problem (TSP) used as reference methods. While the exhaustive algorithm achieves the best performance at a high computation cost, the heuristic algorithm exhibits poorer performance with low complexity. As a result, the DP is proposed as a practical trade-off between the exhaustive and heuristic algorithms. Specifically, the DP algorithm results in near-optimal performance at a much lower complexity. Secondly, for given feasible paths, we propose an energy minimization problem via a joint optimization of the UAV's velocities along subsequent hops. Finally, numerical results are presented to demonstrate the effectiveness of our proposed algorithms. The results show that the DP-based algorithm approaches the exhaustive search's performance with a significantly reduced complexity. It is also shown that the proposed solutions outperform the state-of-the-art benchmarks in terms of both energy consumption and outage performance. [ABSTRACT FROM AUTHOR]

This correspondence paper proposes a novel low-complexity radio-frequency (RF) precoding and combining scheme for wideband multiuser millimeter wave hybrid-array systems, targeting at maximizing the system energy efficiency. We first derive a nearly-optimal fully-connected RF precoder, via minimizing the correlation across different users and subcarriers. We then extend the optimization solution to subarray-based architectures by exploiting the unitary matrix feature of subarrays. With the obtained phase values of the precoder, we optimize the power allocation on each subcarrier of the baseband precoder. Simulation results are provided and validate the effectiveness of our proposed hybrid precoding scheme. [ABSTRACT FROM AUTHOR]

In this paper, we propose a spatial group based optimal uplink power control scheme to enhance the performance of random access (RA) in satellite networks. In the proposed scheme, satellite machine-type terminals (SMTs) are divided into multiple groups based on their spatial locations in a distributed fashion, and the target received power levels of SMTs are the same in the same group but different from group to group by means of uplink power control, which enables the received power diversity. The received power levels of SMTs in different groups are designed by taking into account their path losses, which effectively reduces the energy consumption of SMTs. The threshold based capture model at the gateway demodulator is adopted, and the packet loss ratio (PLR) based on this model is derived by using density evolution analysis. An optimization problem is formulated and solved to jointly find the optimal number of power levels and the optimal values of power levels, which maximizes the RA system throughput. Simulation results show that the proposed scheme can obtain considerable performance improvement with respect to the conventional schemes in terms of normalized throughput, PLR, and average energy consumption. [ABSTRACT FROM AUTHOR]

In this paper, we study the optimal power allocation for a radio frequency (RF)-powered cooperative network and propose energy-saving time switching relaying (ES-TSR) and energy-saving power splitting relaying (ES-PSR) protocols with an iterative energy-saving (ES) algorithm. In particular, we develop the analytical expressions of the channel capacity and the total energy consumption for the considered cooperative network. We formulate the system energy efficiency maximization problems and then provide the corresponding solutions by deriving the source's optimal transmit power in terms of energy fraction consumed with time switching (TS) factor and power splitting (PS) factor for the proposed ES-TSR and ES-PSR protocols, respectively, in each transmission block. From the past approaches, the optimal power allocation to maximize the system energy efficiency of the RF-powered cooperative networks has been studied under the assumption that the relay must utilize all of its harvested power in each transmission block. This work considers optimal power allocation to maximize the system energy efficiency for the case when the relay node can save energy for the next transmission block. Our simulation results show that the proposed ES-TSR and ES-PSR protocols outperformed the existing TS-based and PS-based relaying protocols with $\text{14.22}\%$ and $\text{8.4}\% $ , respectively, in paticular when the number of transmission blocks $\boldsymbol{L} = 10$. [ABSTRACT FROM AUTHOR]

This paper proposes a new full-duplex (FD) secrecy communication scheme for the unmanned aerial vehicle (UAV) and investigates its optimal design to achieve the maximum energy efficiency (EE) of the UAV. Specifically, the UAV receives the confidential information from a ground source and meanwhile sends jamming signals to interfere with a potential ground eavesdropper. As the UAV has limited on-board energy in practice, we aim to maximize the EE for its secrecy communication, by jointly optimizing the UAV trajectory and the source/UAV transmit/jamming powers over a finite flight period. Although the formulated problem is difficult to be optimally solved due to its non-convexity, we propose an efficient iterative algorithm to obtain its high-quality suboptimal solution. Simulation results show that significant EE improvements can be achieved via joint optimization and the EE gains highly depend on the capability of the self-interference cancelation at the UAV. [ABSTRACT FROM AUTHOR]

This paper investigates UAV-to-UAV (unmanned aerial vehicle) communications with a turning angle constraint, in which the information transmission time is minimized by joint UAV flight path planning and transmit power control. Considering the communication throughput requirement, peak transmit power, energy consumption, UAV flight speed, collision avoidance, and turning angle constraints, the joint UAV flight path planning and transmit power control problem is formulated as a non-convex optimization. Different from majority of prior studies that separately optimize the UAV flight path and transmit power, we develop a successive convex approximation based time minimization algorithm that simultaneously updates the UAV path and transmit power. We further prove that the proposed algorithm is guaranteed to converge. In addition, an initialization scheme is designed to start the proposed time minimization algorithm by solving an energy minimization problem. Simulation results verify that the proposed time minimization algorithm can shorten the completion time length and reduce the computational complexity compared with state of the art methods. [ABSTRACT FROM AUTHOR]

The optimization of train trajectory and timetable offers two effective methods of energy-efficient operations. Most traditional research optimizes them separately and thus the global optimality cannot be achieved. Previous work has mainly concentrated on minimizing the mechanical energy consumption of trains, not the electrical energy. This paper aims to develop an integrated model to optimize the integrated timetable, which includes both the timetable and the train trajectory achieve the minimum electrical energy consumption. The AC power supply system model is first proposed to calculate the parameters of the AC power supply network. Then, a model is developed to calculate various energy consumptions using power flow calculation. Furthermore, an integrated timetable optimization model for minimum total energy consumption of AC railway system is proposed and the optimal integrated timetable is obtained by the proposed hybrid GA-PSO algorithm. Finally, 5 real-world case studies based on the Lanzhou–Xinjiang high-speed railway are presented. The results show that the proposed integrated model can achieve a reduction in total energy consumption for the entire line up to 14.3% compared with the previous optimization model. The hybrid GA-PSO algorithm achieves the best results compared with the results achieved by the GA and PSO algorithms applied along. [ABSTRACT FROM AUTHOR]

In this paper, we consider a wireless-powered network with co-channel interference where the transmitters control their transmit power and receivers harvest wireless energy using a time switching policy. Considering the interference channels among multiple nodes, we jointly optimize the transmit power and energy harvesting time to maximize the energy efficiency of the network. To solve this non-convex optimization problem, we first design an iterative algorithm based on a typical optimization technique, and then, propose a learning algorithm based on a neural network with a proper loss function. Simulation results show that the proposed learning algorithm can achieve a near-optimal energy efficiency with reducing the computational complexity, compared to an iterative algorithm with a suboptimal performance. [ABSTRACT FROM AUTHOR]

With the advancement of the next generation of cellular systems, flexible mechanisms for Discontinuous Reception (DRX) are needed in order to save energy. 5G will bring heterogeneous packet sizes and traffic types, as well as an increasing need for energy efficiency. The current static DRX mechanism is inadequate to meet these needs. In this paper we exploit channel prediction to develop integer programming models. We aim to minimize the energy usage of user devices while streaming video, as well as to create extended sleep opportunities, while simultaneously preventing buffer underflows. We also develop an online algorithm to obtain an efficient solution robust to prediction errors. Our results show that using a variable DRX cycle length can reduce the energy usage by up to 60 percent and 40 percent, in the offline and online cases, respectively, compared with a static DRX configuration. Our proposed online algorithm can also reduce the number of buffer underflows by up to 97 percent compared to the offline case. Both our online and offline solutions can provide extended DRX opportunities, which is required in 5G scenarios. [ABSTRACT FROM AUTHOR]

Hybrid analog-digital (HAD) beamforming architectures have been proposed to facilitate the practical implementation of massive multiple-input multiple-output (MIMO) systems by reducing the number of employed radio frequency chains. While most prior studies have aimed to maximize spectral efficiency (SE), the present paper proposes a two-stage HAD beamforming design for multi-user MIMO systems that can be used to maximize either the system's overall energy efficiency (EE) or SE. This problem is nonconvex and NP-hard due to the joint optimization between the analog and digital domains and the constant modulus constraints required by the analog domain. To address this problem, we propose a decoupled two-stage design wherein the first stage, the analog beamforming parts are updated, which are then taken into account in the second stage to design the digital beamforming parts to maximize the system's EE or SE. We consider two widely-used HAD beamforming techniques that utilize either fully-connected (FC) or partially-connected (PC) architectures employing variable phase-shifters. Using the most recently available data for the circuitry power consumption of the components, we compare the performance of these two HAD architectures with that of the fully-digital (FD) architecture in terms of the total circuitry power consumption, and achieved SE and EE. We find that there is a certain number of users above which the FC architecture has higher circuitry power consumption than the FD counterpart, in contrast to the PC architecture that always has lower circuitry power consumption. More importantly, our results reveal, contrary to the common opinion, that depending on the circuitry parameters the FD architecture may achieve not only higher SE, but also higher EE than the HAD architectures. [ABSTRACT FROM AUTHOR]

Hybrid electric vehicles (HEVs) offer an effective solution for emissions reduction and fuel energy savings. The pursuit of further improvements in their energy efficiency has led to the two fundamental optimization challenges of vehicle speed and powertrain energy management (EM), which are inherently coupled. This paper examines the vehicle speed and powertrain EM co-optimization problem for fuel economy for a series HEV following a prescribed route with expected traveling time. In order to overcome the computational burden of a large scale optimal control problem, this work presents a novel two-step optimal control strategy that suitably separates the co-optimization problem on the basis of involving the characteristics of the HEV powertrain power split and losses in the speed optimization step without an explicit use of a powertrain model. A benchmark method that simultaneously solves the optimal driving speed and the energy source power split is introduced, which is used to show the solution quality of the proposed approach. It is illustrated that the proposed method yields a driving speed solution close to the benchmark method, and additionally it outperforms the benchmark fuel economy, with much higher computational efficiency. The simplicity and effectiveness of the proposed two-step approach make it a practical and implementable EM control strategy. [ABSTRACT FROM AUTHOR]

Transportation electrification is increasing and recently more focus has been directed on heavy vehicles and especially on city buses. Battery electric buses are inherently more energy efficient than diesel buses and the efficiency can be further increased by different methods. This paper evaluates the energy consumption reductions that are achievable with an aluminum chassis, low-drag body, low-rolling-resistance class C tires, heat pump, and predictive driving. A simulation model of a generic electric bus was developed in the Simulink software. Simulations were carried out on various types of driving cycles in cold (−10 °C) and warm conditions (20 °C). A novel nonlinear model predictive control problem formulation was created for minimizing the energy consumption of an electric bus. Using a heat pump instead of an electric heater provided the highest energy savings in the cold conditions with an average consumption reduction of 12.7%. The results indicated that a heat pump is particularly effective on low-speed bus routes. However, the class C tires and aluminum chassis provided higher energy savings than the heat pump in the warm conditions. The low-rolling-resistance tires achieved the most robust energy savings. The aluminum chassis reduced the energy consumption more than the class C tires, but the benefit of the lighter chassis was shown to also correlate strongly with the aggressiveness of the driving. The results showed that a low-drag body is a potential method for consumption reduction on high-speed bus routes. Predictive driving was found to reduce the average consumption by 9.5% at −10 °C when using 10-second prediction and control horizons. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a hybrid mobile cloud/edge computing system with coexistence of centralized cloud and mobile edge computing, which enables computation offloading and data caching to improve the performance of users. Computation offloading and data caching decisions are jointly optimized to minimize the total execution delay at the mobile user side, while satisfying the constrains in terms of the maximum tolerable energy consumption of each user, the computation capability of each MEC server, and the cache capacity of each access point (AP). The formulated problem is non-convex and challenging because of the highly coupled decision variables. To address such an untractable problem, we first transform the original problem into an equivalent convex one by McCormick envelopes and introducing auxiliary variables. To the end, we propose a distributed algorithm based on the alternating direction method of multipliers (ADMM), which can achieve near optimal computation offloading and data caching decisions. The proposed algorithm has lower computational complexity compared to the centralized algorithm. Simulation results are presented to verify that the proposed algorithm can effectively reduce computing delay for end users while ensuring the performance of each user. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the energy-efficient hybrid precoding design for integrated multicast-unicast millimeter wave (mmWave) system, where the simultaneous wireless information and power transform is considered at receivers. We adopt two sparse radio frequency chain antenna structures at the base station (BS), i.e., fully-connected and subarray structures, and design the codebook-based analog precoding according to the different structures. Then, we formulate a joint digital multicast, unicast precoding and power splitting ratio optimization problem to maximize the energy efficiency of the system, while the maximum transmit power at the BS and minimum harvested energy at receivers are considered. Due to its difficulty to directly solve the formulated problem, we equivalently transform the fractional objective function into a subtractive form one and propose a two-loop iterative algorithm to solve it. For the outer loop, the classic Bi-section iterative algorithm is applied. For the inner loop, we transform the formulated problem into a convex one by successive convex approximation techniques and propose an iterative algorithm to solve it. Meanwhile, to reduce the complexity of the inner loop, we develop a zero forcing (ZF) technique-based low complexity iterative algorithm. Specifically, the ZF technique is applied to cancel the inter-unicast interference and the first order Taylor approximation is used for the convexification of the non-convex constraints in the original problem. Finally, simulation results are provided to compare the performance of the proposed algorithms under different schemes. [ABSTRACT FROM AUTHOR]

Load profiles or duty cycles on a powertrain system are one of the major factors that affect the fuel economy of hybrid electric vehicles. Most of optimal power management controllers that are designed for minimum fuel consumption take into account the upcoming duty cycles explicitly or implicitly. Due to this non-causal nature, many optimal algorithms are not implementable in real-time, or they reluctantly assume simple future duty cycles for real-time implementation at the cost of performance. This paper presents an optimal power management controller that uses the predicted near-future duty cycle instead of hypothesized duty cycles. Model predictive control is used for the controller, and a deep neural network is designed for the estimation of the future duty cycle. Signals from a radar sensor and signals from the ego vehicle are used as the input signals for the deep neural network. A model predictive controller with a well-estimated near-future duty cycles showed significantly improved fuel economy than a model predictive controller with simply assumed duty cycles. Even a less accurately estimated future duty cycle helps improve the fuel economy more than a simply assumed future duty cycle does. We observed that some knowledge about the future duty cycle in the model predictive controller is better for improving fuel economy than the simple assumption if the information has the right directional tendency, even if it is not accurate. [ABSTRACT FROM AUTHOR]

The placement of Unmanned Aerial Vehicle (UAV) based aerial Base station (BS) has emerged as a viable solution to the contemplated high traffic demands of the future wireless networks. Nevertheless, the practical realization of UAVs for wireless coverage provisioning demands efficient utilization of its limited onboard energy reserves. This paper studies the power-domain Non-Orthogonal Multiple Access (NOMA) scheme for energy-efficient placement of the UAV-BS. The objective of maximized information bits per unit energy consumption of the UAV-BS is developed assuming a multi-Quality of Service (QoS) scenario. Also, the efficiency analysis is carried out considering the composite of energies consumed for the signal transmission and hover operation of the UAV-BS. The formulated Non-Linear Fractional Problem (NLFP) as a function of transmission power and altitude is solved by employing an alternating optimization technique based on a nested Dinkelbach structure. An investigation into the user pairing scheme also sheds new light on its effect upon the constrained feasible altitude range of the UAV-BS. Consequently, a computationally efficient approach is devised to render solution space based on the identified subset of user pairs. The numerical analyses of the proposed scheme signify a substantial increase in the energy efficiency of the NOMA based UAV-BS in comparison to the baseline scheme of Orthogonal Multiple Access (OMA). Thus, the improved energy efficiency enables enhanced coverage for the UAV-BS. [ABSTRACT FROM AUTHOR]

Demand for mobile data services is increasing exponentially and operators have responded by expanding and upgrading their networks to enhance capacity. One promising technique is to densify the network with low-power and small-coverage base stations (BSs) to provide significant capacity gains. In this paper, we develop a multi-user connectivity model for a Poisson Point Process (PPP)-based homogeneous network to facilitate a realistic study of its energy performance subject to blocking constraints. We then derive the average rate per channel and per user and compute the average sum rate of the network. An area power consumption (APC)-minimization framework is then formulated subject to appropriate coverage and average rate constraints to determine the optimal deployment configuration of BS density and associated transmit power. Furthermore, a new sleep mode mechanism called centralized strategic scheme is analyzed to determine its ability to adapt energy consumption to variable user density. Our results show that sleep mode is a viable solution for managing network energy consumption in dense networks. [ABSTRACT FROM AUTHOR]

This paper investigates the design of a series-parallel hybrid electric powertrain that includes an electric variable transmission (EVT) and two mechanical gears that connect the EVT to the rest of the powertrain. The EVT is implemented as a dual rotor electric machine (EM), which from a design perspective can be studied as two separate EMs. The goal is to optimize the size of the two EMs and the two mechanical gears, while minimizing fuel consumption, subject to performance requirements on top vehicle speed and acceleration time. A practical optimization methodology is proposed that decouples the multi-objective problem into three different control subproblems: a slow dynamic subproblem for fuel economy, a fast dynamic subproblem for acceleration performance and a static optimization subproblem for the top speed performance. Efficient dynamic programming formulations are presented to solve the two dynamic subproblems. Two different scenarios are discussed and analyzed, where the first one presents the influence of the EMs’ sizes on the vehicle performance and the second one delivers near optimal configurations of the EVT powertrain for different gear ratios. A case study is also carried out to compare the sizing results between the proposed method and an existing benchmark method, showing that the two EMs could be reduced by 45% and 11.87% respectively, while powertrain performance could still be maintained at the same level. [ABSTRACT FROM AUTHOR]

Decentralized security function deployment (activation) is an important solution to achieve reliable and secure operations of wireless networks. In this paper, we consider the joint problem of security function activation and traffic routing in a wireless multihop network with the aim of minimizing total energy consumption of all nodes in the network while meeting the security requirements of the users. Firstly, we analyze the tradeoff of energy consumption between preventing security damages with protection functions and remedying it with recovery functions. The analysis takes the uncertainty of attacks and network capacity availability into account. Secondly, if the protection function is to be activated, the activation has to be performed along the route of traffic flows, which means that the traffic routing should also be jointly optimized. Therefore, we formulate this problem as a stochastic optimization model. To obtain the optimal solution, we apply a distributed algorithm, i.e., accelerated distributed augmented Lagrangian algorithm which is ensured to converge. Furthermore, we analytically demonstrate that the solution obtained by the accelerated distributed augmented Lagrangian algorithm is optimal to our stochastic optimization model. Based on the setting from real experiments, the performance evaluation reveals that the optimal solution depends largely on the energy budget and energy consumption of the nodes for transferring traffic and running security functions. [ABSTRACT FROM AUTHOR]

We study the problem of base station (BS) dynamic switching for energy efficient design of fifth-generation (5G) cellular networks and beyond. We formulate this problem as a Markov decision process (MDP) and use an approximation method known as policy rollout to solve it. This method employs Monte Carlo sampling to approximate the Q-value. In this paper, we introduce a novel approach to design an energy-efficient BS control algorithm. We design an MDP-based algorithm to control the on/off switching of BSs in real time; we exploit user mobility and location information in the selection of the optimal control actions. We start our formulation with the simple case of one-user one-ON. We then gradually and systematically extend this formulation to the multi-user multi-ON scenario. Simulation results show the potential of our novel approach of exploiting user mobility information within the MDP framework to achieve significant energy savings while providing quality-of-service guarantees. [ABSTRACT FROM AUTHOR]

This paper presents three energy-efficient power allocation (PA) schemes for the downlink of a distributed multiple-input multiple-output (D-MIMO) system with beamforming at distributed antenna ports and antenna selection (AS) at a mobile station over composite Rayleigh channels. Subject to maximum power constraints, a constrained maximization problem on energy efficiency (EE) is formulated. Based on theoretical analysis, the optimal beamforming is shown to be aligned with the channel direction that renders the joint design problem to be a PA optimization one. It is shown that the optimization problem is strictly pseudo-concave with a unique maximum. Thus, an optimal PA scheme based on a gradient projection method is proposed to obtain the global solution. To speed up the gradient projection method, a closed-form initialization is derived. Furthermore, a low-complexity optimal PA schemes based on the Karush–Kuhn–Tucker conditions is proposed. This optimal scheme has a closed-form PA expression for a certain condition or else computes the PA by the Lambert function or the bisection method, and gives the same EE performance as that of the optimal gradient-based scheme. The performances of these two optimal schemes are optimal and verified to be valid in contrast to the inaccurate optimal scheme in the literature. For large maximum power, the closed-form initial PA will become the optimal solution and can be considered as a suboptimal solution with no iterative computation. Making use of the tight upper and lower bounds of the Lambert function, a very low-complexity suboptimal PA scheme is developed. Simulation results show that the proposed suboptimal scheme can achieve nearly optimal performance. Maximum EE and maximum channel power, which are optimal and suboptimal criteria, are adopted for antenna selection. The simple suboptimal criterion can provide EE performance very close to that of the optimal one. The D-MIMO with AS is shown to give considerable EE gain over the single receive antenna system. Moreover, the proposed three PA schemes can be used for multiuser diversity D-MIMO systems to achieve superior EE performance. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the beamformer design of the energy-efficient downlink multicast cloud radio access network (C-RAN) with the compression and data-sharing strategies, respectively. With the imperfect channel state information, we aim to maximize the worst-case energy efficiency (EE), which is defined as the ratio of the sum of worst-case group rates to the total power consumption of the network. The formulated problems for both strategies are non-convex and challenging to solve. In order to find the solutions, we develop a two-layer iterative algorithm that recast the formulated problems as a series of convex quadratic matrix inequality problems which can be solved by the generated Augmented Lagrangian method. The convergence of the proposed algorithms is proved via both analytical and simulated ways, and the effectiveness of them on improving EE is also validated. Moreover, through the comparison of the two transmission strategies considered, we find that the compression strategy can achieve higher worst-case EE than the data-sharing strategy in most scenarios, except for the case with low rate requirement in small-size network. Our conclusions can be used as meaningful references for the practical system design. [ABSTRACT FROM AUTHOR]

In this paper, we consider a generalized sub-array-connected (GSAC) architecture for arbitrary radio frequency (RF) chain and antenna configurations, where the number of RF chains connected to a sub-array and the number of antennas in each sub-array can be arbitrary. Our design objective is to improve the energy efficiency of the hybrid precoder of millimeter-wave massive multiple input multiple output systems. We first propose a successive interference cancellation based hybrid precoding algorithm to maximize the achievable rate for any given RF chain and antenna configuration. This algorithm first decomposes the total achievable rate optimization problem into multiple sub-rate optimization problems, then it successively maximizes these sub-rates. Since the number of RF chains is limited, we can afford using an exhaustive search scheme to evaluate all configurations and identify the one having the best energy efficiency. Moreover, to rely on an attractive limited feedback, we also propose a beamsteering codebook for our hybrid precoding aided GSAC architecture. Our simulation results demonstrate that the proposed scheme achieves a similar rate as the corresponding optimal unconstrained precoder. Furthermore, we show that the energy efficiency of the proposed scheme is better than that of the existing schemes in the fully connected and sub-array-connected architectures. [ABSTRACT FROM AUTHOR]

This paper examines the problem of predictive gear scheduling for fuel consumption minimization in connected/automated heavy trucks. The literature highlights the fuel economy benefits of such predictive scheduling, but there is a need to optimize such scheduling online, in real time. To address this need, we begin by using dynamic programming (DP) to schedule gear shifting offline, in a manner that achieves a globally optimal Pareto tradeoff between the conflicting objectives of minimizing fuel consumption and shift frequency. The computational cost of DP is unfavorable for online implementation, but we present two algorithms addressing this challenge. Both algorithms rely on the fact that in the Pareto limit where fuel consumption minimization is the sole objective, DP furnishes a simple static shift map. Our first algorithm trains a recurrent neural network to prune the shift schedule generated by this map. The second algorithm performs this pruning in a direct manner tailored to reduce the schedule's rain flow count. We simulate these algorithms for different drive cycles. Both algorithms achieve a reasonable tradeoff between fuel consumption and gear shift frequency. However, the rain flow count algorithm is both more effective in approaching the DP-based Pareto front and more computationally efficient. [ABSTRACT FROM AUTHOR]

Recently, the concept of network virtualization and network slicing attracted significant attention from both industry and academia as a key component of the evolving 5G architecture to allow the efficient entrance of vertical industries and tackle increased aggregate traffic by flexible network re-configurability. However, the potential price to be paid for facilitating network slicing in a multi-tenant virtual network is the underutilization of the scarce wireless network resources due to the different tenant requirements and the inherent dynamics of the traffic. A potential way to avoid such sacrifice of radio resources is to allow efficient inter-tenant resource sharing. To this end, this paper proposes a novel optimization framework for flexible inter-tenant resource sharing embedded with transmission power control to aggressively improve network capacity, the utilization of wireless access resources, user data rate as well as energy efficiency. More specifically, we define two novel resource sharing mechanisms called tight coupling and loose coupling, respectively, via mixed integer linear programming formulations. Furthermore, two resource and power joint allocation algorithms are designed to solve the optimization problem in polynomial time. Based on 3GPP network parameterization, a rigorous analysis via a wide set of numerical investigations reveal that significant gains in network throughput, individual user rate, and energy efficiency can be achieved compared with current baseline network slicing methods and constant power resource sharing algorithms. [ABSTRACT FROM AUTHOR]

This paper addresses energy efficiency (EE) optimization problems for uplink multiuser multiple-input–multiple-output (MIMO) systems with zero-forcing (ZF) transceivers, subject to a joint power and rate constraint for each user. As the optimization problem considered in this paper is quite different from the traditional one, directly applying the Dinkelbach method to the new EE optimization problem cannot bring an advantage of low complexity. Hence, we try to propose a novel approach inspired by the homotopy algorithms, where we concentrate our attention on the solution path for the EE optimization. Making use of the piecewise-defined property between power allocations and the overall transmission power, we fit the entire path of solution for every value of the overall transmission power by replacing the search variable with a specially selected parameter. By checking only a finite number of breakpoints, we then try to propose a new homotopy-type algorithm to obtain the maximum EE in an exact closed form to reduce the computational complexity significantly. Simulation results verify the performance of the new method. [ABSTRACT FROM PUBLISHER]

Based on a hierarchical cloud-fog computing-enabled paradigm, fog radio access networks (F-RANs) can provide abundant resource to support the future mobile artificial intelligent services. However, due to the differences of computation and communication capabilities at the cloud computing center, the fog computing based access points (F-APs), and the user devices, it is challenging to propose efficient computation offloading strategies to fully explore the potential of F-RANs. In this paper, we study the design of computation offloading in F-RANs to minimize the total cost with respect to the energy consumption and the offloading latency. In particular, a joint optimization problem is formulated to optimize the offloading decision, the computation and the radio resources allocation. To solve this non-linear and non-convex problem, an iterative algorithm is designed, which can be proved to converge a stationary optimal solution with polynomial computational complexity. Finally, the simulation results are provided to show the performance gains of our proposed joint optimization algorithm. [ABSTRACT FROM AUTHOR]

We consider the energy-efficient mobility-aware content caching problem with clustered small cells (SCs) in ultra-dense networks (UDNs). The UDN is regarded as one of the key solutions to overcome the explosive growth of mobile data traffic and consequential energy consumption. In addition, caching the popular contents at the edge of UDNs can further mitigate the challenges of traffic and energy. In this paper, we group the SCs into disjoint clusters and model the mobility of users between clusters as a Markov chain. We formulate the caching problem aimed at minimizing the overall energy consumption for content delivery to the moving users. Then we decompose the complicated task of energy consumption optimization in cache-enabled UDNs into two sub-problems. In the first sub-problem, we formulate the inter-cluster caching problem as minimizing the energy consumption for serving a user request by the macro base station. We show that the first sub-problem is NP-hard, and develop a polynomial-heuristic algorithm. Further, we define the mobility-oblivious version of the sub-problem, and provide a ${\textstyle {1 \over {2k }}}$ -approximation solution for the mobility-aware based on this mobility-oblivious version. In the second sub-problem, we consider the heterogeneity of small cells and define the intra-cluster caching problem. The aim of this sub-problem is the placement of content in different SCs within the cluster so that the energy consumption for the content delivery in that cluster is minimized. In particular, the second sub-problem fits the general framework of the generalized assignment problem, which allows us to exploit its rich literature, to determine the optimal solution for our problem. Through extensive simulations based on real wireless data and human mobility patterns, we demonstrate the benefits of our approach that is even up to 56% better compared to the conventional caching schemes. [ABSTRACT FROM AUTHOR]

In this correspondence paper, an unmanned aerial vehicle (UAV) enabled mobile-edge computing (MEC) server is considered to provide MEC services for multiple ground users by employing a time-division multiple access protocol. Our objective is to solve the joint optimization problem of UAV position, time slot allocation, and computation task partition, which minimizes the system energy consumption of all users while ensuring the successful task computation of all users during a time block. We propose a globally optimal solution, which is found by two-dimensional search over possible UAV positions. In each search, we theoretically derive the semi-closed-form solution to the joint optimization of time slot allocation and computation task partition by employing augmented Lagrangian active set method. An alternating optimization scheme to find the locally optimal solution is also proposed. It is shown through numerical results that our proposed schemes are superior to the no offloading, full offloading, and gravity center offloading schemes. [ABSTRACT FROM AUTHOR]

Operation optimization for modern subway trains usually requires the speed curve optimization and speed curve tracking simultaneously. For the speed curve optimization, a multi-objective seeking issue should be addressed by considering the requirements of energy saving, punctuality, accurate parking, and comfortableness at the same time. But most traditional searching methods lack in efficiency or tend to fall into the local optimum. For the speed curve tracking, the widely applied proportional integral differential (PID) and fuzzy controllers rely on complicated parameter tuning, whereas robust adaptive methods can hardly ensure the finite-time convergence strictly, and thus are not suitable for applications in fixed time intervals of trains. To address the above-mentioned two problems, this paper presents a novel approach for speed curve seeking and tracking control. First, we present the random reinforcement genetic algorithm (GA) algorithm to avoid the local optimum efficiently. Then, a sliding mode controller is developed for speed curve tracking with bounded disturbance. The Lyapunov theory is adopted to prove that the system can be stabilized in the finite time. Finally, using the real datasets of Yizhuang Line in Beijing Subway, the proposed approach is validated, demonstrating its effectiveness and superiorities for the operation optimization. [ABSTRACT FROM AUTHOR]

Caching at base stations (BSs) can enhance the performance of a mobile network, which has gained much attention in the past few years. In this paper, we investigate the energy-saving issue in the cache-enabled mobile network, where we try to minimize the total system power consumption with limited radio resource and storage capacity of the BSs. We decouple the formulated difficult optimization task into a series of tractable subproblems and develop efficient algorithms to solve them with reasonable computation load. The key idea of our proposed scheme is to associate as many as possible users with the BSs that have stored the users’ requested files in their caches while considering the spectrum and power budgets of the BSs. Numerical results show our proposed scheme can significantly reduce the system power consumption compared with others. [ABSTRACT FROM AUTHOR]

In this paper we investigate energy-optimized wireless video transmission employing a hybrid automatic repeat request. We formulate the problem as maximizing the video quality, subject to a constraint on the wireless transmission energy consumption. We consider multiple parameters in multiple layers in a wireless video transmission system: transmit power, alphabet size, FEC code rate, maximum number of transmissions, and unequal video data importance. An analytical framework is proposed to include these parameters, which allows us to divide this problem into two sub-problems: data transmission and unequal error protection. The problem is tackled by solving the two sub-problems, which are done by exhaustive search and convex optimization, respectively. Simulations of different videos show that the proposed scheme outperforms methods using conventional data transmission and/or unequal error protection. [ABSTRACT FROM AUTHOR]

In vehicular networks, in-vehicle user equipment (UE) with limited battery capacity can achieve opportunistic energy saving by offloading energy-hungry workloads to vehicular edge computing nodes via vehicle-to-infrastructure links. However, how to determine the optimal portion of workload to be offloaded based on the dynamic states of energy consumption and latency in local computing, data transmission, workload execution and handover, is still an open issue. In this paper, we study the energy-efficient workload offloading problem and propose a low-complexity distributed solution based on consensus alternating direction method of multipliers. By incorporating a set of local variables for each UE, the original problem, in which the optimization variables of UEs are coupled together, is transformed into an equivalent general consensus problem with separable objectives and constraints. The consensus problem can be further decomposed into a bunch of subproblems, which are distributed across UEs and solved in parallel simultaneously. Finally, the proposed solution is validated based on a realistic road topology of Beijing, China. Simulation results have demonstrated that significant energy saving gain can be achieved by the proposed algorithm. [ABSTRACT FROM AUTHOR]

For the online energy optimization problem of plug-in hybrid electric vehicles (P-HEVs), this paper proposes a heuristic dynamic programming (HDP) based online energy management strategy, to minimize the fuel consumption of the P-HEV. First of all, considering the uncertain nonlinear dynamic process of a vehicle in the actual traffic environment, we adopt the back propagation neural network (BPNN) to construct the dynamic model of the P-HEV. Then, on this basis, we utilize the HDP to establish an energy management controller with the aim of minimizing energy consumption of the P-HEV. Moreover, the energy management controller is implemented by an online energy management strategy algorithm. To verify the effect of the controller, we employ a practical route in Beijing road network to simulate the BPNN model of the P-HEV and the proposed energy management strategy. The experimental results show several advantages of our strategy. First, compared to the analytic model, the BPNN model can reflect the real dynamic process of the P-HEV with a higher precision. Second, the assigned torques by the strategy can effectively make the vehicle track the desired vehicle-speeds, and the tracking accuracy of the vehicle-speed is higher than 98%. Besides, on the premise of ensuring the real-time performance, the proposed strategy can further reduce the fuel consumption and emissions of the P-HEV when compared with the existing online energy management strategies, although its fuel consumption is more than that of the offline global optimization energy management strategy by 4% approximately. [ABSTRACT FROM AUTHOR]

Edge caching is being explored as a promising technology to alleviate the network burden of cellular networks by separating the computing functionalities away from cellular base stations. However, the service capability of existing caching scheme is limited by fixed edge infrastructure when facing the uncertainties of users’ requests and locations. The vehicular caching, which uses the moving vehicles as cache carriers, is regarded as an efficient method to solve the above problem. This paper studies the effectiveness of vehicular caching scheme in content centric networks by developing optimization model toward the minimization of network energy consumption. Particularly, we model the interactions between caching vehicles and mobile users as a two-dimensional Markov process, in order to characterize the network availability of mobile users. Based on the developed model, we propose an online vehicular caching design by optimizing network energy efficiency. Specifically, the problem of caching decision making is first formulated as a fractional optimization model, toward the optimal energy efficiency. Using nonlinear fractional programing technology and Lyapunov optimization theory, we derive the theoretical solution for the optimization model. An online caching algorithm to enable the optimal vehicular caching is developed based on the solution. Finally, extensive simulations are conducted to examine the performance of our proposal. On comparison, our online caching scheme outperforms the existing scheme in terms of energy efficiency, hit ratio, cache utilization, and system gain. [ABSTRACT FROM AUTHOR]

This paper studies energy management in a smart grid-powered cellular network consisting of an independent system operator (ISO) and multiple geographically distributed aggregators. The aggregators have energy storage devices and can purchase energy from the electric grid via the ISO to serve their users. To account for the uncertainty of the renewable energy supply as well as the impacts of multiple aggregators on the electric grid and energy prices, a foresighted strategy combined with the adaptive $\epsilon$ -greedy method is developed for the aggregators to distributively and adaptively minimize the long-term overall cost of the system, based on the ahead-of-time decision making of the storage pre-charging amount. Simulation results validate that the proposed strategy surpasses a recent learning-based storage management design and a myopic design. [ABSTRACT FROM AUTHOR]

Compared with energy storage equipment based on supercapacitors, flywheels, or lithium batteries, inverters have obvious advantages in installation space, cost, reliability, and service lifetime. For this reason, regenerative inverters are increasingly installed in the substations of urban rail transit systems. They have controllable operating characteristics, but their impact on the energy saving and railway operation cost has not been fully studied. In this paper, based on the typical application scheme of regenerative inverters, the operating characteristics of the inverter including power limitation, start working voltage, and virtual internal resistance are introduced at first. A simplified power system model containing regenerative inverters and trains has been built. The impact of operating characteristics on the amount of regenerative braking energy and its distribution is analyzed. The inverter operating characteristics are optimized by a cost function considering total energy consumption, brake shoes wear, and inverter expense. A case study based on a multiple-train scenario is presented to validate the cost-saving performance. The work is expected to provide some guides for the design and optimization of the traction power supply system with inverting substations. [ABSTRACT FROM AUTHOR]

Vehicular fog computing (VFC) has emerged as a promising solution to relieve the overload on the base station and reduce the processing delay during the peak time. The computation tasks can be offloaded from the base station to vehicular fog nodes by leveraging the under-utilized computation resources of nearby vehicles. However, the wide-area deployment of VFC still confronts several critical challenges, such as the lack of efficient incentive and task assignment mechanisms. In this paper, we address the above challenges and provide a solution to minimize the network delay from a contract-matching integration perspective. First, we propose an efficient incentive mechanism based on contract theoretical modeling. The contract is tailored for the unique characteristic of each vehicle type to maximize the expected utility of the base station. Next, we transform the task assignment problem into a two-sided matching problem between vehicles and user equipment. The formulated problem is solved by a pricing-based stable matching algorithm, which iteratively carries out the “propose” and “price-rising” procedures to derive a stable matching based on the dynamically updated preference lists. Finally, numerical results demonstrate that significant performance improvement can be achieved by the proposed scheme. [ABSTRACT FROM AUTHOR]

The deployment of cloud and edge computing forms a three-tier mobile computing network, where each task can be processed locally, by the edge nodes, or by the remote cloud server. In this paper, we consider a cooperative three-tier computing network by leveraging the vertical cooperation among devices, edge nodes and cloud servers, as well as the horizontal cooperation between edge nodes. In this network, we jointly optimize the offloading decision and the computation resource allocation to minimize the average task duration subject to the limited battery capacity of devices. However, the formulated problem is a large-scale mixed integer non-linear optimization problem with the growing number of base stations and devices, which is NP-hard in general. To develop an efficient offloading scheme with low complexity, we conduct a series of reformulation based on reformulation linearization technology and further propose a parallel optimization framework by utilizing alternating direction method of multipliers (ADMM) method and difference of convex functions (D.C.) programming. The proposed scheme decomposes the large-scale problem into some smaller subproblems, which are done across the multiple computation units in a parallel fashion to speed up the computation process. Simulation results demonstrate that the proposed scheme can obtain a near-optimal performance with low complexity, and can reduce up to 24% of the task duration compared with other schemes. Simulation also shows how much the vertical and horizontal computation cooperations affect the system performance under different network parameters. [ABSTRACT FROM AUTHOR]

Consider single-cell downlink vehicular networks, where a base station (BS) employing massive multiple-input multiple-output simultaneously transmits information to multiple vehicles on its covered road. Taking into account both the traffic and communication performance, the Flow rate of vehicles to the Power consumption of the BS Ratio (FPR) is defined as a comprehensive metric to represent the number of vehicles supported under limited transmit power. The objective of this paper is to maximize the FPR while guaranteeing the information rate requirements of the vehicles. We first derive the average power consumption of the BS with respect to vehicle density, based on which the FPR is established by using a flow rate function that quantifies the number of passed vehicles per time unit in terms of traffic density. Then, the optimal vehicle density is given in order to maximize the FPR. Simulation results indicate that the proposed scheme can significantly improve the power efficiency of the vehicular networks. [ABSTRACT FROM AUTHOR]

The proliferation of smart vehicular terminals (VTs) and their resource hungry applications impose serious challenges to the processing capabilities of VTs and the delivery of vehicular services. Mobile Edge Computing (MEC) offers a promising paradigm to solve this problem by offloading VT applications to proximal MEC servers, while TV white space (TVWS) bands can be used to supplement the bandwidth for computation offloading. In this paper, we consider a cognitive vehicular network that uses the TVWS band, and formulate a dual-side optimization problem, to minimize the cost of VTs and that of the MEC server at the same time. Specifically, the dual-side cost minimization is achieved by jointly optimizing the offloading decision and local CPU frequency on the VT side, and the radio resource allocation and server provisioning on the server side, while guaranteeing network stability. Based on Lyapunov optimization, we design an algorithm called DDORV to tackle the joint optimization problem, where only current system states, such as channel states and traffic arrivals, are needed. The closed-form solution to the VT-side problem is obtained easily by derivation and comparing two values. For MEC server side optimization, we first obtain server provisioning independently, and then devise a continuous relaxation and Lagrangian dual decomposition based iterative algorithm for joint radio resource and power allocation. Simulation results demonstrate that DDORV converges fast, can balance the cost-delay tradeoff flexibly, and can obtain more performance gains in cost reduction as compared with existing schemes. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) has been considered as a key technology in the fifth-generation mobile communication networks due to its superior spectrum efficiency. Since the heterogeneous network has been emerged to satisfy users’ explosive data rate requirements and large connectivity of mobile Internet, implementing NOMA policy in heterogeneous networks (HetNets) has become an inevitable trend to enhance the 5G system throughput and spectrum efficiency. In this paper, we aim to maximize the entire system energy efficiency, including the macrocell and small cells, in a NOMA HetNet via subchannel allocation and power allocation. By considering the co-channel interference and cross-tier interference, the energy efficient resource allocation problem is formulated as a mixed integer nonconvex optimization problem. It is challenging to obtain the optimal solution; therefore, a suboptimal algorithm is proposed to alternatively optimize the macrocell and the small cells resource allocation. Specifically, convex relaxation and dual-decomposition techniques are exploited to optimize the subchannel allocation and power allocation. Moreover, optimal closed-form power allocation expressions are derived for small cell and macrocell user equipments by the Lagrangian approach. Simulations results show that the proposed algorithms can converge within ten iterations and can also attain higher system energy efficiency than the reference schemes. [ABSTRACT FROM AUTHOR]

Energy efficient resource allocation in heterogeneous cloud radio access networks (H-CRANs) is considered in this paper where a set of users within a specific region is served by femto-cell access points (FAPs) and remote radio heads (RRHs) connected to the base-band unit (BBU) pool through front-haul links. For orthogonal frequency division multiple access (OFDMA) based uplink H-CRANs, we formulate an energy efficient optimization problem with the novel utility function in order to jointly assign the access point (RRH/FAP), sub-carrier, transmit power, RRH, front-haul link and BBU. Due to highly complex relation between diverse optimization variables and their effects on each other, the formulated optimization problem is non-convex and NP-hard, suffering from high computational complexity. To tackle this issue, we develop an efficient two-step iterative algorithm with low computational complexity to solve the proposed problem based on the successive convex approximation (SCA) and complementary geometric programming (CGP). The simulation results reveal that our proposed approach can effectively offload the traffic from C-RAN to low-power femto-cells, and reduce the energy consumption cost by switching off the under-utilized BBUs. [ABSTRACT FROM AUTHOR]

Path planning is a critical issue to ensure the safety and reliability of the autonomous navigation system of the autonomous underwater vehicles (AUVs). Due to the nonlinearity and constraint issues, existing algorithms perform unsatisfactorily or even cannot find a feasible solution when facing large-scale problem spaces. This paper improves the path planning of AUVs in terms of both the path planning model and the optimization algorithm. The proposed model is comprehensive, which aggregates the length, energy consumption, and collision risk into the objective function and incorporates the steering window constraint. Based on the model, we develop a nature-inspired ant colony optimization algorithm to search the optimal path. Our algorithm is named alarm pheromone-assisted ant colony system (AP-ACS), since it incorporates the alarm pheromone in addition to the traditional guiding pheromone. The alarm pheromone alerts the ants to infeasible areas, which saves invalid search efforts and, thus, improves the search efficiency. Meanwhile, three heuristic measures are specifically designed to provide additional knowledge to the ants for path planning. In the experiments, different from the previous works that are tested on synthetic instances only, we implement an interface to retrieve the practical underwater environment data. AP-ACS and the compared algorithms are thus tested on several practical environments of different scales. The experimental results show that AP-ACS can effectively handle the constraints and outperforms the other algorithms in terms of accuracy, efficiency, and stability. [ABSTRACT FROM AUTHOR]