Time series analysis to predict link quality of wireless community networks

Community networks have emerged under the mottosCommunity networks have emerged under the mottos “break the strings that are limiting you”, “don't buy the network, be the network” or “a free net for everyone is possible”. Such networks create a measurable social impact as they provide to the community the right and opportunity of communication. As any other network that mixes wired and wireless links, the routing protocol must face several challenges that arise from the unreliable nature of the wireless medium. Link quality tracking helps the routing layer to select links that maximize the delivery rate and minimize traffic congestion. Moreover, link quality prediction has proved to be a technique that surpasses link quality tracking by foreseeing which links are more likely to change its quality. In this work, we focus on link quality prediction by means of a time series analysis. We apply this prediction technique in the routing layer of large-scale, distributed, and decentralized networks. We demonstrate that it is possible to accurately predict the link quality in 98% of the instances, both in the short and the long terms. Particularly, we analyse the behaviour of the links globally to identify the best prediction algorithm and metric, the impact of lag windows in the results, the prediction accuracy some time steps ahead into the future, the degradation of prediction over time, and the correlation of prediction with topological features. Moreover, we also analyse the behaviour of links individually to identify the variability of link quality prediction between links, and the variability of link quality prediction over time. Finally, we also present an optimized prediction method that considers the knowledge about the expected link quality values.Peer ReviewedPostprint (author's final draft

Connecting to smart cities : analyzing energy times series to visualize monthly electricity peak load in residential buildings

Rapidly growing energy consumption rate is considered an alarming threat to economic stability and environmental sustainability. There is an urgent need of proposing novel solutions to mitigate the drastic impact of increased energy demand in urban cities to improve energy efficiency in smart buildings. It is commonly agreed that exploring, analyzing and visualizing energy consumption patterns in residential buildings can help to estimate their energy demands. Moreover, visualizing energy consumption patterns of residential buildings can also help to diagnose if there is any unpredictable increase in energy demand at a certain time period. However, visualizing and inferring energy consumption patterns from typical line graphs, bar charts, scatter plots is obsolete, less informative and do not provide deep and significant insight of the daily domestic demand of energy utilization. Moreover, these methods become less significant when high temporal resolution is required. In this research work, advanced data exploratory and data analytics techniques are applied on energy time series. Data exploration results are presented in the form of heatmap. Heatmap provides a significant insight of energy utilization behavior during different times of the day. Heatmap results are articulated from three analytical perspectives; descriptive analysis, diagnostic analysis and contextual analysis

Estudi bibliomètric any 2016. EETAC

