• Energy Research

The increasing demand for wireless services has led to a severe energy consumption problem with the rising of greenhouse gas emission. While the renewable energy can somehow alleviate this problem, the routing, flow rate, and power still have to be well investigated with the objective of minimizing energy consumption in multi-hop energy renewable wireless mesh networks (ER-WMNs). This paper formulates the problem of network-wide energy consumption minimization under the network throughput constraint as a mixed-integer nonlinear programming problem by jointly optimizing routing, rate control, and power allocation. Moreover, the min-max fairness model is applied to address the fairness issue because the uneven routing problem may incur the sharp reduction of network performance in multi-hop ER-WMNs. Due to the high computational complexity of the formulated mathematical programming problem, an energy-aware multi-path routing algorithm (EARA) is also proposed to deal with the joint control of routing, flow rate, and power allocation in practical multi-hop WMNs. To search the optimal routing, it applies a weighted Dijkstra's shortest path algorithm, where the weight is defined as a function of the power consumption and residual energy of a node. Extensive simulation results are presented to show the performance of the proposed schemes and the effects of energy replenishment rate and network throughput on the network lifetime.

With the proliferation of mobile devices (e.g., vehicles and smartphones), rich media content services from massive users lead to high network resource consumption and energy usage. How to effectively allocate heterogeneous network resources and achieve green content delivery is a major challenge to be addressed in urgency, especially when vehicular users are involved and the spatiotemporal distribution of the content requests can change drastically. In this paper, we propose a new deep reinforcement learning (DRL)-aided task offloading and resource allocation scheme, named TORA-DRL, to minimize power consumption in cloud-edge cooperation environments, where in-network caching and request aggregation are incorporated to reduce replicated transmissions of network contents. Based on the history of content requests and available network resources in the system, TORA-DRL jointly optimizes the decisions about task offloading, as well as computing, caching and communication resource allocation, adapting to the changes in network states and user requirements. Simulation results demonstrate that the proposed TORA-DRL solution converges fast and has much higher energy efficiency than the existing popular cloud-edge cooperation schemes under different network environments. IEEE

Energy efficiency is important for smartphones because they are powered by batteries with limited capacity. Existing work has shown that the tail energy of the third-generation (3G)/fourth-generation (4G) network interface on a mobile device would lead to low energy efficiency. To solve the tail energy minimization problem, some online scheduling algorithms have been proposed, but with a big gap from the offline algorithms that work depending on the knowledge of future transmissions. In this paper, we study the tail energy minimization problem by exploiting the techniques of machine learning and participatory sensing. We design a client–server architecture, in which the training process is conducted in a server, and mobile devices download the constructed predictor from the server to make transmission decisions. A system is developed and deployed on real hardware to evaluate the performance of our proposal. The experimental results show that it can significantly improve the energy efficiency of mobile devices while incurring minimum overhead.

Satellite-based communication technology has gained much attention in the past few years, where satellites play mainly the supplementary roles as relay devices to terrestrial communication networks. Unlike previous work, we treat the low-earth-orbit (LEO) satellites as secure data storage mediums. We focus on data acquisition from a LEO satellite based data storage system (also referred to as the LEO based datacenters), which has been considered as a promising and secure paradigm on data storage. Under the LEO based datacenter architecture, one fundamental challenge is to deal with energy-efficient downloading from space to ground while maintaining the system stability. In this paper, we aim to maximize the amount of data admitted while minimizing the energy consumption, when downloading files from LEO based datacenters to meet user demands. To this end, we first formulate a novel optimization problem and develop an online scheduling framework. We then devise a novel coflow-like “Join the first $K$ K -shortest Queues (JKQ)” based job-dispatch strategy, which can significantly lower backlogs of queues residing in LEO satellites, thereby improving the system stability. We also analyze the optimality of the proposed approach and system stability. We finally evaluate the performance of the proposed algorithm through conducting emulator based simulations, based on real-world LEO constellation and user demand traces. The simulation results show that the proposed algorithm can dramatically lower the queue backlogs and achieve high energy efficiency.

