skip to main content


Title: Quick (and Dirty) Aggregate Queries on Low-Power WANs
Low-Power Wide-Area Networks (LP-WANs) are seeing wide-spread deployments connecting millions of sensors, each powered by a ten-year AA battery to radio infrastructure, often miles away. By design, iteratively querying all sensors in an LP-WAN may take several hours or even days, given the stringent battery limits of client radios. This precludes obtaining even an approximate real-time view of sensed information across LP-WAN devices over a large area, say in the event of a disaster, fault or simply for diagnostics.This paper presents QuAiL 1 , a system that provides a coarse aggregate view of sensed data across LP-WAN devices over a wide- area within a time span of just one LP-WAN packet. QuAiL achieves this by coordinating multiple LP-WAN radios to transmit their information synchronously in time and frequency despite their power constraints. We design each client's transmission so that the base station can retrieve an approximate heatmap of sensed data by exploiting the spatial correlation of this data across clients. We further show how our system can be optimized for statistical and machine learning queries, all while maintaining the security and privacy of sensed data from individual clients. Our deployment over a 3 sq. km. LP-WAN deployment around CMU campus in Pittsburgh demonstrates a 4x faster information retrieval versus the state-of- the-art statistical methods to retrieve the spatial sensor heatmap at a desired resolution.  more » « less
Award ID(s):
1646235 1837607
NSF-PAR ID:
10194059
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
2020 19th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)
Volume:
2020
Page Range / eLocation ID:
277 to 288
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Throughput extremization is an important facet of performance modeling for low-power wide-area network (LP-WAN) wireless networks (e.g., LoRaWAN) as it provides insight into the best and worst case behavior of the network. Our previous work on throughput extremization established lower and upper bounds on throughput for random access channel assignment over a collision erasure channel in which the lower bound is expressed in terms of the number of radios and sum load on each channel. In this paper the lower bound is further characterized by identifying two local minimizers (a load balanced assignment and an imbalanced assignment) where the decision variables are the number of radios assigned to each channel and the total load on each channel. A primary focus is to characterize how macro-parameters of the optimization, i.e., the total number of radios, their total load, and the minimum load per radio, determine the regions under which each of the local minimizers is in fact the global minimizer. 
    more » « less
  2. Low-Power Wide Area Networks, such as LoRaWAN, are rapidly gaining popularity in the field of wireless sensing and actuation. While LoRaWan is heavily studied in applications and performance, the concept of time has rarely been characterized in such networks. Many applications will require synchronized local clocks with varying levels of precision in order to maintain consistency and coordination in the network. Traditional time synchronization protocols however do not fit LoRaWAN's delay-inherent, low duty cycle, network model and wide-area deployment topology. Meanwhile, relying on GPS for time is not an option for low-power applications. In this paper, we present LongShoT, a time synchronization scheme built on LoRaWan capable of synchronizing device clocks to within 10μs of a reference clock with a single network request. This is achieved by utilizing the deterministic properties of Lo-Ra Wan networks along with hardware- and MAC-level timestamping of packets. LongShoT was implemented on consumer off-the-shelf hardware and evaluated over physically distributed devices using GPS 1PPS as a reference. Our results show that LongShoT achieves an average synchronization error of less than 2μs and compensates oscillator drift to less than 0.1ppm with devices distributed within 4km of a gateway. 
    more » « less
  3. null (Ed.)
    Large-scale real-time analytics services continuously collect and analyze data from end-user applications and devices distributed around the globe. Such analytics requires data to be transferred over the wide-area network (WAN) to data centers (DCs) capable of processing the data. Since WAN bandwidth is expensive and scarce, it is beneficial to reduce WAN traffic by partially aggregating the data closer to end-users. We propose aggregation networks for per- forming aggregation on a geo-distributed edge-cloud infrastructure consisting of edge servers, transit and destination DCs. We identify a rich set of research questions aimed at reducing the traffic costs in an aggregation network. We present an optimization formula- tion for solving these questions in a principled manner, and use insights from the optimization solutions to propose an efficient, near-optimal practical heuristic. We implement the heuristic in AggNet, built on top of Apache Flink. We evaluate our approach using a geo-distributed deployment on Amazon EC2 as well as a WAN-emulated local testbed. Our evaluation using real-world traces from Twitter and Akamai shows that our approach is able to achieve 47% to 83% reduction in traffic cost over existing baselines without any compromise in timeliness. 
    more » « less
  4. Large-scale real-time analytics services continuously collect and analyze data from end-user applications and devices distributed around the globe. Such analytics requires data to be transferred over the wide-area network (WAN) to data centers (DCs) capable of processing the data. Since WAN bandwidth is expensive and scarce, it is beneficial to reduce WAN traffic by partially aggregating the data closer to end-users. We propose aggregation networks for performing aggregation on a geo-distributed edge-cloud infrastructure consisting of edge servers, transit and destination DCs. We identify a rich set of research questions aimed at reducing the traffic costs in an aggregation network. We present an optimization formulation for solving these questions in a principled manner, and use insights from the optimization solutions to propose an efficient, near-optimal practical heuristic. We implement the heuristic in AggNet, built on top of Apache Flink. We evaluate our approach using a geo-distributed deployment on Amazon EC2 as well as a WAN-emulated local testbed. Our evaluation using real-world traces from Twitter and Akamai shows that our approach is able to achieve 47% to 83% reduction in traffic cost over existing baselines without any compromise in timeliness. 
    more » « less
  5. Abstract

    Projects focused on movement behaviour and home range are commonplace, but beyond a focus on choosing appropriate research questions, there are no clear guidelines for such studies. Without these guidelines, designing an animal tracking study to produce reliable estimates of space‐use and movement properties (necessary to answer basic movement ecology questions), is often done in an ad hoc manner.

    We developed ‘movedesign’, a user‐friendly Shiny application, which can be utilized to investigate the precision of three estimates regularly reported in movement and spatial ecology studies: home range area, speed and distance travelled. Conceptually similar to statistical power analysis, this application enables users to assess the degree of estimate precision that may be achieved with a given sampling design; that is, the choices regarding data resolution (sampling interval) and battery life (sampling duration).

    Leveraging the ‘ctmmRpackage, we utilize two methods proven to handle many common biases in animal movement datasets: autocorrelated kernel density estimators (AKDEs) and continuous‐time speed and distance (CTSD) estimators. Longer sampling durations are required to reliably estimate home range areas via the detection of a sufficient number of home range crossings. In contrast, speed and distance estimation requires a sampling interval short enough to ensure that a statistically significant signature of the animal's velocity remains in the data.

    This application addresses key challenges faced by researchers when designing tracking studies, including the trade‐off between long battery life and high resolution of GPS locations collected by the devices, which may result in a compromise between reliably estimating home range or speed and distance. ‘movedesign’ has broad applications for researchers and decision‐makers, supporting them to focus efforts and resources in achieving the optimal sampling design strategy for their research questions, prioritizing the correct deployment decisions for insightful and reliable outputs, while understanding the trade‐off associated with these choices.

     
    more » « less