Energy-harvesting devices have enabled Internet of Things applications that were impossible before. One core challenge of batteryless sensors that operate intermittently is reliable timekeeping. State-of-the-art low-power real-time clocks suffer from long start-up times (order of seconds) and have low timekeeping granularity (tens of milliseconds at best), often not matching timing requirements of devices that experience numerous power outages per second. Our key insight is that time can be inferred by measuring alternative physical phenomena, like the discharge of a simple RC circuit, and that timekeeping energy cost and accuracy can be modulated depending on the run-time requirements. We achieve these goals with a multi-tier timekeeping architecture, named Cascaded Hierarchical Remanence Timekeeper (CHRT), featuring an array of different RC circuits to be used for dynamic timekeeping requirements. The CHRT and its accompanying software interface are embedded into a fresh batteryless wireless sensing platform, called Botoks, capable of tracking time across power failures. Low start-up time (max 5 ms), high resolution (up to 1 ms) and run-time reconfigurability are the key features of our timekeeping platform. We developed two time-sensitive batteryless applications to demonstrate the approach: a bicycle analytics tool-where the CHRT is used to track time between revolutions of a bicycle wheel, and wireless communication-where the CHRT enables radio synchronization between two intermittently-powered sensors.

Tiny energy harvesting sensors that operate intermittently, without batteries, have become an increasingly appealing way to gather data in hard to reach places at low cost. Frequent power failures make forward progress, data preservation and consistency, and timely operation challenging. Unfortunately, state-of-the-art systems ask the programmer to solve these challenges, and have high memory overhead, lack critical programming features like pointers and recursion, and are only dimly aware of the passing of time and its effect on application quality. We present Time-sensitive Intermittent Computing System (TICS), a new platform for intermittent computing, which provides simple programming abstractions for handling the passing of time through intermittent failures, and uses this to make decisions about when data can be used or thrown away. Moreover, TICS provides predictable checkpoint sizes by keeping checkpoint and restore times small and reduces the cognitive burden of rewriting embedded code for intermittency without limiting expressibility or language functionality, enabling numerous existing embedded applications to run intermittently.

We characterize the performance of a backscatter tag-to-tag (T2T) multi-hop network. For this, we developed a discrete component-based backscatter T2T transceiver and a communication protocol suite. The protocol composed of a novel (i) flooding-based link control tailored towards backscatter transmission, and (ii) low-power listening MAC. The MAC design is based on the new insight that backscatter reception is more energy costly than transmission. Our experiments show that multi-hopping extends the coverage of backscatter networks by enabling longer backward T2T links (tag far from the exciter sending to the tag close to the exciter). Four hops, for example, extend the communication range by a factor of two. Furthermore, we show that dead spots in multi-hop T2T networks are far less significant than those in the single-hop T2T networks.

Batteryless sensor nodes compute, sense, and communicate using only energy harvested from the ambient. These devices promise long maintenance free operation in hard to deploy scenarios, making them an attractive alternative to battery-powered wireless sensor networks. However, complications from frequent power failures due to unpredictable ambient energy stand in the way of robust network operation. Unlike continuously-powered systems, intermittently-powered batteryless nodes lose their time upon each reboot, along with all volatile memory, making synchronization and coordination difficult. In this paper, we consider the case where each batteryless sensor is equipped with a hourglass capacitor to estimate the elapsed time between power failures. Contrary to prior work that focused on providing a continuous notion of time for a single batteryless sensor, we consider a network of batteryless sensors and explore how to provide a network-wide, continuous, and synchronous notion of time. First, we build a mathematical model that represents the estimated time between power failures by using hourglass capacitors. This allowed us to simulate the local (and continuous) time of a single batteryless node. Second, we show through simulations the effect of hourglass capacitors and in turn the performance degradation of the state of the art synchronization protocol in wireless sensor networks in a network of batteryless devices.

Wireless power transfer networks (WPTNs) are composed of dedicated energy transmitters (ETs) that charge energy receivers (ERs) via radio frequency waves. A safe-charging WPTN should keep electromagnetic radiation below predetermined limits meanwhile maximizing the transmitted power. In this paper, we consider this requirement as an optimization problem: the maximization of harvested power by ERs subject to the electro-magnetic safety constraints. In order to provide an approximated solution to this problem, we introduce a dual ascent-like distributed charging algorithm that enables ETs to work without global information and satisfy safety constraints asymptotically. We provide an in-depth theoretical analysis of our algorithm which is supported by numerical simulations.

