Exploring Sensor Network Communication Strategies with the Mote-in-the-Loop Approach

WISENET (NES

A Mote-in-the-Loop Approach for Exploring Communication Strategies for Sensor Networks

Sensor networks are being deployed in a range of different environments, such as industry plants, rainforests and offices. Each environment has its own characteristics and the appropriate communication strategy will differ accordingly – packet sizes, retransmission schemes, error correcting codes, etc. It is, however, difficult to investigate th

A sub-mW IoT-endnode for always-on visual monitoring and smart triggering

This work presents a fully-programmable Internet of Things (IoT) visual sensing node that targets sub-mW power consumption in always-on monitoring scenarios. The system features a spatial-contrast $128\mathrm{x}64$ binary pixel imager with focal-plane processing. The sensor, when working at its lowest power mode ($10\mu W$ at 10 fps), provides as output the number of changed pixels. Based on this information, a dedicated camera interface, implemented on a low-power FPGA, wakes up an ultra-low-power parallel processing unit to extract context-aware visual information. We evaluate the smart sensor on three always-on visual triggering application scenarios. Triggering accuracy comparable to RGB image sensors is achieved at nominal lighting conditions, while consuming an average power between $193\mu W$ and $277\mu W$, depending on context activity. The digital sub-system is extremely flexible, thanks to a fully-programmable digital signal processing engine, but still achieves 19x lower power consumption compared to MCU-based cameras with significantly lower on-board computing capabilities.Comment: 11 pages, 9 figures, submitteted to IEEE IoT Journa

Energy efficiency in data collection wireless sensor networks

This dissertation studies the problem of energy efficiency in resource constrained and heterogeneous wireless sensor networks (WSNs) for data collection applications in real-world scenarios. The problem is addressed from three different perspectives: network routing, node energy profiles, and network management. First, the energy efficiency in a WSN is formulated as a load balancing problem, where the routing layer can diagnose and exploit the WSN topology redundancy to reduce the data traffic processed in critical nodes, independent of their hardware platform, improving their energy consumption and extending the network lifetime. We propose a new routing strategy that extends traditional cost-based routing protocols and improves their energy efficiency, while maintaining high reliability. The evaluation of our approach shows a reduction in the energy consumption of the routing layer in the busiest nodes ranging from 11% to 59%, while maintaining over 99% reliability in WSN data collection applications. Second, a study of the effect of the MAC layer on the network energy efficiency is performed based on the nodes energy consumption profile. The resulting energy profiles reveal significant differences in the energy consumption of WSN nodes depending on their external sensors, as well as their sensitivity to changes in network traffic dynamics. Finally, the design of a general integrated framework and data management system for heterogeneous WSNs is presented. This framework not only allows external users to collect data, while monitoring the network performance and energy consumption, but also enables our proposed network redundancy diagnosis and energy profile calculations

Correct-by-Construction Development of Dynamic Topology Control Algorithms

Wireless devices are influencing our everyday lives today and will even more so in the future. A wireless sensor network (WSN) consists of dozens to hundreds of small, cheap, battery-powered, resource-constrained sensor devices (motes) that cooperate to serve a common purpose. These networks are applied in safety- and security-critical areas (e.g., e-health, intrusion detection). The topology of such a system is an attributed graph consisting of nodes representing the devices and edges representing the communication links between devices. Topology control (TC) improves the energy consumption behavior of a WSN by blocking costly links. This allows a mote to reduce its transmission power. A TC algorithm must fulfill important consistency properties (e.g., that the resulting topology is connected). The traditional development process for TC algorithms only considers consistency properties during the initial specification phase. The actual implementation is carried out manually, which is error prone and time consuming. Thus, it is difficult to verify that the implementation fulfills the required consistency properties. The problem becomes even more severe if the development process is iterative. Additionally, many TC algorithms are batch algorithms, which process the entire topology, irrespective of the extent of the topology modifications since the last execution. Therefore, dynamic TC is desirable, which reacts to change events of the topology. In this thesis, we propose a model-driven correct-by-construction methodology for developing dynamic TC algorithms. We model local consistency properties using graph constraints and global consistency properties using second-order logic. Graph transformation rules capture the different types of topology modifications. To specify the control flow of a TC algorithm, we employ the programmed graph transformation language story-driven modeling. We presume that local consistency properties jointly imply the global consistency properties. We ensure the fulfillment of the local consistency properties by synthesizing weakest preconditions for each rule. The synthesized preconditions prohibit the application of a rule if and only if the application would lead to a violation of a consistency property. Still, this restriction is infeasible for topology modifications that need to be executed in any case. Therefore, as a major contribution of this thesis, we propose the anticipation loop synthesis algorithm, which transforms the synthesized preconditions into routines that anticipate all violations of these preconditions. This algorithm also enables the correct-by-construction runtime reconfiguration of adaptive WSNs. We provide tooling for both common evaluation steps. Cobolt allows to evaluate the specified TC algorithms rapidly using the network simulator Simonstrator. cMoflon generates embedded C code for hardware testbeds that build on the sensor operating system Contiki

Distributed Optimal Lexicographic Max-Min Rate Allocation in Solar-Powered Wireless Sensor Networks

Understanding the optimal usage of fluctuating renewable energy in Wireless Sensor Networks (WSNs) is complex. Lexicographic Max-min (LM) rate allocation is a good solution, but is non-trivial for multi-hop WSNs, as both fairness and sensing rates have to be optimized through the exploration of all possible forwarding routes in the network. All current optimal approaches to this problem are centralized and off-line, suffering from low scalability and large computational complexity; typically solving O(N2 ) linear programming problems for N-node WSNs. This paper presents the first optimal distributed solution to this problem with much lower complexity. We apply it to Solar Powered WSNs (SP-WSNs) to achieve both LM optimality and sustainable operation. Based on realistic models of both time-varying solar power and photovoltaic-battery hardware, we propose an optimization framework that integrates a local power management algorithm with a global distributed LM rate allocation scheme. The optimality, convergence, and efficiency of our approaches are formally proven. We also evaluate our algorithms via experiments on both solar-powered MicaZ motes and extensive simulations using real solar energy data and practical power parameter settings. The results verify our theoretical analysis and demonstrate how our approach outperforms both the state-of-the-art centralized optimal and distributed heuristic solutions