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

Extending Wireless Rechargeable Sensor Network Life without Full Knowledge

When extending the life of Wireless Rechargeable Sensor Networks (WRSN), one challenge is charging networks as they grow larger. Overcoming this limitation will render a WRSN more practical and highly adaptable to growth in the real world. Most charging algorithms require a priori full knowledge of sensor nodes’ power levels in order to determine the nodes that require charging. In this work, we present a probabilistic algorithm that extends the life of scalable WRSN without a priori power knowledge and without full network exploration. We develop a probability bound on the power level of the sensor nodes and utilize this bound to make decisions while exploring a WRSN.We verify the algorithm by simulating a wireless power transfer unmanned aerial vehicle, and charging a WRSN to extend its life. Our results show that, without knowledge, our proposed algorithm extends the life of a WRSN on average 90% of what an optimal full knowledge algorithm can achieve. This means that the charging robot does not need to explore the whole network, which enables the scaling of WRSN. We analyze the impact of network parameters on our algorithm and show that it is insensitive to a large range of parameter values

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

Towards self-powered wireless sensor networks

Ubiquitous computing aims at creating smart environments in which computational and communication capabilities permeate the word at all scales, improving the human experience and quality of life in a totally unobtrusive yet completely reliable manner. According to this vision, an huge variety of smart devices and products (e.g., wireless sensor nodes, mobile phones, cameras, sensors, home appliances and industrial machines) are interconnected to realize a network of distributed agents that continuously collect, process, share and transport information. The impact of such technologies in our everyday life is expected to be massive, as it will enable innovative applications that will profoundly change the world around us. Remotely monitoring the conditions of patients and elderly people inside hospitals and at home, preventing catastrophic failures of buildings and critical structures, realizing smart cities with sustainable management of traffic and automatic monitoring of pollution levels, early detecting earthquake and forest fires, monitoring water quality and detecting water leakages, preventing landslides and avalanches are just some examples of life-enhancing applications made possible by smart ubiquitous computing systems. To turn this vision into a reality, however, new raising challenges have to be addressed, overcoming the limits that currently prevent the pervasive deployment of smart devices that are long lasting, trusted, and fully autonomous. In particular, the most critical factor currently limiting the realization of ubiquitous computing is energy provisioning. In fact, embedded devices are typically powered by short-lived batteries that severely affect their lifespan and reliability, often requiring expensive and invasive maintenance. In this PhD thesis, we investigate the use of energy-harvesting techniques to overcome the energy bottleneck problem suffered by embedded devices, particularly focusing on Wireless Sensor Networks (WSNs), which are one of the key enablers of pervasive computing systems. Energy harvesting allows to use energy readily available from the environment (e.g., from solar light, wind, body movements, etc.) to significantly extend the typical lifetime of low-power devices, enabling ubiquitous computing systems that can last virtually forever. However, the design challenges posed both at the hardware and at the software levels by the design of energy-autonomous devices are many. This thesis addresses some of the most challenging problems of this emerging research area, such as devising mechanisms for energy prediction and management, improving the efficiency of the energy scavenging process, developing protocols for harvesting-aware resource allocation, and providing solutions that enable robust and reliable security support. %, including the design of mechanisms for energy prediction and management, improving the efficiency of the energy harvesting process, the develop of protocols for harvesting-aware resource allocation, and providing solutions that enable robust and reliable security support

Energy Synchronized Transmission Control for Energy-harvesting Sensor Networks

Energy harvesting and recharging techniques have been regarded as a promising solution to ensure sustained operations of wireless sensor networks for longterm applications. To deal with the diversity of energy harvesting and constrained energy storage capability, sensor nodes in such applications usually work in a duty-cycled mode. Consequently, the sleep latency brought by duty-cycled operation is becoming the main challenge. In this work, we study the energy synchronization control problem for such sustainable sensor networks. Intuitively, energy-rich nodes can increase their transmission power in order to improve network performance, while energy-poor nodes can lower transmission power to conserve its precious energy resource. In particular, we propose an energy synchronized transmission control scheme (ESTC) by which each node adaptively selects suitable power levels and data forwarders according to its available energy and traffic load. Based on the large-scale simulations, we validate that our design can improve system performance under different network settings comparing with common uniform transmission power control strategy. Specially, ESTC can enable the perpetual operations of nodes without sacrificing the network lifetime

