We present our Zero Energy Network'' (ZEN) protocol stack for energy harvesting wireless sensor networks applications. The novelty in our work is @math fold: (1) Energy harvesting aware fully featured MAC layer. Carrier sensing, Backoff algorithms, ARQ, RTS CTS mechanisms, Adaptive Duty Cycling are either auto configurable or available as tunable parameters to match the available energy (b) Energy harvesting aware Routing Protocol. The multi-hop network establishes routes to the base station using a modified version of AODVjr routing protocol assisted by energy predictions. (c) Application of a time series called Holt-Winters'' for predicting the incoming energy. (d) A distributed smart application running over the ZEN stack which utilizes a multi parameter optimized perturbation technique to optimally use the available energy. The application is capable of programming the ZEN stack in an energy efficient manner. The energy harvested distributed smart application runs on a realistic solar energy trace with a three year seasonality database. We implement a smart application, capable of modifying itself to suit its own as well as the network's energy level. Our analytical results show a close match with the measurements conducted over EHWSN testbed.
Several optimization techniques have been discussed in literature for battery driven multihop WSN's in the past where the objective is to maximize the network lifetime by minimizing energy consumption @cite_21 , @cite_7 . With a view on utilizing the harvested energy in an optimized manner, adapting the performance of an application while respecting the limited and time-varying amount of available power in EHWSN is discussed in @cite_23 . A formal model that actively adapts application parameters such as rate of sensing'' is used to optimize the performance. The simulation study does not consider network related parameters or network wide energy levels. A Lazy Scheduling Algorithm'' is proposed and tested for its effectiveness by assigning several power values to the system in @cite_11 . Task admittance and future energy prediction is carried out with energy variability characterization curves generated by modeling the power source.
@cite_21 @cite_23 @cite_7 @cite_11
2015548556 2142218074 2162986857
Traditional wireless sensor networks (WSNs) face the problem of a limited-energy source, typically batteries, resulting in the need for careful and effective utilization of the energy source. However, inevitable energy depletion will eventually disturb the operation of a WSN. Energy harvesting (EH) technology is acquiring particular interest, because it has the potential to provide a continuous energy supply in battery-powered WSNs. Solar energy is the most effective environmental energy for EH-WSNs because of its high energy intensity, which comes from a non-controllable source. Therefore, the prediction of future energy availability is a critical issue, as the amount of the harvestable energy may vary over time. In this paper, a novel solar energy prediction algorithm with Q-learning, called Q-learning-based solar energy prediction (QL-SEP), is proposed. Q-learning is an effective way of predicting future actions based on past observations. The distinctive feature of QL-SEP is that not only past days’ observations but also the current weather conditions are considered for prediction. The performance of QL-SEP is simulated in this paper using real-world measurements obtained from a solar panel in comparison with the state-of-art approaches. Power management is an important concern in sensor networks, because a tethered energy infrastructure is usually not available and an obvious concern is to use the available battery energy efficiently. However, in some of the sensor networking applications, an additional facility is available to ameliorate the energy problem: harvesting energy from the environment. Certain considerations in using an energy harvesting source are fundamentally different from that in using a battery, because, rather than a limit on the maximum energy, it has a limit on the maximum rate at which the energy can be used. Further, the harvested energy availability typically varies with time in a nondeterministic manner. While a deterministic metric, such as residual battery, suffices to characterize the energy availability in the case of batteries, a more sophisticated characterization may be required for a harvesting source. Another issue that becomes important in networked systems with multiple harvesting nodes is that different nodes may have different harvesting opportunity. In a distributed application, the same end-user performance may be achieved using different workload allocations, and resultant energy consumptions at multiple nodes. In this case, it is important to align the workload allocation with the energy availability at the harvesting nodes. We consider the above issues in power management for energy-harvesting sensor networks. We develop abstractions to characterize the complex time varying nature of such sources with analytically tractable models and use them to address key design issues. We also develop distributed methods to efficiently use harvested energy and test these both in simulation and experimentally on an energy-harvesting sensor network, prototyped for this work. Energy harvesting has recently emerged as a feasible option to increase the operating time of sensor networks. If each node of the network, however, is powered by a fluctuating energy source, common power management solutions have to be reconceived. This holds in particular if real-time responsiveness of a given application has to be guaranteed. Task scheduling at the single nodes should account for the properties of the energy source, capacity of the energy storage as well as deadlines of the single tasks. We show that conventional scheduling algorithms (like e.g. EDF) are not suitable for this scenario. Based on this motivation, we have constructed optimal scheduling algorithms that jointly handle constraints from both energy and time domain. Further we present an admittance test that decides for arbitrary task sets, whether they can be scheduled without deadline violations. To this end, we introduce the concept of energy variability characterization curves (EVCC) which nicely captures the dynamics of various energy sources. Simulation results show that our algorithms allow significant reductions of the battery size compared to Earliest Deadline First scheduling. Recently, there has been a substantial interest in the design of systems that receive their energy from regenerative sources such as solar cells. In contrast to approaches that minimize the power consumption subject to performance constraints, we are concerned with optimizing the performance of an application while respecting the limited and time-varying amount of available power. In this paper, we address power management of, e.g., wireless sensor nodes which receive their energy from solar cells. Based on a prediction of the future available energy, we adapt parameters of the application in order to maximize the utility in a long-term perspective. The paper presents a formal model of the corresponding optimization problem including constraints concerning buffer sizes, timing, and rates. Instead of solving the optimization problem online which may be prohibitively complex in terms of running time and energy consumption, we apply multiparametric programming to precompute the application parameters offline for different environmental conditions and system states. In order to guarantee sustainable operation, we propose a hierarchical software design which comprises a worst-case prediction of the incoming energy. As a further contribution, we suggest a new method for approximate multiparametric linear programming which substantially lowers the computational demand and memory requirement of the embedded software. Our approaches are evaluated using long-term measurements of solar energy in an outdoor environment. Sensor networks with battery-powered nodes can seldom simultaneously meet the design goals of lifetime, cost, sensing reliability and sensing and transmission coverage. Energy-harvesting, converting ambient energy to electrical energy, has emerged as an alternative to power sensor nodes. By exploiting recharge opportunities and tuning performance parameters based on current and expected energy levels, energy harvesting sensor nodes have the potential to address the conflicting design goals of lifetime and performance. This paper surveys various aspects of energy harvesting sensor systems- architecture, energy sources and storage technologies and examples of harvesting-based nodes and applications. The study also discusses the implications of recharge opportunities on sensor node operation and design of sensor network solutions. The increasing popularity of micro-scale power-scavenging techniques for wireless sensor networks (WSNs) is paving the way to energy-autonomous sensing systems. To sustain perpetual operations, however, environmentally powered devices must adapt their workload to the stochastic nature of ambient sources. Energy prediction models, which estimate the future expected energy intake, are effective tools to support the development of proactive power management strategies. In this paper, we present profile energy prediction model (Pro-Energy), an energy prediction model for multi-source energy-harvesting WSNs that leverages past energy observations to forecast future energy availability. We then propose Pro-Energy with variable-length timeslots (Pro-Energy-VLT), an extension of Pro-Energy that combines our energy predictor with timeslots of variable lengths to adapt to the dynamics of the power source. To assess the performance of our proposed solutions, we use real-life solar and wind traces, as well as publicly available traces of solar irradiance and wind speed. A comparative performance evaluation shows that Pro-Energy significantly outperforms the state-of-the-art energy predictors, by improving the prediction accuracy of up to 67 . Moreover, by adapting the granularity of the prediction timeslots to the dynamics of the energy source, Pro-Energy-VLT further improves the prediction accuracy, while reducing the memory footprint and the energy overhead of energy forecasting. We consider the optimal online packet scheduling problem in a single-user energy harvesting wireless communication system, where energy is harvested from natural renewable sources, making future energy arrivals instants and amounts random in nature. The most general case of arbitrary energy arrivals is considered where neither the future energy arrival instants or amount, nor their distribution is known. The problem considered is to adaptively change the transmission rate according to the causal energy arrival information, such that the time by which all packets are delivered is minimized. We assume that all bits have arrived and are ready at the source before the transmission begins. For a minimization problem, the utility of an online algorithm is tested by finding its competitive ratio or competitiveness that is defined to be the maximum of the ratio of the gain of the online algorithm with the optimal offline algorithm over all input sequences. We derive a lower and upper bound on the competitive ratio of any online algorithm to minimize the total transmission time in an energy harvesting system. The upper bound is obtained using a lazy' transmission policy that chooses its transmission power to minimize the transmission time assuming that no further energy arrivals are going to occur in future. The lazy transmission policy is shown to be strictly two-competitive. We also derive an adversarial lower bound that shows that competitive ratio of any online algorithm is at least 1.325. Energy consumption is a perennial issue in the design of wireless sensor networks (WSNs) which typically rely on portable sources like batteries for power. Recent advances in ambient energy harvesting technology have made it a potential and promising alternative source of energy for powering WSNs. By using energy harvesters with supercapacitors, WSNs are able to operate perpetually until hardware failure and in places where batteries are hard or impossible to replace. In this paper, we study the performance of different medium access control (MAC) schemes based on CSMA and polling techniques for WSNs which are solely powered by ambient energy harvesting using energy harvesters. We base the study on (i) network throughput (S), which is the rate of sensor data received by the sink, (ii) fairness index (F), which determines whether the bandwidth is allocated to each sensor node equally and (iii) inter-arrival time (@c) which measures the average time difference between two packets from a source node. For CSMA, we compare both the slotted and unslotted variants. For polling, we first consider identity polling. Then we design a probabilistic polling protocol that takes into account the unpredictability of the energy harvesting process to achieve good performance. Finally, we present an optimal polling MAC protocol to determine the theoretical maximum performance. We validate the analytical models using extensive simulations incorporating experimental results from the characterization of different types of energy harvesters. The performance results show that probabilistic polling achieves high throughput and fairness as well as low inter-arrival times. Harvesting energy from the environment is feasible in many applications to ameliorate the energy limitations in sensor networks. In this paper, we present an adaptive duty cycling algorithm that allows energy harvesting sensor nodes to autonomously adjust their duty cycle according to the energy availability in the environment. The algorithm has three objectives, namely (a) achieving energy neutral operation, i.e., energy consumption should not be more than the energy provided by the environment, (b) maximizing the system performance based on an application utility model subject to the above energy-neutrality constraint, and (c) adapting to the dynamics of the energy source at run-time. We present a model that enables harvesting sensor nodes to predict future energy opportunities based on historical data. We also derive an upper bound on the maximum achievable performance assuming perfect knowledge about the future behavior of the energy source. Our methods are evaluated using data gathered from a prototype solar energy harvesting platform and we show that our algorithm can utilize up to 58 more environmental energy compared to the case when harvesting-aware power management is not used. In this paper, we present a software control method that maximizes the sensing rate of wireless sensor networks (WSN) that are solely powered by ambient RF power. Different from all other energy harvesting WSN systems, RF powered systems present a new challenge for the energy management. A WSN node repeatedly charges and discharges at short intervals depending on the energy intake. A capacitor is used for an energy storage in the energy harvesting system because of its efficient charge and discharge performance and infinite recharge cycles. When this charging time is too short, the node is more likely to experience an energy shortage. On the contrary, if it is too long, more energy is lost because of the leakage in the capacitor. Therefore, we implemented an adaptive duty cycle control scheme that is optimized for RF energy harvesting. This method maximizes the sensing rate considering the leakage problem, a factor that has never previously been studied in this context. Our control scheme improves efficiency by aggregate evaluation of the operation reliability and leakage reduction. Energy harvesting offers a promising alternative to solve the sustainability limitations arising from battery size constraints in sensor networks. Several considerations in using an environmental energy source are fundamentally different from using batteries. Rather than a limit on the total energy, harvesting transducers impose a limit on the instantaneous power available. Further, environmental energy availability is often highly variable and a deterministic metric such as residual battery capacity is not available to characterize the energy source. The different nodes in a sensor network may also have different energy harvesting opportunities. Since the same end-user performance may be achieved using different workload allocations at multiple nodes, it is important to adapt the workload allocation to the spatio-temporal energy availability profile in order to enable energy-neutral operation of the network. This paper describes power management techniques for such energy harvesting sensor networks. Platform design considerations as well as power scaling techniques at the node-level and network-level are described. Energy harvesting wireless sensor network (EHWSNs) are being actively studied in order to solve the problems faced by battery-operated WSNs, namely the cost for battery replacement and impacts on the environment. In EH-WSNs, each node harvests ambient energy, such as light, heat, vibration, and uses it for sensing, computations, and wireless communications, where the amount of harvested energy of each node varies depending on their surrounding environments. MAC protocols for EH-WSNs need to be designed to achieve high throughput and fairness, however, the conventional MAC protocols proposed for EH-WSNs do not adapt to the harvesting rate of each node, resulting in poor fairness. In this paper, we propose a fair MAC protocol based on polling scheme for EH-WSNs. The proposed scheme adjusts contention probability of each node according to the individual harvesting rate, thereby increasing throughput achieved by nodes with low harvesting rate. We evaluate throughput and fairness of the proposed fair polling scheme by computer simulations, and show that the proposed scheme can improve fairness with little degradation of the overall network throughput. A routing problem in static wireless ad hoc networks is considered as it arises in a rapidly deployed, sensor based, monitoring system known as the wireless sensor network. Information obtained by the monitoring nodes needs to be routed to a set of designated gateway nodes. In these networks, every node is capable of sensing, data processing, and communication, and operates on its limited amount of battery energy consumed mostly in transmission and reception at its radio transceiver. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver then the energy consumption rate per unit information transmission depends on the choice of the next hop node, i.e., the routing decision. We formulate the routing problem as a linear programming problem, where the objective is to maximize the network lifetime, which is equivalent to the time until the network partition due to battery outage. Two different models are considered for the information-generation processes. One assumes constant rates and the other assumes an arbitrary process. A shortest cost path routing algorithm is proposed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. The algorithm is amenable to distributed implementation. Simulation results with both information-generation process models show that the proposed algorithm can achieve network lifetime that is very close to the optimal network lifetime obtained by solving the linear programming problem. As Cyber-Physical-Systems (CPSs) evolve they will be increasingly relied on to support time-critical and performance-intensive monitoring and control activities. Further, many CPSs that utilize Wireless Sensor Networking (WSN) technologies will require the use of energy harvesting methods to extend their lifetimes. For this application class, there are currently few algorithmic techniques that combine performance sensitive processing and communication with efficient management techniques for energy harvesting. Our paper addresses this problem. We first propose a general purpose, multihop WSN architecture capable of supporting time-critical CPS systems using energy harvesting. We then present a set of Harvesting Aware Speed Selection (HASS) algorithms. Our technique maximizes the minimum energy reserve for all the nodes in the network, thus ensuring highly resilient performance under emergency or fault-driven situations. We present an optimal centralized solution, along with an efficient, distributed solution. We propose a CPS-specific experimental methodology, enabling us to evaluate our approach. Our experiments show that our algorithms yield significantly higher energy reserves than baseline methods. Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the nodes can harvest energy throughout the duration in which communication takes place. As such, transmission policies of the nodes need to adapt to these harvested energy arrivals. In this paper, we consider optimization of point-to-point data transmission with an energy harvesting transmitter which has a limited battery capacity, communicating in a wireless fading channel. We consider two objectives: maximizing the throughput by a deadline, and minimizing the transmission completion time of the communication session. We optimize these objectives by controlling the time sequence of transmit powers subject to energy storage capacity and causality constraints. We, first, study optimal offline policies. We introduce a directional water-filling algorithm which provides a simple and concise interpretation of the necessary optimality conditions. We show the optimality of an adaptive directional water-filling algorithm for the throughput maximization problem. We solve the transmission completion time minimization problem by utilizing its equivalence to its throughput maximization counterpart. Next, we consider online policies. We use stochastic dynamic programming to solve for the optimal online policy that maximizes the average number of bits delivered by a deadline under stochastic fading and energy arrival processes with causal channel state feedback. We also propose near-optimal policies with reduced complexity, and numerically study their performances along with the performances of the offline and online optimal policies under various different configurations. In this paper, traffic-aware sleeping control (SC) and power matching (PM) of a single base station (BS) in cellular networks are studied. The objective is to find the sleeping control and power matching configurations that achieve the Pareto optimal tradeoff between total power consumption and average delay. Two types of sleeping control schemes are considered: The BS goes to sleep whenever there is no active user, and wakes up when N users are assembled or after a period of multiple or single vacation time. We first discuss when to incorporate sleeping control into power matching energy efficiently. The explicit relationship between total power consumption and average delay with varying service rate is analyzed theoretically, indicating that sacrificing delay cannot always be traded for energy saving, and we also provide conditions under which the energy-optimal rate exists. Moreover, the optimal pair of sleeping parameter and service rate to achieve the optimal energy-delay tradeoff, and the energy consumption lower bound are also derived. Both the analytical and simulation results show that tolerable sacrifice of delay performance can be traded for substantial amount of energy saving given that careful designs were made according to our analysis. Energy consumption is a growing issue in data centers, impacting their economic viability and their public image. In this work we empirically characterize the power and energy consumed by different types of servers. In particular, in order to understand the behavior of their energy and power consumption, we perform measurements in different servers. In each of them, we exhaustively measure the power consumed by the CPU, the disk, and the network interface under different configurations, identifying the optimal operational levels. One interesting conclusion of our study is that the curve that defines the minimal CPU power as a function of the load is neither linear nor purely convex as has been previously assumed. Moreover, we find that the efficiency of the various server components can be maximized by tuning the CPU frequency and the number of active cores as a function of the system and network load, while the block size of I O operations should be always maximized by applications. We also show how to estimate the energy consumed by an application as a function of some simple parameters, like the CPU load, and the disk and network activity. We validate the proposed approach by accurately estimating the energy of a map-reduce computation in a Hadoop platform. An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor-based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed at different rates depending on the power level and the intended receiver. We propose algorithms to select the routes and the corresponding power levels such that the time until the batteries of the nodes drain-out is maximized. The algorithms are local and amenable to distributed implementation. When there is a single power level, the problem is reduced to a maximum flow problem with node capacities and the algorithms converge to the optimal solution. When there are multiple power levels then the achievable lifetime is close to the optimal (that is computed by linear programming) most of the time. It turns out that in order to maximize the lifetime, the traffic should be routed such that the energy consumption is balanced among the nodes in proportion to their energy reserves, instead of routing to minimize the absolute consumed power. This paper investigates the optimal resource allocation in wireless powered communication network with user cooperation, where two single-antenna users first harvest energy from the signals transmitted by a multi-antenna hybrid access point (H-AP) and then cooperatively send information to the H-AP using their harvested energy. To explore the system information transmission performance limit, an optimization problem is formulated to maximize the weighted sum-rate (WSR) by jointly optimizing energy beamforming vector, time assignment, and power allocation. Besides, another optimization problem is also formulated to minimize the total transmission time for given amount of data required to be transmitted at the two sources. Because both problems are non-convex, we first transform them to be convex by using proper variable substitutions and then apply semi-definite relaxation to solve them. We theoretically prove that our proposed methods guarantee the global optimum of both problems. Simulation results show that system WSR and transmission time can be significantly enhanced by using energy beamforming and user cooperation. It is observed that when the total amount of information of two users is fixed, with the increase of the information amount of the user relatively farther away from the H-AP, the transmission time of the user cooperation scheme decreases while that of the direct transmission increases. Besides, the effects of user position on the system performances are also discussed, which provides some useful insights. On many battery-powered mobile computing devices, the wireless network is a significant contributor to the total energy consumption. In this paper, we investigate the interaction between energy-saving protocols and TCP performance for Web-like transfers. We show that the popular IEEE 802.11 power-saving mode (PSM), a "static" protocol, can harm performance by increasing fast round trip times (RTTs) to 100 ms; and that under typical Web browsing workloads, current implementations will unnecessarily spend energy waking up during long idle periods.To overcome these problems, we present the Bounded-Slowdown (BSD) protocol, a PSM that dynamically adapts to network activity. BSD is an optimal solution to the problem of minimizing energy consumption while guaranteeing that a connection's RTT does not increase by more than a factor p over its base RTT, where p is a protocol parameter that exposes the trade-off between minimizing energy and reducing latency. We present several trace-driven simulation results that show that, compared to a static PSM, the Bounded-Slowdown protocol reduces average Web page retrieval times by 5-64 , while simultaneously reducing energy consumption by 1-14 (and by 13× compared to no power management).