Memory disaggregation can potentially allow memory-optimized range indexes such as B+-trees to scale beyond one machine while attaining high hardware utilization and low cost. Designing scalable indexes on disaggregated memory, however, is challenging due to rudimentary caching, unprincipled offloading and excessive inconsistency among servers. This paper proposes DEX, a new scalable B+-tree for memory disaggregation. DEX includes a set of techniques to reduce remote accesses, including logical partitioning, lightweight caching and cost-aware offloading. Our evaluation shows that DEX can outperform the state-of-the-art by 1.7--56.3×, and the advantage remains under various setups, such as cache size and skewness.

Wireless sensor networks (WSNs) have been used for many long-term monitoring applications with the strip topology that is ubiquitous in the real-world deployment, such as pipeline monitoring, water quality monitoring, vehicle monitoring, and Great Wall monitoring. The efficiency of routing strategy has been playing a key role in serving such monitoring applications. In this article, we first present a robust geographic opportunistic routing (GOR) approach—LIght Propagation Selection (LIPS)—that can provide a short path with low energy consumption, communication overhead, and packet loss. To overcome the complication caused by the multi-turning point structure, we propose the virtual Plane mirror (VPM) algorithm, inspired by the light propagation, which is to map the strip topology into the straight one logically. We then select partial neighbors as the candidates to avoid blindly involving all next-hop neighbors and ensure the data transmission along the correct direction. Two implementation problems of VPM—transmission spread angle and the communication range—are thoroughly analyzed based on the percolation theory. Based on the preceding candidate selection algorithms, we propose a GOR algorithm in the strip topology network. By theoretical analysis and extensive simulation, we illustrate the validity and higher transmission performance of LIPS in strip WSNs. In addition, we have proved that the length of the path in LIPS is two times the length of the shortest path via geometrical analysis. Simulation results show that the transmission success rate of our approach is 26.37% higher than the state-of-the-art approach, and the communication overhead and energy consumption rate are 33.11% and 40.23% lower, respectively.

Recent advances and industry standards in Internet of Things (IoT) have accelerated the real-world adoption of connected devices. To manage this hybrid system of digital real-time devices and analog environments, the industry has pushed several popular home automation IoT (HA-IoT) frameworks, such as If-This-Then-That (IFTTT), Apple HomeKit, and Google Brillo. Typically, users author device interactions by specifying the triggering sensor event and the triggered device command. In this seemingly simple software system, two dominant factors govern the system confidence properties with respect to the physical world. First, IoT users are largely nonexperts who lack the comprehensive consideration regarding potential impact and joint effect with existing rules. Second, while the increasing complexity of IoT devices enables fine-grained control (e.g., heater temperature) of continuous real-time environments, even two simply connected devices can have a huge state space to explore. In fact, bugs that wrongfully control devices and home appliances can have ramifications on system correctness and even user physical safety. It is crucial to help users to make sure the system they created meets their expectation. In this article we introduce how techniques from hybrid automata can be practically applied to assist nonexpert IoT users in the confidence checking of such hybrid HA-IoT systems. We propose an automated framework for end-to-end programming assistance. We build and check the Linear Hybrid Automata (LHA) model of the system automatically. We also present a quantifier elimination-based method to analyze the counterexample found and synthesize fix suggestions. We implemented a platform, MenShen, based on this framework and proposed techniques. We conducted sets of real HA-IoT case studies with up to 46 devices and 65 rules. Empirical results show that MenShen can find violations and generate rule fix suggestions in only 10 seconds.

Given the emerging concerns over app privacy-related risks, major app distribution providers (e.g., Microsoft) have been exploring approaches to help end users to make informed decision before installation. This is different from existing approaches of simply trusting users to make the right decision. We build on the direction of risk rating as the way to communicate app-specific privacy risks to end users. To this end, we propose to use sensitivity analysis to infer whether an app requests sensitive on-device resources/ data that are not required for its expected functionality. Our system, Privet, addresses challenges in efficiently achieving test coverage and automated privacy risk assessment. Finally, we evaluate Privet with 1,000 Android apps released in the wild.

Contrary to popular belief, mobile apps can spend a large fraction of time running "hidden" as background services. And, bugs in services can translate into crashes, energy depletion, device slow-down, etc. Unfortunately, without necessary testing tools, developers can only resort to telemetries from user devices in the wild. To this end, Snowdrop is a testing framework that systematically identifies and automates background services in Android apps. Snowdrop realizes a service-oriented approach that does not assume all inter-component communication messages are explicitly coded in the app bytecode. Furthermore, to improve the completeness of test inputs generated, Snowdrop infers field values by exploiting the similarity in how developers name variables. We evaluate Snowdrop by testing 848 commercially available mobile apps. Empirical results show that Snowdrop can achieve 20.91% more code path coverage than pathwise test input generators, and 64.11% more coverage than random test input generators.

