We present the Low-Power Wireless Bus (LWB), a communication protocol that supports several traffic patterns and mobile nodes immersed in static infrastructures. LWB turns a multi-hop low-power wireless network into an infrastructure similar to a shared bus, where all nodes are potential receivers of all data. It achieves this by mapping all traffic demands on fast network floods, and by globally scheduling every flood. As a result, LWB inherently supports one-to-many, many-to-one, and many-to-many traffic. LWB also keeps no topology-dependent state, making it more resilient to link changes due to interference, node failures, and mobility than prior approaches. We compare the same LWB prototype on four testbeds with seven state-of-the-art protocols and show that: (i) LWB performs comparably or significantly better in many-to-one scenarios, and adapts efficiently to varying traffic loads; (ii) LWB outperforms our baselines in many-to-many scenarios, at times by orders of magnitude; (iii) external interference and node failures affect LWB's performance only marginally; (iv) LWB supports mobile nodes acting as sources, sinks, or both without performance loss.

/pdf/low-power-wireless-bus-1fq0e824x1.pdf

Low-power wireless bus

Data prediction is proposed in wireless sensor networks (WSNs) to extend the system lifetime by enabling the sink to determine the data sampled, within some accuracy bounds, with only minimal communication from source nodes. Several theoretical studies clearly demonstrate the tremendous potential of this approach, able to suppress the vast majority of data reports at the source nodes. Nevertheless, the techniques employed are relatively complex, and their feasibility on resource-scarce WSN devices is often not ascertained. More generally, the literature lacks reports from real-world deployments, quantifying the overall system-wide lifetime improvements determined by the interplay of data prediction with the underlying network. These two aspects, feasibility and system-wide gains, are key in determining the practical usefulness of data prediction in real-world WSN applications. In this paper, we describe derivative-based prediction (DBP), a novel data prediction technique much simpler than those found in the literature. Evaluation with real data sets from diverse WSN deployments shows that DBP often performs better than the competition, with data suppression rates up to 99 percent and good prediction accuracy. However, experiments with a real WSN in a road tunnel show that, when the network stack is taken into consideration, DBP only triples lifetime—a remarkable result per se, but a far cry from the data suppression rates above. To fully achieve the energy savings enabled by data prediction, the data and network layers must be jointly optimized. In our testbed experiments, a simple tuning of the MAC and routing stack, taking into account the operation of DBP, yields a remarkable seven-fold lifetime improvement w.r.t. the mainstream periodic reporting.

/pdf/practical-data-prediction-for-real-world-wireless-sensor-1nc2gxm24z.pdf

Practical Data Prediction for Real-World Wireless Sensor Networks

We present pTunes, a framework for runtime adaptation of low-power MAC protocol parameters. The MAC operating parameters bear great influence on the system performance, yet their optimal choice is a function of the current network state. Based on application requirements expressed as network lifetime, end-to-end latency, and end-to-end reliability, pTunes automatically determines optimized parameter values to adapt to link, topology, and traffic dynamics. To this end, we introduce a flexible modeling approach, separating protocol-dependent from protocol-independent aspects, which facilitates using pTunes with different MAC protocols, and design an efficient system support that integrates smoothly with the application. To demonstrate its effectiveness, we apply pTunes to X-MAC and LPP. In a 44-node testbed, pTunes achieves up to three-fold lifetime gains over static MAC parameters optimized for peak traffic, the latter being current - and almost unavoidable - practice in real deployments. pTunes promptly reacts to changes in traffic load and link quality, reducing packet loss by 80% during periods of controlled wireless interference. Moreover, pTunes helps the routing protocol recover quickly from critical network changes, reducing packet loss by 70% in a scenario where multiple core routing nodes fail.

/pdf/ptunes-runtime-parameter-adaptation-for-low-power-mac-1mzs8ai3rd.pdf

pTunes: runtime parameter adaptation for low-power MAC protocols

Advances in micro-electronics and miniaturized mechanical systems are redefining the scope and extent of the energy constraints found in battery-operated wireless sensor networks (WSNs). On one hand, ambient energy harvesting may prolong the systems’ lifetime or possibly enable perpetual operation. On the other hand, wireless energy transfer allows systems to decouple the energy sources from the sensing locations, enabling deployments previously unfeasible. As a result of applying these technologies to WSNs, the assumption of a finite energy budget is replaced with that of potentially infinite, yet intermittent, energy supply, profoundly impacting the design, implementation, and operation of WSNs. This article discusses these aspects by surveying paradigmatic examples of existing solutions in both fields and by reporting on real-world experiences found in the literature. The discussion is instrumental in providing a foundation for selecting the most appropriate energy harvesting or wireless transfer technology based on the application at hand. We conclude by outlining research directions originating from the fundamental change of perspective that energy harvesting and wireless transfer bring about.

/pdf/energy-harvesting-and-wireless-transfer-in-sensor-network-13om5e1f9r.pdf

Energy Harvesting and Wireless Transfer in Sensor Network Applications: Concepts and Experiences

Frequent sensor calibration is essential in sensor networks with low-cost sensors. We exploit the fact that temporally and spatially close measurements of different sensors measuring the same phenomenon are similar. Hence, when calibrating a sensor, we adjust its calibration parameters to minimize the differences between co-located measurements of previously calibrated sensors. In turn, freshly calibrated sensors can now be used to calibrate other sensors in the network, referred to as multi-hop calibration. We are the first to study multi-hop calibration with respect to a reference signal (micro-calibration) in detail. We show that ordinary least squares regression---commonly used to calibrate noisy sensors---suffers from significant error accumulation over multiple hops. In this paper, we propose a novel multi-hop calibration algorithm using geometric mean regression, which (i) highly reduces error propagation in the network, (ii) distinctly outperforms ordinary least squares in the multi-hop scenario, and (iii) requires considerably fewer ground truth measurements compared to existing network calibration algorithms. The proposed algorithm is especially valuable when calibrating large networks of heterogeneous sensors with different noise characteristics. We provide theoretical justifications for our claims. Then, we conduct a detailed analysis with artificial data to study calibration accuracy under various settings and to identify different error sources. Finally, we use our algorithm to accurately calibrate 13 million temperature, ground ozone (O3), and carbon monoxide (CO) measurements gathered by our mobile air pollution monitoring network.

D'Orazio

Papers

Is there light at the ends of the tunnel? Wireless sensor networks for adaptive lighting in road tunnels