Predicting topology propagation messages in mobile ad hoc networks: The value of history

This research was funded by the Spanish Government under contracts TIN2016-77836-C2-1-R,TIN2016-77836-C2-2-R, and DPI2016-77415-R, and by the Generalitat de Catalunya as Consolidated ResearchGroups 2017-SGR-688 and 2017-SGR-990.The mobile ad hoc communication in highly dynamic scenarios, like urban evacuations or search-and-rescue processes, plays a key role in coordinating the activities performed by the participants. Particularly, counting on message routing enhances the communication capability among these actors. Given the high dynamism of these networks and their low bandwidth, having mechanisms to predict the network topology offers several potential advantages; e.g., to reduce the number of topology propagation messages delivered through the network, the consumption of resources in the nodes and the amount of redundant retransmissions. Most strategies reported in the literature to perform these predictions are limited to support high mobility, consume a large amount of resources or require training. In order to contribute towards addressing that challenge, this paper presents a history-based predictor (HBP), which is a prediction strategy based on the assumption that some topological changes in these networks have happened before in the past, therefore, the predictor can take advantage of these patterns following a simple and low-cost approach. The article extends a previous proposal of the authors and evaluates its impact in highly mobile scenarios through the implementation of a real predictor for the optimized link state routing (OLSR) protocol. The use of this predictor, named OLSR-HBP, shows a reduction of 40–55% of topology propagation messages compared to the regular OLSR protocol. Moreover, the use of this predictor has a low cost in terms of CPU and memory consumption, and it can also be used with other routing protocols.Peer ReviewedPostprint (published version

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Towards a cyber physical system for personalised and automatic OSA treatment

Obstructive sleep apnea (OSA) is a breathing disorder that takes place in the course of the sleep and is produced by a complete or a partial obstruction of the upper airway that manifests itself as frequent breathing stops and starts during the sleep. The real-time evaluation of whether or not a patient is undergoing OSA episode is a very important task in medicine in many scenarios, as for example for making instantaneous pressure adjustments that should take place when Automatic Positive Airway Pressure (APAP) devices are used during the treatment of OSA. In this paper the design of a possible Cyber Physical System (CPS) suited to real-time monitoring of OSA is described, and its software architecture and possible hardware sensing components are detailed. It should be emphasized here that this paper does not deal with a full CPS, rather with a software part of it under a set of assumptions on the environment. The paper also reports some preliminary experiments about the cognitive and learning capabilities of the designed CPS involving its use on a publicly available sleep apnea database

Lifetime Maximization of Wireless Sensor Networks for a Fault Diagnosis System Using LEACH Protocol

The breakdown in a machine created by a fault will greatly affect the plant operation. The frame work of fault diagnosis of machines using machine learning techniques is an established area. Here, the fault diagnosis system is implemented with the help of wireless sensor networks (WSN). Each machine in the plant is fitted with sensors (node) from which the fault diagnosis is carried out. The signals/messages from each node are transmitted to a base station, which acts as a central control unit for the entire plant. Fault diagnosis using WSN in a factory setup has few challenges. The major issue in WSN is the life time of the nodes, as they are situated far away from base station in many plants like thermal power plant, refinery, and petroleum industries. To address the life time of the nodes many researchers have developed many protocols like LEACH, SEP, ERP, HCR, HEED, and PEGASIS. The plants need customisation in terms of choosing suitable algorithms and choosing location of the base station within the plant for better life time of the nodes. This paper presents results of both experimental and simulation studies of a typical plant, where the vibration signals from each machine are acquired and through machine learning techniques the fault diagnosis is performed with the help of wireless sensor networks. For illustrative purpose, a well reported bearing fault diagnosis data set is taken up and fault diagnosis case study was performed from wireless sensor networks point of view (experimental study). Here, at every stage, the computational time is taken as a primary concern which affects the life time of the sensor nodes. Then, the WSN of 18 sensor nodes representing 18 machines with LEACH protocol is simulated in Matlab© to study the life time characteristics of each node while keeping base station at different locations. The life time of different nodes is heavily dependent on the location of the base station. Finding the right location of the base station for a given plant is another contribution of this work

A Learning Theoretic Approach to Energy Harvesting Communication System Optimization

A point-to-point wireless communication system in which the transmitter is equipped with an energy harvesting device and a rechargeable battery, is studied. Both the energy and the data arrivals at the transmitter are modeled as Markov processes. Delay-limited communication is considered assuming that the underlying channel is block fading with memory, and the instantaneous channel state information is available at both the transmitter and the receiver. The expected total transmitted data during the transmitter's activation time is maximized under three different sets of assumptions regarding the information available at the transmitter about the underlying stochastic processes. A learning theoretic approach is introduced, which does not assume any a priori information on the Markov processes governing the communication system. In addition, online and offline optimization problems are studied for the same setting. Full statistical knowledge and causal information on the realizations of the underlying stochastic processes are assumed in the online optimization problem, while the offline optimization problem assumes non-causal knowledge of the realizations in advance. Comparing the optimal solutions in all three frameworks, the performance loss due to the lack of the transmitter's information regarding the behaviors of the underlying Markov processes is quantified