As the number of connected devices explodes, the use scenarios of these devices and data have multiplied. Many of these scenarios, e.g., home automation, require tools beyond data visualizations, to express user intents and to ensure interactions do not cause undesired effects in the physical world. We present SIFT, a safety-centric programming platform for connected devices in IoT environments. First, to simplify programming, users express high-level intents in declarative IoT apps. The system then decides which sensor data and operations should be combined to satisfy the user requirements. Second, to ensure safety and compliance, the system verifies whether conflicts or policy violations can occur within or between apps. Through an office deployment, user studies, and trace analysis using a large-scale dataset from a commercial IoT app authoring platform, we demonstrate the power of SIFT and highlight how it leads to more robust and reliable IoT apps.

Scalable and comprehensive testing of mobile apps is extremely challenging. Every test input needs to be run with a variety of contexts, such as: device heterogeneity, wireless network speeds, locations, and unpredictable sensor inputs. The range of values for each context, e.g. location, can be very large. In this paper we present Caiipa, a cloud service for testing apps over an expanded mobile context space in a scalable way. It incorporates key techniques to make app testing more tractable, including a context test space prioritizer to quickly discover failure scenarios for each app. We have implemented Caiipa on a cluster of VMs and real devices that can each emulate various combinations of contexts for tablet and phone apps. We evaluate Caiipa by testing 265 commercially available mobile apps based on a comprehensive library of real-world conditions. Our results show that Caiipa leads to improvements of 11.1x and 8.4x in the number of crashes and performance bugs discovered compared to conventional UI-based automation (i.e., monkey-testing).

Tightly synchronizing transmissions of the same packet from different sources theoretically results in constructive interference. Exploiting this property potentially speeds up network-wide packet propagation with minimal latencies. Our empirical results suggest the timing constraints can be relaxed in the real world, especially for radios using lower frequencies such as the IEEE 802.15.4 radios at 900 MHz. Based on these observations we propose PEASST, a topology-free protocol that leverages synchronized transmissions to lower the cost of end-to-end data transfers, and enables multiple traffic flows. In addition, PEASST integrates a receiver-initiated duty-cycling mechanism to further reduce node energy consumption. Results from both our Matlab-based simulations and indoor testbed reveal that PEASST can achieve a packet delivery latency matching the current state-of-the-art schemes that also leverages synchronized transmissions. In addition, PEASST reduces the radio duty-cycling by three-fold. Furthermore, comparisons with a multi-hop routing protocol shows that PEASST effectively reduces the per-packet control overhead. This translates to a ~10% higher packet delivery performance with a duty cycle of less than half.

Network traffic prioritization is gaining attention in the WSN community, as more and more features are being integrated into sensor networks. Real-world deployment experience suggests that WSN brings new challenges to existing problems, such as resource constraints, low data-rate radios, and diverse application scenarios. We present the RushNet framework that prioritizes two common traffic patterns in multi-hop sensor networks: low-priority (LP) traffic that is large-volume but delay-tolerant, and high-priority (HP) traffic that is sporadic but latency-sensitive. RushNet achieves schedule-free and coordination-free delivery differentiations with the following features. First, RushNet works with most data collection protocols to deliver LP traffic. Second, RushNet leverages transmission power difference and radio capture effect to implement on-demand HP packet delivery with low overhead. Third, RushNet proposes a retrodiction technique to help nodes minimize the overhead of recovering LP packet loss due to concurrent HP traffic. We evaluate RushNet performance with micro-benchmarks and a crowdsourced office comfort monitoring deployment. The deployment results suggest RushNet can achieve a throughput close to network capacity, and deliver 98% of the HP packets with a latency of less than four seconds.

Designing and distributing effective vehicular safety applications can help significantly reduce the number of car accidents and assure the safety of many precious lives. However, despite the efforts from standardization bodies and industrial manufacturers, many studies suggest that it will take more than a decade for full deployment. We start this work with the hypothesis that smartphones may be suitable platforms for catalyzing the distribution of vehicular safety systems. Specifically, smartphones connected to their respective cellular networks can report sensing data to back-end application servers and exchange safety-related messages. This paper first evaluates the performance of the vehicular ad-hoc networking standards and the hardware platforms that implement them. Next, we perform empirical evaluations on the performance of cellular networks to confirm their applicability in vehicular networking. Based on our observations, we present the VoCell application development framework. VoCell, comprehends a set of components that eases the development of smartphone applications for vehicular networking applications. Using VoCell, developers can easily access internal and external sensing components and share this data to servers. We present a number of example applications developed using VoCell and evaluate their effectiveness in local and highway environments using a pilot deployment. We envision that VoCell can act as a building block for enabling new smartphone-based systems for vehicular networking applications.

