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
2142218074 1511092558 2508041822 2760327456 2474890436 2034964589 1986985022 2139644003 2774676694 2119548540 2140865819 2964054168 2073749694 2073984308 1976265896 2050266688 2163190245 2136340918 2055929537 2584574674
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. 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. 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. 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. 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. The longevity of wireless sensor network (WSN) deployments is often crucial for real-time monitoring applications. Minimizing energy consumption by utilizing intelligent information processing is one of the main ways to prolong the lifetime of a network deployment. Data streams from the sensors need to be processed within the resource constraints of the sensing platforms to reduce the energy consumption associated with packet transmission. In this paper we carried out both simulation and real-world implementation of light-weight adaptive models to achieve a prolonged WSN lifetime. Specifically, we propose a Naive model that incurs virtually no cost with low memory footprint to realize this goal. Our results show that, despite its minimal complexity, the Naive model is robust when compared with other well-known algorithms used for prediction in WSNs. We show that our approach achieves up to 96 communication reduction, within 0.2 degrees error bound with no significant loss in accuracy and it is comparable in performance to the more complex algorithms like Exponential Smoothing (ETS). 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. Accurate analytical expressions of delay and packet reception probabilities, and energy consumption of duty-cycled wireless sensor networks with random medium access control (MAC) are instrumental for the efficient design and optimization of these resource-constrained networks. Given a clustered network topology with unslotted IEEE 802.15.4 and preamble sampling MAC, a novel approach to the modeling of the delay, reliability, and energy consumption is proposed. The challenging part in such a modeling is the random MAC and sleep policy of the receivers, which prevents to establish the exact time of data packet transmission. The analysis gives expressions as function of sleep time, listening time, traffic rate and MAC parameters. The analytical results are then used to optimize the duty cycle of the nodes and MAC protocol parameters. The approach provides a significant reduction of the energy consumption compared to existing solutions in the literature. Monte Carlo simulations by ns2 assess the validity of the analysis. In a wireless multimedia sensor network (WMSN), the minimization of network energy consumption is a crucial task not just for scalar data but also for multimedia. In this network, a camera node (CN) captures images and transmits them to a base station (BS). Several sensor nodes (SNs) are also placed throughout the network to facilitate the proper functioning of the network. Transmitting an image requires a large amount of energy due to the image size and distance; however, SNs are resource constrained. Image compression is used to scale down image size; however, it is accompanied by a computational complexity trade-off. Moreover, direct image transmission to a BS requires more energy. Thus, in this paper, we present a distributed image compression architecture over WMSN for prolonging the overall network lifetime (at high throughput). Our scheme consists of three subtasks: determining the optimal camera radius for prolonging the CN lifetime, distributing image compression tasks among the potential SNs to balance the energy, and, finally, adopting a multihop hierarchical routing scheme to reduce the long-distance transmission energy. Simulation results show that our scheme can prolong the overall network lifetime and achieve high throughput, in comparison with a traditional routing scheme and its state-of-the-art variants. Large-scale, self-organizing wireless sensor and mesh network deployments are being driven by recent technological developments such as The Internet of Things (IoT), Smart Grids and Smart Environment applications. Efficient use of the limited energy resources of wireless sensor network (WSN) nodes is critically important to support these advances, and application of topology control methods will have a profound impact on energy efficiency and hence battery lifetime. In this survey, we focus on the energy efficiency issue and present a comprehensive study of topology control techniques for extending the lifetime of battery powered WSNs. First, we review the significant topology control algorithms to provide insights into how energy efficiency is achieved by design. Further, these algorithms are classified according to the energy conservation approach they adopt, and evaluated by the trade-offs they offer to aid designers in selecting a technique that best suits their applications. Since the concept of "network lifetime" is widely used for assessing the algorithms' performance, we highlight various definitions of the term and discuss their merits and drawbacks. Recently, there has been growing interest in algorithms for non-planar topologies such as deployments in underwater environments or multi-level buildings. For this reason, we also include a detailed discussion of topology control algorithms that work efficiently in three dimensions. Based on the outcomes of our review, we identify a number of open research issues for achieving energy efficiency through topology control. 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. Finite battery lifetime and low computing capability of size-constrained wireless devices (WDs) have been longstanding performance limitations of many low-power wireless networks, e.g., wireless sensor networks and Internet of Things. The recent development of radio frequency-based wireless power transfer (WPT) and mobile edge computing (MEC) technologies provide a promising solution to fully remove these limitations so as to achieve sustainable device operation and enhanced computational capability. In this paper, we consider a multi-user MEC network powered by the WPT, where each energy-harvesting WD follows a binary computation offloading policy, i.e., the data set of a task has to be executed as a whole either locally or remotely at the MEC server via task offloading. In particular, we are interested in maximizing the (weighted) sum computation rate of all the WDs in the network by jointly optimizing the individual computing mode selection (i.e., local computing or offloading) and the system transmission time allocation (on WPT and task offloading). The major difficulty lies in the combinatorial nature of the multi-user computing mode selection and its strong coupling with the transmission time allocation. To tackle this problem, we first consider a decoupled optimization, where we assume that the mode selection is given and propose a simple bi-section search algorithm to obtain the conditional optimal time allocation. On top of that, a coordinate descent method is devised to optimize the mode selection. The method is simple in implementation but may suffer from high computational complexity in a large-size network. To address this problem, we further propose a joint optimization method based on the alternating direction method of multipliers (ADMM) decomposition technique, which enjoys a much slower increase of computational complexity as the networks size increases. Extensive simulations show that both the proposed methods can efficiently achieve a near-optimal performance under various network setups, and significantly outperform the other representative benchmark methods considered. A multi-access wireless network with N transmitting nodes, each equipped with an energy harvesting (EH) device and a rechargeable battery of finite capacity, is studied. At each time slot (TS) a node is operative with a certain probability, which may depend on the availability of data, or the state of its channel. The energy arrival process at each node is modelled as an independent two-state Markov process, such that, at each TS, a node either harvests one unit of energy, or none. At each TS a subset of the nodes is scheduled by the access point (AP) . The scheduling policy that maximises the total throughput is studied assuming that the AP does not know the states of either the EH processes or the batteries. The problem is identified as a restless multi-armed bandit (RMAB) problem, and an upper bound on the optimal scheduling policy is found. Under certain assumptions regarding the EH processes and the battery sizes, the optimality of the myopic policy (MP) is proven. For the general case, the performance of MP is compared numerically to the upper bound. Recently, Wireless Sensor Networks (WSNs) begin to use the solar energy. But the energy from the environment is usually unstable, An efficient solar prediction algorithm should be studied. In this paper, a novel solar energy prediction algorithm, namely Weather-Conditioned Selective Moving Average (WCSMA), is proposed by using the trend similarity of energy harvesting and the classification of sunny and cloudy days. The simulation results show that the relative mean error of WCSMA algorithm only around 10 , and it is much lower than the Exponential Weighted Moving Average (EWMA) algorithm which is widely used now. In this paper, we study power allocation for secure communication in a multiuser multiple-input single-output (MIS-O) downlink system with simultaneous wireless information and power transfer. The receivers are able to harvest energy from the radio frequency when they are idle. We propose a multi-objective optimization problem for power allocation algorithm design which incorporates two conflicting system objectives: total transmit power minimization and energy harvesting efficiency maximization. The proposed problem formulation takes into account a quality of service (QoS) requirement for the system secrecy capacity. Our designs advocate the dual use of artificial noise in providing secure communication and facilitating efficient energy harvesting. The multi-objective optimization problem is non-convex and is solved by a semidefinite programming (SDP) relaxation approach which results in an approximate of solution. A sufficient condition for the global optimal solution is revealed and the accuracy of the approximation is examined. To strike a balance between computational complexity and system performance, we propose two suboptimal power allocation schemes. Numerical results not only demonstrate the excellent performance of the proposed suboptimal schemes compared to baseline schemes, but also unveil an interesting trade-off between energy harvesting efficiency and total transmit power. Abstract Energy is one of the scarcest resources in wireless sensor network (WSN). One fundamental way of conserving energy is judicious deployment of sensor nodes within the network area so that energy flow remains balanced throughout the network. This avoids the problem of occurrence of ‘energy holes’ and ensures prolonged network lifetime. We have first investigated the problem for enhancing network lifetime using homogeneous sensor nodes. From our observation it is revealed that energy imbalance in WSN occurs due to relaying of data from different parts of the network towards sink. So for improved energy balance instead of using only sensor nodes it is desirable to deploy relay nodes in addition to sensor nodes to manage such imbalance. We have also developed a location-wise pre-determined heterogeneous node deployment strategy based on the principle of energy balancing derived from this analysis, leading to an enhancement of network lifetime. Exhaustive simulation is performed primarily to measure the extent of achieving our design goal of enhancing network lifetime while attaining energy balancing and maintaining coverage. The simulation results also show that our scheme does not compromise with other network performance metrics such as end-to-end delay, packet loss, throughput while achieving the design goal. Finally all the results are compared with two competing schemes and the results confirm our scheme's supremacy in terms of both design performance metrics as well as network performance metrics. In this paper, a reinforcement learning-based throughput on demand (ToD) provisioning dynamic power management method (RLTDPM) is proposed for sustaining perpetual operation and satisfying the ToD requirements for today's energy harvesting wireless sensor node (EHWSN). The RLTDPM monitors the environmental state of the EHWS and adjusts their operational duty cycle under criteria of energy neutrality to meet the demanded throughput. Outcomes of these observation-adjustment interactions are then evaluated by feedback reward that represents how well the ToD requests are met; subsequently, the observation-adjustment-evaluation process, so-called reinforcement learning, continues. After the learning process, the RLTDPM is able to autonomously adjust the duty cycle for satisfying the ToD requirement, and in doing so, sustain the perpetual operation of the EHWSN. Simulations of the proposed RLTDPM on a wireless sensor node powered by a battery and solar cell for image sensing tasks were performed. Experimental results demonstrate that the achieved demanded throughput is improved 10.7 for the most stringent ToD requirement, while the residual battery energy of the RLTDPM is improved 7.4 compared with an existing DPM algorithm for EHWSN with image sensing purpose. We consider the problem of resource allocation in downlink OFDMA systems for multi service and unknown environment. Due to users' mobility and intercell interference, the base station cannot predict neither the Signal to Noise Ratio (SNR) of each user in future time slots nor their probability distribution functions. In addition, the traffic is bursty in general with unknown arrival. The probability distribution functions of the SNR, channel state and traffic arrival density are then unknown. Achieving a multi service Quality of Service (QoS) while optimizing the performance of the system (e.g. total throughput) is a hard and interesting task since it depends on the unknown future traffic and SNR values. In this paper we solve this problem by modeling the multiuser queuing system as a discrete time linear dynamic system. We develop a robust H∞ controller to regulate the queues of different users. The queues and Packet Drop Rates (PDR) are controlled by proposing a minimum data rate according to the demanded service type of each user. The data rate vector proposed by the controller is then fed as a constraint to an instantaneous resource allocation framework. This instantaneous problem is formulated as a convex optimization problem for instantaneous subcarrier and power allocation decisions. Simulation results show small delays and better fairness among users. We consider a MIMO multicell system wherein several Mobile Users (MUs) ask for computation offloading to a common cloud server through their femto-access points. We formulate the computation offloading problem as a joint optimization of the radio resources??the transmit precoding matrices of the MUs??and the computational resources??the CPU cycles second assigned by the cloud to each MU??in order to minimize the overall users' energy consumption while meeting the latency constraints imposed by the applications running on the MUs. The resulting optimization problem is nonconvex (in the objective function and the constraints), and there are constraints coupling all the optimization variables. To cope with the nonconvexity, we hinge on successive convex approximation techniques and propose an iterative algorithm converging to a local optimal solution of the original nonconvex problem. The algorithm is also suitable for a parallel implementation across the access point, with limited coordination signaling with the cloud. Numerical results show that the proposed joint optimization yields significant energy savings with respect to more traditional schemes performing a separate optimization of the radio and computational resources. This paper analyzes the performance of information and energy beamforming in multiple-input multiple- output (MIMO) wireless communications systems, where a self-powered multi-antenna hybrid access point (AP) coordinates wireless information and power transfer (WIPT) with an energy-constrained multi-antenna user terminal (UT). The wirelessly powered UT scavenge energy from the hybrid AP radio-frequency (RF) signal in the downlink (DL) using the harvest-then-transmit protocol, then uses the harvested energy to send its information to the hybrid AP in the uplink (UL). To maximize the overall signal-to-noise ratio (SNR) as well as the harvested energy so as to mitigate the severe effects of fading and enable long-distance wireless power transfer, information and energy beamforming is investigated by steering the transmitted information and energy signals along the strongest eigenmode. To this end, exact and lower-bound expressions for the outage probability and ergodic capacity are presented in closed-form, through which the throughput of the delay- constrained and delay-tolerant transmission modes are analyzed, respectively. Numerical results sustained by Monte Carlo simulations show the exactness and tightness of the proposed analytical expressions. The impact of various parameters such as energy harvesting time, hybrid AP transmit power and the number of antennas on the system throughput is also considered.