El present document recull les publicacions indexades a la base de dades Scopus durant el període comprès entre el mesos de gener a desembre de l’any 2016, escrits per autors pertanyents a l’EETAC. Es presenten les dades recollides segons la font on s’ha publicat, els autors que han publicat, i el tipus de document publicat. S’hi inclou un annex amb la llista de totes les referències bibliogràfiques publicades.Postprint (author's final draft

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

On Designing a Machine Learning Based Wireless Link Quality Classifier

Ensuring a reliable communication in wireless networks strictly depends on the effective estimation of the link quality, which is particularly challenging when propagation environment for radio signals significantly varies. In such environments, intelligent algorithms that can provide robust, resilient and adaptive links are being investigated to complement traditional algorithms in maintaining a reliable communication. In this respect, the data-driven link quality estimation (LQE) using machine learning (ML) algorithms is one of the most promising approaches. In this paper, we provide a quantitative evaluation of design decisions taken at each step involved in developing a ML based wireless LQE on a selected, publicly available dataset. Our study shows that, re-sampling to achieve training class balance and feature engineering have a larger impact on the final performance of the LQE than the selection of the ML method on the selected data.Comment: accepted in PIMRC 2020. arXiv admin note: text overlap with arXiv:1812.0885

Denoising and Trend Terms Elimination Algorithm of Accelerometer Signals

Acceleration-based displacement measurement approach is often used to measure the polish rod displacement in the oilfield pumping well. Random noises and trend terms of the accelerometer signals are the main factors that affect the measuring accuracy. In this paper, an efficient online learning algorithm is proposed to improve the measurement precision of polish rod displacement in the oilfield pumping well. To remove the random noises and eliminate the trend term of accelerometer signals, the ARIMA model and its parameters are firstly derived by using the obtained data of time series of acceleration sensor signals. Secondly, the period of the accelerometer signals is estimated through the Rife-Jane frequency estimation approach based on Fast Fourier Transform. With the obtained model and parameters, the random noises are removed by employing the Kalman filtering algorithm. The quadratic integration of the period is calculated to obtain the polish rod displacement. Moreover, the windowed recursive least squares algorithm is implemented to eliminate the trend terms. The simulation results demonstrate that the proposed online learning algorithm is able to remove the random noises and trend terms effectively and greatly improves the measurement accuracy of the displacement

Estudi bibliomètric any 2015. EETAC

El present document recull les publicacions indexades a la base de dades Scopus durant el període comprès entre el mesos de gener a desembre de l’any 2015, escrits per autors pertanyents a l’EETAC. Es presenten les dades recollides segons la font on s’ha publicat, els autors que han publicat, i el tipus de document publicat. S’hi inclou un annex amb la llista de totes les referències bibliogràfiques publicades.Postprint (published version

Improving the Routing Layer of Ad Hoc Networks Through Prediction Techniques

Cada dia és més evident el paper clau que juguen la informàtica/computació mòbil i les tecnologies sense fils a les nostres activitats diàries. Estar sempre connectat, en qualsevol moment i lloc, és actualment més una necessitat que un luxe. Els escenaris de computació ubics creats en base a aquests avenços tecnològics, permeten a les persones proporcionar i consumir informació compartida. En aquests escenaris, les xarxes que donen suport a aquestes comunicacions són típicament sense fils i ad hoc. Les característiques dinàmiques i canviants de les xarxes ad hoc, fan que el treball realitzat per la capa d'enrutament tingui un gran impacte en el rendiment d'aquestes xarxes. És molt important que la capa d'enrutament reaccioni ràpidament als canvis que es produeixen, i fins i tot s'avanci als que es produiran en un futur proper, mitjançant l'aplicació de tècniques de predicció. Aquesta tesi investiga si les tècniques de predicció poden millorar la capa d'enrutament de les xarxes ad hoc. Com a primer pas en aquesta direcció, explorem la potencialitat d'una estratègia de Predictor-Basat-en-Història (HBP) per predir la Informació de Control Topològic (TCI) generada pels protocols d'enrutament. Demostrem que hi ha una gran oportunitat per predir TCI, i aquesta predicció pot centrar-se en un petit subconjunt de missatges. En base a les nostres troballes, implementem el predictor OLSR-HBP i l'avaluem respecte al protocol Optimized Link State Routing (OLSR). OLSR-HBP aconsegueix disminucions importants de TCI (sobrecàrrega de senyalització), sense afectar el funcionament de la xarxa i necessita una quantitat de recursos petita i assequible. Finalment, en referència a l'impacte de la predicció en les dades d'enrutament tant de la informació de Qualitat d'Enllaç como de Ruta (o Extrem-a-Extrem), demostrem que l'Anàlisi de Sèries Temporals és un enfocament prometedor per predir amb precisió, tant la Qualitat d'Enllaç como la Qualitat d'Extrem a Extrem en Xarxes Comunitàries.Cada día es más evidente el papel clave que juegan la informática/computación móvil y las tecnologías inalámbricas en nuestras actividades diarias. Estar siempre conectado, en cualquier momento y lugar, es actualmente más una necesidad que un lujo. Los escenarios de computación ubicuos creados en base a estos avances tecnológicos, permiten a las personas proporcionar y consumir información compartida. En estos escenarios, las redes que dan soporte a estas comunicaciones son típicamente inalámbricas y ad hoc. Las características dinámicas y cambiantes de las redes ad hoc, hacen que el trabajo realizado por la capa de enrutamiento tenga un gran impacto en el rendimiento de estas redes. Es muy importante que la capa de enrutamiento reaccione rápidamente a los cambios que se producen, e incluso se adelante a los que sucederán en un futuro cercano, mediante la aplicación de técnicas de predicción. Esta tesis investiga si las técnicas de predicción pueden mejorar la capa de enrutamiento de las redes ad hoc. Como primer paso en esta dirección, exploramos la potencialidad de una estrategia de Predictor-Basado-en-Historia (HBP) para predecir la Información de Control Topológico (TCI) generada por los protocolos de enrutamiento. Demostramos que hay una gran oportunidad para predecir TCI, y esta predicción puede centrarse en un pequeño subconjunto de mensajes. En base a nuestros hallazgos, implementamos el predictor OLSR-HBP y lo evaluamos con respecto al protocolo Optimized Link State Routing (OLSR). OLSR-HBP consigue disminuciones importantes de TCI (sobrecarga de señalización), sin afectar al funcionamiento de la red, y necesita una cantidad de recursos pequeña y asequible. Finalmente, en referencia al impacto de la predicción en los datos de enrutamiento tanto de la información de Calidad de Enlace como de Ruta (o Extremo-a-Extremo), demostramos que el Análisis de Series Temporales es un enfoque prometedor para predecir con precisión, tanto la Calidad de Enlace como la Calidad de Extremo a Extremo en Redes Comunitarias.Everyday becomes more evident the key role that mobile computing and wireless technologies play in our daily activities. Being always connected, anytime, and anywhere is today more a necessity than a luxury. The ubiquitous computing scenarios created based on these technology advances allow people to provide and consume shared information. In these scenarios, the supporting communication networks are typically wireless and ad hoc. The dynamic and changing characteristics of the ad hoc networks, makes the work done by the routing layer to have a high impact on the performance of these networks. It is very important for the routing layer to quickly react to changes that happen, and even be advanced to what will happen in the near future, by applying prediction techniques. This thesis investigates whether prediction techniques can improve the routing layer of ad hoc networks. As a first step in this direction, in this thesis we explored the potentiality of a History-Based Predictor (HBP) strategy to predict the Topology Control Information (TCI) generated by routing protocols. We demonstrated that there is a high opportunity for predicting theTCI, and this prediction can be just focused on a small subset of messages. Based on our findings we implemented the OLSR-HBP predictor and evaluated it with regard to the Optimized Link State Routing (OLSR) protocol. OLSR History-Based Predictor (OLSR-HBP) achieved important decreases of TCI (signaling overhead), without disturbing the network operation, and requiring a small and affordable amount of resources. Finally, regarding the impact of Prediction on the routing data for both Link and Path (or End-to-End) Quality information, we demonstrated that Time-series analysis is a promising approach to accurately predict both Link and End-to-End Quality in Community Networks

Predicción de calidad de enlace en redes comunitarias inalámbricas basadas en OLSR

Las redes comunitarias inalámbricas son redes en malla, creadas por varios usuarios que residen en una zona común, dando acceso a servicios como el acceso a Internet, entre otros. Los enlaces de estas redes son muy poco fiables, por lo que se utilizan protocolos de encaminamiento como OLSR, que utiliza la calidad de enlace como métrica de coste. El uso de técnicas de aprendizaje automático puede ser útil a la hora de predecir el estado futuro de los enlaces, y consecuentemente, mejorar el encaminamiento. A este respecto, trabajos previos han estudiado cómo el aprendizaje automático en lote puede predecir la calidad de los enlaces de una red. No obstante, los modelos creados implican una carga computacional no asumible en entornos reales. Además, estos modelos se degradan con el tiempo. El objetivo de este TFG es proponer nuevos métodos que mantengan una carga computacional reducida y que además realicen una buena predicción.Grado en Ingeniería de Tecnologías de Telecomunicació