Many indoor sensing applications leverage knowledge of relative proximity among physical objects and humans, such as the notion of "within arm's reach". In this paper, we quantify this notion using "proximity zone", and propose a methodology that empirically and systematically compare the proximity zones created by various wireless technologies. We find that existing technologies such as 802.15.4, Bluetooth Low Energy (BLE), and RFID fall short on metrics such as boundary sharpness, robustness against interference, and obstacle penetration. We then present the design and evaluation of a wireless proximity detection platform based on magnetic induction - LiveSynergy. LiveSynergy provides sweet spot for indoor applications that require reliable and precise proximity detection. Finally, we present the design and evaluation of an end-to-end system, deployed inside a large food court to offer context-aware and personalized advertisements and diet suggestions at a per-counter granularity.

The maturity and availability of network protocols have enabled wireless sensor networks (WSN) designers to build heterogeneous applications by composing different protocols. A common heterogeneous application combines data collection and dissemination for environmental monitoring with node retasking. While these co-located protocols on the same node have different goals, many of them share requirements and characteristics. Examples of commonalities include the use of bi-directional traffic for reliable transmissions and tree for packet routing. This work explores how the MAC layer can reduce the network transmission overhead of heterogeneous applications by taking advantage of protocol commonalities to aggregate outgoing packets. In other words, this aggregation creates a train of packets destined to the same receiver. Finally, we discuss a strawman implementation of packet train and how our data center monitoring deployment leverages it.

We present A-MAC, a receiver-initiated link layer for low-power wireless networks that supports several services under a unified architecture, and does so more efficiently and scalably than prior approaches. A-MAC's versatility stems from layering unicast, broadcast, wakeup, pollcast, and discovery above a single, flexible synchronization primitive. A-MAC's efficiency stems from optimizing this primitive and with it the most consequential decision that a low-power link makes: whether to stay awake or go to sleep after probing the channel. Today's receiver-initiated protocols require more time and energy to make this decision, and they exhibit worse judgment as well, leading to many false positives and negatives, and lower packet delivery ratios. A-MAC begins to make this decision quickly, and decides more conclusively and correctly in both the negative and affirmative. A-MAC's scalability comes from reserving one channel for the initial handshake and different channels for data transfer. Our results show that: (i) a unified implementation is possible; (ii) A-MAC's idle listening power increases by just 1.12× under interference, compared to 17.3× for LPL and 54.7× for RI-MAC; (iii) A-MAC offers high single-hop delivery ratios; (iv) network wakeup is faster and more channel efficient than LPL; and (v) collection routing performance exceeds the state-of-the-art.

Efficient thermal management is important in modern data centers as cooling consumes up to 50% of the total energy. Unlike previous work, we consider proactive thermal management, whereby servers can predict potential overheating events due to dynamics in data center configuration and workload, giving operators enough time to react. However, such forecasting is very challenging due to data center scales and complexity. Moreover, such a physical system is influenced by cyber effects, including workload scheduling in servers. We propose ThermoCast, a novel thermal forecasting model to predict the temperatures surrounding the servers in a data center, based on continuous streams of temperature and airflow measurements. Our approach is (a) capable of capturing cyberphysical interactions and automatically learning them from data; (b) computationally and physically scalable to data center scales; (c) able to provide online prediction with real-time sensor measurements. The paper's main contributions are: (i) We provide a systematic approach to integrate physical laws and sensor observations in a data center; (ii) We provide an algorithm that uses sensor data to learn the parameters of a data center's cyber-physical system. In turn, this ability enables us to reduce model complexity compared to full-fledged fluid dynamics models, while maintaining forecast accuracy; (iii) Unlike previous simulation-based studies, we perform experiments in a production data center. Using real data traces, we show that ThermoCast forecasts temperature better than a machine learning approach solely driven by data, and can successfully predict thermal alarms 4.2 minutes ahead of time.

In this demonstration, we present the architecture, implementation, and applications of LiveSynergy --- a system that provides reliable proximity sensing and open interactive abstractions for physical spaces and objects, to enable rich interactions between humans and their environment.

