Eco: A Hardware-Software Co-Design for In Situ Power Measurement on Low-end IoT Systems

Energy-constrained sensor nodes can adaptively optimize their energy consumption if a continuous measurement exists. This is of particular importance in scenarios of high dynamics such as energy harvesting or adaptive task scheduling. However, self-measuring of power consumption at reasonable cost and complexity is unavailable as a generic system service. In this paper, we present Eco, a hardware-software co-design enabling generic energy management on IoT nodes. Eco is tailored to devices with limited resources and thus targets most of the upcoming IoT scenarios. The proposed measurement module combines commodity components with a common system interfaces to achieve easy, flexible integration with various hardware platforms and the RIOT IoT operating system. We thoroughly evaluate and compare accuracy and overhead. Our findings indicate that our commodity design competes well with highly optimized solutions, while being significantly more versatile. We employ Eco for energy management on RIOT and validate its readiness for deployment in a five-week field trial integrated with energy harvesting

A survey of machine learning techniques applied to self organizing cellular networks

In this paper, a survey of the literature of the past fifteen years involving Machine Learning (ML) algorithms applied to self organizing cellular networks is performed. In order for future networks to overcome the current limitations and address the issues of current cellular systems, it is clear that more intelligence needs to be deployed, so that a fully autonomous and flexible network can be enabled. This paper focuses on the learning perspective of Self Organizing Networks (SON) solutions and provides, not only an overview of the most common ML techniques encountered in cellular networks, but also manages to classify each paper in terms of its learning solution, while also giving some examples. The authors also classify each paper in terms of its self-organizing use-case and discuss how each proposed solution performed. In addition, a comparison between the most commonly found ML algorithms in terms of certain SON metrics is performed and general guidelines on when to choose each ML algorithm for each SON function are proposed. Lastly, this work also provides future research directions and new paradigms that the use of more robust and intelligent algorithms, together with data gathered by operators, can bring to the cellular networks domain and fully enable the concept of SON in the near future

High Performance Wireless Sensor-Actuator Networks for Industrial Internet of Things

Wireless Sensor-Actuator Networks (WSANs) enable cost-effective communication for Industrial Internet of Things (IIoT). To achieve predictability and reliability demanded by industrial applications, industrial wireless standards (e.g., WirelessHART) incorporate a set of unique features such as a centralized management architecture, Time Slotted Channel Hopping (TSCH), and conservative channel selection. However, those features also incur significant degradation in performance, efficiency, and agility. To overcome these key limitations of existing industrial wireless technologies, this thesis work develops and empirically evaluates a suite of novel network protocols and algorithms. The primary contributions of this thesis are four-fold. (1) We first build an experimental testbed realizing key features of the WirelessHART protocol stack, and perform a series of empirical studies to uncover the limitations and potential improvements of existing network features. (2) We then investigate the impacts of the industrial WSAN protocol’s channel selection mechanism on routing and real-time performance, and present new channel and link selection strategies that improve route diversity and real-time performance. (3) To further enhance performance, we propose and design conservative channel reuse, a novel approach to support concurrent transmissions in a same wireless channel while maintaining a high degree of reliability. (4) Lastly, to address the limitation of the centralized architecture in handling network dynamics, we develop REACT, a Reliable, Efficient, and Adaptive Control Plane for centralized network management. REACT is designed to reduce the latency and energy cost of network reconfiguration by incorporating a reconfiguration planner to reduce a rescheduling cost, and an update engine providing efficient and reliable mechanisms to support schedule reconfiguration. All the network protocols and algorithms developed in this thesis have been empirically evaluated on the wireless testbed. This thesis represents a step toward next-generation IIoT for industrial automation that demands high-performance and agile wireless communication

Reliability performance analysis of half-duplex and full-duplex schemes with self-energy recycling

Abstract. Radio frequency energy harvesting (EH) has emerged as a promising option for improving the energy efficiency of current and future networks. Self-energy recycling (sER), as a variant of EH, has also appeared as a suitable alternative that allows to reuse part of the transmitted energy via an energy loop. In this work we study the benefits of using sER in terms of reliability improvements and compare the performance of full-duplex (FD) and half-duplex (HD) schemes when using multi-antenna techniques at the base station side. We also assume a model for the hardware energy consumption, making the analysis more realistic since most works only consider the energy spent on transmission. In addition to spectral efficiency enhancements, results show that FD performs better than HD in terms of reliability. We maximize the outage probability of the worst link in the network using a dynamic FD scheme where a small base station (SBS) determines the optimal number of antennas for transmission and reception. This scheme proves to be more efficient than classical HD and FD modes. Results show that the use of sER at the SBS introduces changes on the distribution of antennas for maximum fairness when compared to the setup without sER. Moreover, we determine the minimum number of active radio frequency chains required at the SBS in order to achieve a given reliability target

