Wireless Power Transfer and Data Collection in Wireless Sensor Networks

In a rechargeable wireless sensor network, the data packets are generated by sensor nodes at a specific data rate, and transmitted to a base station. Moreover, the base station transfers power to the nodes by using Wireless Power Transfer (WPT) to extend their battery life. However, inadequately scheduling WPT and data collection causes some of the nodes to drain their battery and have their data buffer overflow, while the other nodes waste their harvested energy, which is more than they need to transmit their packets. In this paper, we investigate a novel optimal scheduling strategy, called EHMDP, aiming to minimize data packet loss from a network of sensor nodes in terms of the nodes' energy consumption and data queue state information. The scheduling problem is first formulated by a centralized MDP model, assuming that the complete states of each node are well known by the base station. This presents the upper bound of the data that can be collected in a rechargeable wireless sensor network. Next, we relax the assumption of the availability of full state information so that the data transmission and WPT can be semi-decentralized. The simulation results show that, in terms of network throughput and packet loss rate, the proposed algorithm significantly improves the network performance.Comment: 30 pages, 8 figures, accepted to IEEE Transactions on Vehicular Technolog

Energy Harvesting Wireless Communications: A Review of Recent Advances

This article summarizes recent contributions in the broad area of energy harvesting wireless communications. In particular, we provide the current state of the art for wireless networks composed of energy harvesting nodes, starting from the information-theoretic performance limits to transmission scheduling policies and resource allocation, medium access and networking issues. The emerging related area of energy transfer for self-sustaining energy harvesting wireless networks is considered in detail covering both energy cooperation aspects and simultaneous energy and information transfer. Various potential models with energy harvesting nodes at different network scales are reviewed as well as models for energy consumption at the nodes.Comment: To appear in the IEEE Journal of Selected Areas in Communications (Special Issue: Wireless Communications Powered by Energy Harvesting and Wireless Energy Transfer

Energy Sharing for Multiple Sensor Nodes with Finite Buffers

We consider the problem of finding optimal energy sharing policies that maximize the network performance of a system comprising of multiple sensor nodes and a single energy harvesting (EH) source. Sensor nodes periodically sense the random field and generate data, which is stored in the corresponding data queues. The EH source harnesses energy from ambient energy sources and the generated energy is stored in an energy buffer. Sensor nodes receive energy for data transmission from the EH source. The EH source has to efficiently share the stored energy among the nodes in order to minimize the long-run average delay in data transmission. We formulate the problem of energy sharing between the nodes in the framework of average cost infinite-horizon Markov decision processes (MDPs). We develop efficient energy sharing algorithms, namely Q-learning algorithm with exploration mechanisms based on the $\epsilon$-greedy method as well as upper confidence bound (UCB). We extend these algorithms by incorporating state and action space aggregation to tackle state-action space explosion in the MDP. We also develop a cross entropy based method that incorporates policy parameterization in order to find near optimal energy sharing policies. Through simulations, we show that our algorithms yield energy sharing policies that outperform the heuristic greedy method.Comment: 38 pages, 10 figure

Proportional fairness in wireless powered CSMA/CA based IoT networks

This paper considers the deployment of a hybrid wireless data/power access point in an 802.11-based wireless powered IoT network. The proportionally fair allocation of throughputs across IoT nodes is considered under the constraints of energy neutrality and CPU capability for each device. The joint optimization of wireless powering and data communication resources takes the CSMA/CA random channel access features, e.g. the backoff procedure, collisions, protocol overhead into account. Numerical results show that the optimized solution can effectively balance individual throughput across nodes, and meanwhile proportionally maximize the overall sum throughput under energy constraints.Comment: Accepted by Globecom 201

A Survey on Mobile Charging Techniques in Wireless Rechargeable Sensor Networks

The recent breakthrough in wireless power transfer (WPT) technology has empowered wireless rechargeable sensor networks (WRSNs) by facilitating stable and continuous energy supply to sensors through mobile chargers (MCs). A plethora of studies have been carried out over the last decade in this regard. However, no comprehensive survey exists to compile the state-of-the-art literature and provide insight into future research directions. To fill this gap, we put forward a detailed survey on mobile charging techniques (MCTs) in WRSNs. In particular, we first describe the network model, various WPT techniques with empirical models, system design issues and performance metrics concerning the MCTs. Next, we introduce an exhaustive taxonomy of the MCTs based on various design attributes and then review the literature by categorizing it into periodic and on-demand charging techniques. In addition, we compare the state-of-the-art MCTs in terms of objectives, constraints, solution approaches, charging options, design issues, performance metrics, evaluation methods, and limitations. Finally, we highlight some potential directions for future research

Spatial Throughput Maximization of Wireless Powered Communication Networks

Wireless charging is a promising way to power wireless nodes' transmissions. This paper considers new dual-function access points (APs) which are able to support the energy/information transmission to/from wireless nodes. We focus on a large-scale wireless powered communication network (WPCN), and use stochastic geometry to analyze the wireless nodes' performance tradeoff between energy harvesting and information transmission. We study two cases with battery-free and battery-deployed wireless nodes. For both cases, we consider a harvest-then-transmit protocol by partitioning each time frame into a downlink (DL) phase for energy transfer, and an uplink (UL) phase for information transfer. By jointly optimizing frame partition between the two phases and the wireless nodes' transmit power, we maximize the wireless nodes' spatial throughput subject to a successful information transmission probability constraint. For the battery-free case, we show that the wireless nodes prefer to choose small transmit power to obtain large transmission opportunity. For the battery-deployed case, we first study an ideal infinite-capacity battery scenario for wireless nodes, and show that the optimal charging design is not unique, due to the sufficient energy stored in the battery. We then extend to the practical finite-capacity battery scenario. Although the exact performance is difficult to be obtained analytically, it is shown to be upper and lower bounded by those in the infinite-capacity battery scenario and the battery-free case, respectively. Finally, we provide numerical results to corroborate our study.Comment: 15 double-column pages, 8 figures, to appear in IEEE JSAC in February 2015, special issue on wireless communications powered by energy harvesting and wireless energy transfe

Improving Maximum Data Collection Based On Pre-Specified Path Using a Mobile Sink for WSN

Data aggregation is one of the challenging issues which are faced in the wireless sensor network by using Energy Harvesting Sensors. Data collection in a fixed pre-defined path with time varying characteristic forms a major problem in Energy Harvesting Sensor Networks. In the proposed work the Adjustment based allocation method is used to allocate fixed time slots to each sensor nodes in which the network throughput can be increased with less energy consumption. The mobile sink transmits the polling message to all the nodes within the transmission range and makes decision based on the profits gained by the sensor nodes in each timeslot. The NP-Hard problem is defined with the form of reducing the complexity of the sensor nodes where larger number of data can be collected from the environment. The data collection throughput is maximized with the use of optimized path for the mobile sink in the network. This record was migrated from the OpenDepot repository service in June, 2017 before shutting down