We present A-MAC, a receiver-initiated link layer for low-power wireless networks that supports several services under a unified architecture, and does so more efficiently and scalably than prior approaches. A-MAC's versatility stems from layering unicast, broadcast, wakeup, pollcast, and discovery above a single, flexible synchronization primitive. A-MAC's efficiency stems from optimizing this primitive and with it the most consequential decision that a low-power link makes: whether to stay awake or go to sleep after probing the channel. Today's receiver-initiated protocols require more time and energy to make this decision, and they exhibit worse judgment as well, leading to many false positives and negatives, and lower packet delivery ratios. A-MAC begins to make this decision quickly, and decides more conclusively and correctly in both the negative and affirmative. A-MAC's scalability comes from reserving one channel for the initial handshake and different channels for data transfer. Our results show that: (i) a unified implementation is possible; (ii) A-MAC's idle listening power increases by just 1.12x under interference, compared to 17.3x for LPL and 54.7x for RI-MAC; (iii) A-MAC offers high single-hop delivery ratios, even with multiple contending senders; (iv) network wakeup is faster and far more channel efficient than LPL; and (v) collection routing performance exceeds the state-of-the-art.

Frequency overlap across wireless networks with different radio technologies can cause severe interference and reduce communication reliability. The circumstances are particularly unfavorable for ZigBee networks that share the 2.4 GHz ISM band with WiFi senders capable of 10 to 100 times higher transmission power. Our work first examines the interference patterns between ZigBee and WiFi networks at the bit-level granularity. Under certain conditions, ZigBee activities can trigger a nearby WiFi transmitter to back off, in which case the header is often the only part of the Zig-Bee packet being corrupted. We call this the symmetric interference regions, in comparison to the asymmetric regions where the ZigBee signal is too weak to be detected by WiFi senders, but WiFi activity can uniformly corrupt any bit in a ZigBee packet. With these observations, we design BuzzBuzz to mitigate WiFi interference through header and payload redundancy. Multi-Headers provides header redundancy giving ZigBee nodes multiple opportunities to detect incoming packets. Then, TinyRS, a full-featured Reed Solomon library for resource-constrained devices, helps decoding polluted packet payload. On a medium-sized testbed, BuzzBuzz improves the ZigBee network delivery rate by 70%. Furthermore, BuzzBuzz reduces ZigBee retransmissions by a factor of three, which increases the WiFi throughput by 10%.

Many threads packages have been proposed for programming wireless sensor platforms. However, many sensor network operating systems still choose to provide an event-driven model, due to efficiency concerns. We present TOS-Threads, a threads package for TinyOS that combines the ease of a threaded programming model with the efficiency of an event-based kernel. TOSThreads is backwards compatible with existing TinyOS code, supports an evolvable, thread-safe kernel API, and enables flexible application development through dynamic linking and loading. In TOS-Threads, TinyOS code runs at a higher priority than application threads and all kernel operations are invoked only via message passing, never directly, ensuring thread-safety while enabling maximal concurrency. The TOSThreads package is non-invasive; it does not require any large-scale changes to existing TinyOS code.

RACNet is a sensor network for monitoring a data center's environmental conditions. The high spatial and temporal fidelity measurements that RACNet provides can be used to improve the data center's safety and energy efficiency. RACNet overcomes the network's large scale and density and the data center's harsh RF environment to achieve data yields of 99% or higher over a wide range of network sizes and sampling frequencies. It does so through a novel Wireless Reliable Acquisition Protocol (WRAP). WRAP decouples topology control from data collection and implements a token passing mechanism to provide network-wide arbitration. This congestion avoidance philosophy is conceptually different from existing congestion control algorithms that retroactively respond to congestion. Furthermore, WRAP adaptively distributes nodes among multiple frequency channels to balance load and lower data latency. Results from two testbeds and an ongoing production data center deployment indicate that RACNet outperforms previous data collection systems, especially as network load increases.

We present Koala, a reliable data retrieval system designed to operate at permille (.1%) duty cycles, essential for long term environmental monitoring networks. Koala achieves these low duty cycles by letting the network's nodes sleep most of the time and reviving them through an efficient wake-up strategy whenever the gateway performs a bulk data download. Unlike other systems which consume energy to maintain consistent network state (e.g. routes, sleep schedules, etc.) across the network's nodes, Koala maintains no persistent routing state on the motes. Instead, a basestation calculates the network paths using reachability information collected by the motes. The flexible control protocol (FCP), a protocol we developed, is then used to install this routing information on the network's nodes. This paradigm of operation not only eliminates the overhead of maintaining routing state, but also significantly reduces the complexity of the networking code running on the motes. Results from simulation and an actual implementation on TinyOS 2 indicate that Koala can achieve very low duty cycles under a wide range of download and network sizes.