Self-* distributed query region covering in sensor networks

Wireless distributed sensor networks are used to monitor a multitude of environments for both civil and military applications. Sensors may be deployed to unreachable or inhospitable areas. Thus, they cannot be replaced easily. However, due to various factors, sensors\u27 internal memory, or the sensors themselves, can become corrupted. Hence, there is a need for more robust sensor networks. Sensors are most commonly densely deployed, but keeping all sensors continually active is not energy efficient. Our aim is to select the minimum number of sensors which can entirely cover a particular monitored area, while remaining strongly connected. This concept is called a Minimum Connected Cover of a query region in a sensor network. In this research, we have designed two fully distributed, robust, self-* solutions to the minimum connected cover of query regions that can cope with both transient faults and sensor crashes. We considered the most general case in which every sensor has a different sensing and communication radius. We have also designed extended versions of the algorithms that use multi-hop information to obtain better results utilizing small atomicity (i.e., each sensor reads only one of its neighbors\u27 variables at a time, instead of reading all neighbors\u27 variables). With this, we have proven self-* (self-configuration, self-stabilization, and self-healing) properties of our solutions, both analytically and experimentally. The simulation results show that our solutions provide better performance in terms of coverage than pre-existing self-stabilizing algorithms

Data Compression in Multi-Hop Large-Scale Wireless Sensor Networks

Data collection from a multi-hop large-scale outdoor WSN deployment for environmental monitoring is full of challenges due to the severe resource constraints on small battery-operated motes (e.g., bandwidth, memory, power, and computing capacity) and the highly dynamic wireless link conditions in an outdoor communication environment. We present a compressed sensing approach which can recover the sensing data at the sink with good accuracy when very few packets are collected, thus leading to a significant reduction of the network traffic and an extension of the WSN lifetime. Interplaying with the dynamic WSN routing topology, the proposed approach is efficient and simple to implement on the resource-constrained motes without motes storing of a part of random measurement matrix, as opposed to other existing compressed sensing based schemes. We provide a systematic method via machine learning to find a suitable representation basis, for the given WSN deployment and data field, which is both sparse and incoherent with the measurement matrix in the compressed sensing. We validate our approach and evaluate its performance using our real-world multi-hop WSN testbed deployment in situ in collecting the humidity and soil moisture data. The results show that our approach significantly outperforms three other compressed sensing based algorithms regarding the data recovery accuracy for the entire WSN observation field under drastically reduced communication costs. For some WSN scenarios, compressed sensing may not be applicable. Therefore we also design a generalized predictive coding framework for unified lossless and lossy data compression. In addition, we devise a novel algorithm for lossless compression to significantly improve data compression performance for variouSs data collections and applications in WSNs. Rigorous simulations show our proposed framework and compression algorithm outperform several recent popular compression algorithms for wireless sensor networks such as LEC, S-LZW and LTC using various real-world sensor data sets, demonstrating the merit of the proposed framework for unified temporal lossless and lossy data compression in WSNs

Applications

Volume 3 describes how resource-aware machine learning methods and techniques are used to successfully solve real-world problems. The book provides numerous specific application examples: in health and medicine for risk modelling, diagnosis, and treatment selection for diseases in electronics, steel production and milling for quality control during manufacturing processes in traffic, logistics for smart cities and for mobile communications

An adaptable fuzzy-based model for predicting link quality in robot networks.

It is often essential for robots to maintain wireless connectivity with other systems so that commands, sensor data, and other situational information can be exchanged. Unfortunately, maintaining sufficient connection quality between these systems can be problematic. Robot mobility, combined with the attenuation and rapid dynamics associated with radio wave propagation, can cause frequent link quality (LQ) issues such as degraded throughput, temporary disconnects, or even link failure. In order to proactively mitigate such problems, robots must possess the capability, at the application layer, to gauge the quality of their wireless connections. However, many of the existing approaches lack adaptability or the framework necessary to rapidly build and sustain an accurate LQ prediction model. The primary contribution of this dissertation is the introduction of a novel way of blending machine learning with fuzzy logic so that an adaptable, yet intuitive LQ prediction model can be formed. Another significant contribution includes the evaluation of a unique active and incremental learning framework for quickly constructing and maintaining prediction models in robot networks with minimal sampling overhead