8 research outputs found
Continuous sensing on intermittent power
The main obstacles to achieve truly ubiquitous sensing are (i) the limitations of battery technology - batteries are short-lived, hazardous, bulky, and costly - and (ii) the unpredictability of ambient power. The latter causes sensors to operate intermittently, violating the availability requirements of many real-world applications. In this paper, we present the Coalesced Intermittent Sensor (CIS), an intermittently-powered sensor that senses continuously! Although a single node will frequently be off charging, a group of nodes can -in principle- sense 24/7 provided that their awake times are spread apart. As communication is too expensive, we rely on inherent component variations that induce small differences in power cycles. This basic assumption has been verified through measurements of different nodes and power sources. However, desynchronizing nodes is not enough. An important finding is that a CIS designed for certain (minimal) energy conditions will become synchronized when the available energy exceeds the design point. Nodes employing a sleep mode (to extend their availability) do wake up collectively at some event, process it, and return to charging as the remaining energy is typically too low to handle another event. This results in multiple responses (bad) and missing subsequent events (worse) due to the synchronized charging. To counter this undesired behavior we designed an algorithm to estimate the number of active neighbors and respond proportionally to an event. We show that when intermittent nodes randomize their responses to events, in favorable energy conditions, the CIS reduces the duplicated captured events by 50% and increases the percentage of capturing entire bursts above 85%.Embedded and Networked System
A principled design for passive light communication
To take advantage of Visible Light Communication (VLC) for low-power applications, such as IoT tags, researchers have been developing systems to modulate (backscatter) ambient light using LC shutters. Various approaches have been explored for single-pixel transmitters, but without following a principled approach. This has resulted in either relatively low data rates, short ranges, or the need for powerful artificial light sources. This paper takes a step back and proposes a more theoretical framework: ChromaLux. By considering the fundamental characteristics of liquid crystals (birefringence and thickness), we demonstrate that the design space is way larger than previously explored, allowing for much better systems. In particular, we uncover the existence of a transient state where the switching time can be reduced by an order of magnitude without lowering the contrast significantly, improving both range and data rate. Using a prototype, we demonstrate that our framework is applicable to different LCs. Our results show significant improvements over state-of-the-art single-pixel systems, achieving ranges of 50 meters at 1 kbps and with bit-error-rates below 1%. Embedded and Networked System
FLeet: When time-bounded communication meets high energy-efficiency
With the advent of low-cost, embedded sensor-actuator devices, the applications of cyber-physical systems have spread multi-fold in domains like infrastructure, manufacturing, automation, etc. Wireless sensor-actuator networks (WSANs) act as the backbone for applications in these domains. Typical WSAN deployments focus on energy-efficiency (in-turn lifetime) as replacing batteries is labor intensive and expensive. However, many CPS applications require highly-reliable data delivery with strict time bounds. Unfortunately, the classical approach of scheduling/prioritizing flows for bounded time communication is hard to implement with energy-constrained embedded devices. In this work, we present FLEET, a communication primitive that guarantees timely data delivery with 1) low latency by scheduling a maximum number of end-to-end flows within a short time span; 2) highly energy-efficient networking; and 3) reliable data delivery. Using a smart parallelization technique, FLEET achieves simultaneous transmissions while guaranteeing data delivery. This reduces the average duty-cycle of the nodes and makes it more energy-efficient than many state-of-the-art protocols. By combining multiple routing strategies, FLEET not only simplifies the schedulability problem but also accommodates more flows within a time span reducing delay considerably. Overall, with respect to the state of the art, FLEET offers a delay and duty cycling reduction by 2.2 and 2.8 times, respectively.Embedded and Networked System
AATOM - An Agent-based Airport Terminal Operations Model simulator
AATOM, the Agent-based Airport Terminal Operations Model simulator is open-source, agent-based at its core, and contains several calibrated presets and templates of basic airport terminal components that can readily be used. Agents in this simulator follow the AATOM architecture, an activity-based architecture for human airport agents. This allows analysis based on agent activities, such as shopping and check-in, which is of vital interest for airports. The combination of agent-based modeling and the presence of basic airport terminal components makes AATOM a unique simulator, allowing the modeler to only focus on implementation of important features of their model. The usefulness of AATOM is demonstrated by presenting case studies in the areas of airport security, gate assignment and resilience.Aerospace Transport & OperationsEmbedded and Networked System
Fast network congestion detection and avoidance using P4
Along with exciting visions for 5G communications and the Tactile Internet, the networking requirement of attaining extremely low end-to-end latency has appeared. While network devices are typically equipped with buffers to counteract packet loss caused by short-lived traffic bursts, the more those buffers get filled, the more delay is added to every packet passing through.In this paper, we develop congestion avoidance methods that harness the power of fully programmable data-planes. The corresponding programmable switches, through languages such as P4, can be programmed to gather and react to important packet meta-data, such as queue load, while the data packets are being processed. In particular, we enable P4 switches to (1) track processing and queuing delays of latency-critical flows and (2) react immediately in the data-plane to congestion by rerouting the affected flows. Through a proof-of-concept implementation in emulation and on real hardware, we demonstrate that a data-plane approach reduces average and maximum delay, as well as jitter, when compared to non-programmable approaches.Embedded and Networked System
p-CARMA: Politely Scaling LoRaWAN
Long Range Wide Area Network (LoRaWAN) covers the needs of energy-constrained IoT-devices for operational longevity and extended communication range in a best-effort fashion. However, Lo- RaWAN’s minimalist design cannot handle the traffic from dense deployments with more than a few hundred devices connected to a single gateway, since each LoRa-device transmits data-packets without any information regarding the availability of the medium. In this paper, we try to improve the scalability of LoRaWAN by manifolds, serving thousands of devices per gateway. We present a novel protocol called p persistent-Channel Activity Recognition Multiple Access (p-CARMA) that exploits LoRaWAN’s Channel Activity Detection (CAD) as a crude mechanism to assess if the channel is free. Due to CAD’s imperfections (it only scans for preambles, not for any channel activity) p-CARMA operates probabilistically with each device deciding on a p value based upon local estimation. At the beginning of operation, this estimate is derived from pure local information, that is without involvement of the gateway, and devices automatically adapt to changes in the environment. Then, the adaptation of p-value is assisted by critical information on the cumulative device-delays, multicasted by the gateway at regular, large timespans. To evaluate the performance of p-CARMA, we implemented it in ns-3 based upon a detailed characterization of LoRaWAN’s CAD mechanism involving an extensive set of real-world experiments. We compared p-CARMA to vanilla LoRaWAN as well as a variant using the theoretically optimal p = 1=N (N being the total number of devices). The simulation results show that p-CARMA achieves from three-fold, up to a twenty-fold higher Packet Reception Ratio than LoRaWAN while handling thousands of devices. Further, its adaptivity outperforms the fixed p-value by a factor of 5.25 when scaling up. Moreover, p-CARMA does so while consuming 37.31%-58.17% less energy on average per device compared to vanilla LoRaWAN.Embedded and Networked SystemsElectrical Engineering, Mathematics and Computer Scienc
An Open-Space Museum As a Testbed for Popularity Monitoring in Real-World Settings
This paper reports our experience with crowd monitoring technologies in the challenging real-world conditions of a modern, open-space museum. We seized the opportunity to use the NEMO science center as a testbed, and studied the effectiveness of neighborhood discovery and density estimation algorithms in a network formed by visitors wearing bracelets emitting RF beacons. The diverse set of conditions (flash crowds in open spaces vs. single person booths) revealed three interesting findings: (i) state-of-the-art density estimation fails in 80% of the cases, (ii) RSS-based classifiers fail too, because their underlying assumptions do not hold in many scenarios, and (iii) neighborhood discovery can obtain exact information in an energy-efficient way, provided that static and mobile nodes are differentiated to filter out “passers by” clobbering the true popularity of an exhibit. The overall lesson from the experiment is that today’s algorithms are quite far from the ideal of monitoring popularity in a privacy-preserving and energy-efficient way with minimal infrastructure across the set of heterogeneous conditions encountered in practice.Embedded and Networked System