Data Collection in Two-Tier IoT Networks with Radio Frequency (RF) Energy Harvesting Devices and Tags

The Internet of things (IoT) is expected to connect physical objects and end-users using technologies such as wireless sensor networks and radio frequency identification (RFID). In addition, it will employ a wireless multi-hop backhaul to transfer data collected by a myriad of devices to users or applications such as digital twins operating in a Metaverse. A critical issue is that the number of packets collected and transferred to the Internet is bounded by limited network resources such as bandwidth and energy. In this respect, IoT networks have adopted technologies such as time division multiple access (TDMA), signal interference cancellation (SIC) and multiple-input multiple-output (MIMO) in order to increase network capacity. Another fundamental issue is energy. To this end, researchers have exploited radio frequency (RF) energy-harvesting technologies to prolong the lifetime of energy constrained sensors and smart devices. Specifically, devices with RF energy harvesting capabilities can rely on ambient RF sources such as access points, television towers, and base stations. Further, an operator may deploy dedicated power beacons that serve as RF-energy sources. Apart from that, in order to reduce energy consumption, devices can adopt ambient backscattering communication technologies. Advantageously, backscattering allows devices to communicate using negligible amount of energy by modulating ambient RF signals. To address the aforementioned issues, this thesis first considers data collection in a two-tier MIMO ambient RF energy-harvesting network. The first tier consists of routers with MIMO capability and a set of source-destination pairs/flows. The second tier consists of energy harvesting devices that rely on RF transmissions from routers for energy supply. The problem is to determine a minimum-length TDMA link schedule that satisfies the traffic demand of source-destination pairs and energy demand of energy harvesting devices. It formulates the problem as a linear program (LP), and outlines a heuristic to construct transmission sets that are then used by the said LP. In addition, it outlines a new routing metric that considers the energy demand of energy harvesting devices to cope with routing requirements of IoT networks. The simulation results show that the proposed algorithm on average achieves 31.25% shorter schedules as compared to competing schemes. In addition, the said routing metric results in link schedules that are at most 24.75% longer than those computed by the LP

Perpetual Sensing: Experiences with Energy-Harvesting Sensor Systems

Industry forecasts project the number of connected devices will outpace the global population by orders of magnitude in the next decade or two. These projections are application driven: smart cities, implantable health monitors, responsive buildings, autonomous robots, driverless cars, and instrumented infrastructure are all expected to be drivers for the growth of networked devices. Achieving this immense scale---potentially trillions of smart and connected sensors and computers, popularly called the "Internet of Things"---raises a host of challenges including operating system design, networking protocols, and orchestration methodologies. However, another critical issue may be the most fundamental: If embedded computers outnumber people by a factor of a thousand, how are we going to keep all of these devices powered? In this dissertation, we show that energy-harvesting operation, by which devices scavenge energy from their surroundings to power themselves after they are deployed, is a viable answer to this question. In particular, we examine a range of energy-harvesting sensor node designs for a specific application: smart buildings. In this application setting, the devices must be small and sleek to be unobtrusively and widely deployed, yet shrinking the devices also reduces their energy budgets as energy storage often dominates their volume. Additionally, energy-harvesting introduces new challenges for these devices due to the intermittent access to power that stems from relying on unpredictable ambient energy sources. To address these challenges, we present several techniques for realizing effective sensors despite the size and energy constraints. First is Monjolo, an energy metering system that exploits rather than attempts to mask the variability in energy-harvesting by using the energy harvester itself as the sensor. Building on Monjolo, we show how simple time synchronization and an application specific sensor can enable accurate, building-scale submetering while remaining energy-harvesting. We also show how energy-harvesting can be the foundation for highly deployable power metering, as well as indoor monitoring and event detection. With these sensors as a guide, we present an architecture for energy-harvesting systems that provides layered abstractions and enables modular component reuse. We also couple these sensors with a generic and reusable gateway platform and an application-layer cloud service to form an easy-to-deploy building sensing toolkit, and demonstrate its effectiveness by performing and analyzing several modest-scale deployments.PHDComputer Science & EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/138686/1/bradjc_1.pd

