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

Estudi bibliomètric any 2014. Campus del Baix Llobregat: EETAC i ESAB

En el present informe s’analitza la producció científica de les dues escoles del Campus del Baix Llobregat, l’Escola d’Enginyeria de Telecomunicació i Aerospacial de Castelldefels (EETAC) i l’Escola Superior d’Agricultura de Barcelona (ESAB) durant el 2014.Postprint (author’s final draft

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

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

Aplicación de técnicas de Deep Learning para mejorar el enrutamiento en redes comunitarias inalámbricas basadas en OLSR

Una red comunitaria inalámbrica (Wireless Community Network, WCN) es una red inalámbrica en malla creada por un grupo local de personas dando lugar a una infraestructura de red alternativa y autogestionada. Las WCN son redes que crecen y decrecen de forma dinámica y cuyos enlaces se caracterizan por ser asimétricos y escasamente fiables. En este contexto, la selección de rutas adecuadas para el encaminamiento del tráfico es necesaria para ofrecer a sus usuarios acceso a Internet con una buena calidad de servicio. Las características de estas redes hacen conveniente el uso de protocolos de encaminamiento como OLSR, usando la calidad de enlace como métrica de coste. El uso de técnicas de aprendizaje automático para la predicción del estado futuro de la calidad de enlace puede ser crítico a la hora de mejorar el encaminamiento con rutas en las que se prevé una menor probabilidad de pérdida de paquetes. Trabajos previos han tratado de predecir la calidad con el uso de técnicas de aprendizaje automático pero sin tener en cuenta características clave del funcionamiento de OLSR como el fish-eye (ojo de pez). El objetivo del trabajo es aplicar técnicas de aprendizaje profundo (Deep Learning) para predecir la calidad del enlace en redes WCN. Para ello, en primer lugar, se estudia el protocolo OLSR concreto de una WCN, Funkfeuer Graz, y se discuten las implicaciones necesarias que se han de tomar en cuenta para la recogida de datos y el futuro entrenamiento de técnicas de aprendizaje automático. A continuación, se realiza y analiza una captura de tráfico de la red Funkfeuer Graz, obtenida a través de una VPN. Tras su análisis, se procede a realizar la predicción con una técnica de aprendizaje profundo, LSTM (Long Short-Term Memory), debido a que este tipo de RNN (Recurrent Neural Network) ha tenido éxito en la predicción de series temporales en otros ámbitos. Se prueban distintas arquitecturas de LSTM como es el de LSTM con y sin estado, predicción múltiple o encoder-decoder (codificador-decodificador). Se observa que el mecanismo de fish-eye de OLSR hace que la información que un nodo tiene de otros sea distinta según su distancia y que este efecto se debe tener en cuenta a la hora de predecir y entrenar. Además, se muestra que el uso de técnicas LSTM, costosas computacionalmente, no mejora de manera significativa al algoritmo de referencia salvo con enlaces cercanos o en la predicción a varios instantes vista.A Wireless Community Network (WCN) is a wireless mesh network created by a local group of people resulting in an alternative, self-managed network infrastructure. WCNs are networks that grow and decrease dynamically, and their links are characterized by being asymmetric and barely reliable. In this context, the selection of suitable routes for routing traffic is necessary to offer its users a good quality of service. The characteristics of these networks make it convenient to use routing protocols such as OLSR, using link quality as a cost metric. The use of Machine Learning techniques for predicting the future state of link quality can be critical in improving routing with routes that foresee a lower probability of packet loss. Previous works have attempted to predict link quality with the use of Machine Learning techniques but without taking into account the key features of OLSR behaviour such as the fish-eye. The objective of this work is to apply Deep Learning techniques to predict link quality in WCN networks. To do this, first, the specific OLSR protocol of a WCN, Funkfeuer Graz, is studied and the implications to be considered for data collection and future training in Machine Learning techniques are discussed. Next, a traffic capture of the Funkfeuer Graz network, obtained through a VPN, is made and analysed. After analysis, the prediction will be made with a Deep Learning technique, LSTM (Long Short-Term Memory), because this type of RNN (Recurrent Neural Network) has been successful in predicting time series problems. Different LSTM architectures are tested, such as stateless/stateful LSTM, multiple prediction or encoder-decoder. The observation of the OLSR fish-eye mechanism makes one node has different information from others according to their distance and this effect must be considered when predicting and training. Furthermore, it is shown that the use of computationally expensive LSTM techniques does not significantly improve the reference algorithm except with close links or in multi-step prediction.Grado en Ingeniería de Tecnologías de Telecomunicació

Tracking and predicting link quality in wireless community networks

Community networks have emerged under the mottos of “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 this type of prediction achieves about a success probability of about 98% in both the short and long term.Peer ReviewedPostprint (published version

Tracking and predicting link quality in wireless community networks

Community networks have emerged under the mottos of “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 this type of prediction achieves about a success probability of about 98% in both the short and long term.Peer Reviewe