The fast development of mobile computing has raised ever-increasing diverse communication needs in wireless networks. To catch up with such needs, cloud radio access networks (CRAN) is proposed to enable efficient radio resource sharing and management. At the same time, the massive deployment of radio access networks has caused huge energy consumption. Incorporating renewable green energy to lower the brown energy consumption also has become a widely concerned topic. In this paper, we are motivated to investigate a green energy aware remote radio head activation problem for coordinated multipoint communications in green energy powered CRAN, aiming at minimizing the network brown energy power consumption. The problem is first formulated into a nonconvex optimization form. By analyzing the characteristics of the formulation, we further propose a heuristic algorithm based on an ordered selection method. Extensive simulation based experiment results show that the proposed green energy aware algorithm provides an effective way to reduce brown energy power consumption, well fitting the goal of developing green communications.

In this letter, we give a cloud-based satellite communication network (C-SCN) architecture to make full utilization of resources in current satellite systems. Since the complex computation and transmission bring huge energy cost, energy minimization is one of the most important problems in the C-SCN. Considering that the energy minimization problem is involved with the delay constraint, we decompose the original problem into two coupling subproblems, virtual machine assignment and power allocation, and then propose a joint optimization algorithm to solve the subproblems. Our simulation results show that the proposed algorithm is superior to the existing algorithms on energy efficiency in the C-SCN.

Wireless Powered Mobile Edge Computing (WPMEC) is an integration of Mobile Edge Computing (MEC) and Wireless Power Transfer (WPT) technologies, to both improve computing capabilities of mobile devices and energy compensation for their limited battery capabilities. Generally, energy transmitters, mobile devices, and edge servers form a WPMEC system that realizes a closed loop of sending and collecting energy as well as offloading and receiving task data. Due to constraints of time-varying network environments, time-coupled battery levels, and the half-duplex character of mobile devices, the joint design of computation offloading and resource allocation solutions in WPMEC systems has become extremely challenging, and a great number of studies have been devoted to it in recent years. In this article, we first introduce the basic model of the WPMEC system. Then, we present key issues and techniques related to WPMEC. In addition, we summarize solutions for computation offloading and resource allocation to solve critical issues in WPMEC networks. Finally, we discuss some research challenges and open issues.

The fuel cell is a promising power source for green data centers due to its high energy efficiency, low carbon emissions, and high reliability. However, because of the mechanical limitations related to fuel delivery, fuel cells are slow in adjusting power output when the energy demand quickly changes, which is called limited load following . Many recent work have studied to mitigate the limited load following by using energy storage to adjust energy supply, but achieves limited successes because of the constraint of energy storage size. In this paper, we address this challenge by changing both energy supply and demand, via joint workload scheduling and energy management. Specifically, we consider multiple geo-distributed data centers powered by both fuel cells and energy storage. An online algorithm has been proposed to minimize the gap between energy supply and demand by jointly managing the fuel cells output and migrating workloads among data centers. Simulations results based on real-world traces show that the proposed algorithms can achieve satisfactory performance.

In order to understand the message dissemination performance in delay-tolerant networks, much analysis work has been proposed in literature. However, existing work shares a common simplification that the pairwise inter-meeting time between any two mobile nodes is exponentially distributed. Not mention the fact that such assumption is only an approximation, it cannot be applied by network planners to directly control the mobile nodes for any network optimization, e.g., energy efficiency. It is quite significant to study the relationship between the network performance with the parameters that can be adjusted directly to tackle the limitations of current exponential distribution assumption based analysis. Therefore, in this paper, we are motivated to jointly consider the transmission range and messages residence time to stochastically analyze deadline-constrained message delivery ratio utilizing a controlled epidemic routing. The message propagation is considered as an age-structure process and described by a susceptible---infectious---recovered model, which is then analyzed using delay differential equations. Since both the transmission range and the message residence time are related to the mobile nodes' energy consumption, we further apply our analysis framework to investigate the tradeoff between the energy consumption and the achievable message delivery ratio. The correctness and accuracy of our analysis are validated by extensive simulations.