Energy Harvesting Networked Nodes: Measurements, Algorithms, and Prototyping

Recent advances in ultra-low-power wireless communications and in energy harvesting will soon enable energetically self-sustainable wireless devices. Networks of such devices will serve as building blocks for different Internet of Things (IoT) applications, such as searching for an object on a network of objects and continuous monitoring of object configurations. Yet, numerous challenges need to be addressed for the IoT vision to be fully realized. This thesis considers several challenges related to ultra-low-power energy harvesting networked nodes: energy source characterization, algorithm design, and node design and prototyping. Additionally, the thesis contributes to engineering education, specifically to project-based learning. We summarize our contributions to light and kinetic (motion) energy characterization for energy harvesting nodes. To characterize light energy, we conducted a first-of-its kind 16 month-long indoor light energy measurements campaign. To characterize energy of motion, we collected over 200 hours of human and object motion traces. We also analyzed traces previously collected in a study with over 40 participants. We summarize our insights, including light and motion energy budgets, variability, and influencing factors. These insights are useful for designing energy harvesting nodes and energy harvesting adaptive algorithms. We shared with the community our light energy traces, which can be used as energy inputs to system and algorithm simulators and emulators. We also discuss resource allocation problems we considered for energy harvesting nodes. Inspired by the needs of tracking and monitoring IoT applications, we formulated and studied resource allocation problems aimed at allocating the nodes' time-varying resources in a uniform way with respect to time. We mainly considered deterministic energy profile and stochastic environmental energy models, and focused on single node and link scenarios. We formulated optimization problems using utility maximization and lexicographic maximization frameworks, and introduced algorithms for solving the formulated problems. For several settings, we provided low-complexity solution algorithms. We also examined many simple policies. We demonstrated, analytically and via simulations, that in many settings simple policies perform well. We also summarize our design and prototyping efforts for a new class of ultra-low-power nodes - Energy Harvesting Active Networked Tags (EnHANTs). Future EnHANTs will be wireless nodes that can be attached to commonplace objects (books, furniture, clothing). We describe the EnHANTs prototypes and the EnHANTs testbed that we developed, in collaboration with other research groups, over the last 4 years in 6 integration phases. The prototypes harvest energy of the indoor light, communicate with each other via ultra-low-power transceivers, form small multihop networks, and adapt their communications and networking to their energy harvesting states. The EnHANTs testbed can expose the prototypes to light conditions based on real-world light energy traces. Using the testbed and our light energy traces, we evaluated some of our energy harvesting adaptive policies. Our insights into node design and performance evaluations may apply beyond EnHANTs to networks of various energy harvesting nodes. Finally, we present our contributions to engineering education. Over the last 4 years, we engaged high school, undergraduate, and M.S. students in more than 100 research projects within the EnHANTs project. We summarize our approaches to facilitating student learning, and discuss the results of evaluation surveys that demonstrate the effectiveness of our approaches

Energy-aware tree network formation among computationally weak nodes

We study the fundamental problem of distributed network formation among mobile agents of limited computational power that aim to achieve energy balance by wirelessly transmitting and receiving energy in a peer-to-peer manner. Specifically, we design simple distributed protocols consisting of a small number of states and interaction rules for the formation of arbitrary and k-ary tree networks. Furthermore, we evaluate (theoretically and also using computer simulations) a plethora of energy redistribution protocols that exploit different levels of knowledge in order to achieve desired energy distributions among the agents which require that every agent has exactly or at least twice the energy of the agents of higher depth, according to the structure of the network. Our study shows that without using any knowledge about the network structure, such energy distributions cannot be achieved in a timely manner, meaning that there might be high energy loss during the redistribution process. On the other hand, only a few extra bits of information seem to be enough to guarantee quick convergence to energy distributions that satisfy particular properties, yielding low energy loss