Distributed and collaborative computation has never been considered before in networks of batteryless sensors. This can bring many advantages for applications (e.g. longer transmission ranges, lower network costs), however introducing new research challenges. In this paper, we focus on the well-known distributed sensor fusion but in an intermittently-powered batteryless sensor network. The goal is to estimate a parameter collaboratively by considering individual sensor measurements. We show that, even though the nodes stop operation with high probability due to random power failures and they neither communicate with their neighbors nor perform computation most of the time, the simplest implementation of the fully-distributed sensor fusion based on average consensus improves the overall estimation quality of the network considerably. In the light of this, we anticipate that if harvested energy is used efficiently so that nodes have more opportunity to receive and send packets, existing fully-distributed protocols can be implemented with tiny modifications in networks of batteryless sensors.

—Battery-free computational RFID platforms, such as WISP (Wireless Identification and Sensing Platform), are intermittently-powered devices designed for replacing existing sensor networks. Accordingly, synchronization appears as one of the crucial building blocks for collaborative and coordinated actions in these platforms. However, intermittent power leads to frequent loss of computational state and short-term clock frequency instability that makes synchronization challenging. In this article, we introduce the WISP-Sync protocol that provides synchronization among WISP tags in the communication range of an RFID reader. WISP-Sync overcomes the aforementioned challenges by employing a Proportional-Integral (PI) controller-inspired algorithm which (i) is adaptive—reactive to short-term clock instabilities; (ii) requires only a few computation steps—suitable for limited harvested energy; and (iii) keeps a few variables to hold the synchronization state—minimum overhead to recover from power interrupts. Evaluations in our testbed showed that WISP-Sync ensured an average synchronization error of approximately 1 ms among the tags with an average energy overhead of 1.85 mJ per synchronization round.

The paper addresses the problem of multi-agent distributed solutions for a class of linear programming (LP) problems which include box constraints on the decision variables and inequality constraints. The major difference with existing literature on distributed solution of LP problems is that each agent is expected to compute only a single or few entries of the global minimizer vector, often referred as a partition-based optimization. This class of LP problems isrelevant in different applications such as optimal power transfer in remotely powered battery-less wireless sensor networks, minimum energy LED luminaries control in smart offices, and optimal temperature control in start buildings. Via a suitable approximation of the originalLP problem, we propose three different primal-dual distributed algorithms based on dual gradient ascent, on the methods of multipliers and on the Alternating Direction Methods of Multipliers.We discuss the computational and communication requirements of these methods and we provide numerical comparisons.

Tiny energy harvesting battery-free devices promise maintenance free operation for decades, providing swarm scale intelligence in applications from healthcare to building monitoring. These devices operate intermittently because of unpredictable, dynamic energy harvesting environments, failing when energy is scarce. Despite this dynamic operation, current programming models are static; they ignore the event-driven and time-sensitive nature of sensing applications, focusing only on preserving forward progress while maintaining performance. This paper proposes InK; the first reactive kernel that provides a novel way to program these tiny energy harvesting devices that focuses on their main application of event-driven sensing. InK brings an event-driven paradigm shift for batteryless applications, introducing building blocks and abstractions that enable reacting to changes in available energy and variations in sensing data, alongside task scheduling, while maintaining a consistent memory and sense of time. We implemented several event-driven applications for InK, conducted a user study, and benchmarked InK against the state-of-the-art; InK provides up to 14 times more responsiveness and was easier to use. We show that InK enables never before seen batteryless applications, and facilitates more sophisticated batteryless programs.

Energy harvesting and battery-free sensing devices show great promise for revolutionizing computing in the home, in the wild, and on the body. The promise of cheap, dense, and ubiquitous sensing technology brings new applications for the Internet of Things. However, the future programming model is blurry and complex. With a potential for trillions of devices, and thousands of devices per person on earth, programming languages and associated operating systems must be usable, flexible, and resource efficient. Because of the thousands of applications and fine grained differences in requirements, multi-tenancy may be a part of the solution to solving this programming model crisis. This paper explores the energy and resources costs, feasibility, and motivation for multi-tenancy on these tiniest of computing devices-namely the difficulties in scheduling tasks fairly, efficiently, and simply. Because of intermittent power, resources and energy must be mostly devoted towards user tasks, we implement a rudimentary operating system with low overhead to conduct experiments and test time-sharing and scheduling protocols. We close with a discussion on challenges to implementing a multi-tenant run-time on battery-free tags, and proposals for future work.