Estudio de mecanismos de distribución de contenidos en redes vehiculares urbanas

El objetivo de este trabajo es la investigación, usando un modelo basado en agentes, de formas eficientes de distribuir contenidos relacionados con la información y el entretenimiento en una red formada por vehículos. Las simulaciones basadas en agentes permiten estudiar el comportamiento resultante de interacciones complejas entre entidades autónomas, por lo que este trabajo se ha creado como un punto de partida para otros trabajos futuros relacionados con redes vehiculares que no puedan realizarse fácilmente con simuladores de comunicaciones convencionales. Diferentes protocolos se han propuesto durante los últimos años para distribuir contenidos en una red vehicular. En este trabajo se utilizará un modelo basado en agentes para simular una situación real en la ciudad de Madrid, donde los coches se moverán durante 3600 segundos y estarán interesados en obtener un único contenido. Su objetivo es conseguirlo usando la red vehicular, pero si no lo consiguen, usarán una red celular para descargarlo. Durante la simulación, se variarán parámetros como la densidad de tráfico, el número de contenidos en la red y la popularidad de estos contenidos (algunos contenidos son más interesantes para los usuarios que otros). Tres protocolos (cada uno con posibilidad de añadir optimizaciones) serán probados en cada situación, y los resultados se compararán para decidir qué protocolo es el mejor en cada escenario.The purpose of this work is to research, using an agent based model, about efficient ways of distributing infotainment contents in a network formed by vehicles. Agent based simulations can deal with complex behaviors resulting from the interaction of autonomous entities, so this work intents to be an initial step towards future research about vehicular networks which cannot be implemented easily by conventional communications simulators. Different kinds of protocols have been proposed during the past years to distribute contents using a vehicular network. In this work, we use an agent-based model to simulate a real situation in the city of Madrid, where cars travel during 3600 seconds and they are be interested in obtaining a single content. Their aim is to get the content using the vehicular network but, if that is not possible, they use a cellular network to download it. During the simulations, we study the effect of parameters such as traffic density, number of contents in the network and popularity of these contents (some contents are more interesting to users than others). Three different protocols (each one with possible optimizations) are tested in the different scenarios to evaluate their performance.Ingeniería en Tecnologías de Telecomunicació

Ad-hoc Stream Adaptive Protocol

With the growing market of smart-phones, sophisticated applications that do extensive computation are common on mobile platform; and with consumers’ high expectation of technologies to stay connected on the go, academic researchers and industries have been making efforts to find ways to stream multimedia contents to mobile devices. However, the restricted wireless channel bandwidth, unstable nature of wireless channels, and unpredictable nature of mobility, has been the major road block for wireless streaming advance forward. In this paper, various recent studies on mobility and P2P system proposal are explained and analyzed, and propose a new design based on existing P2P systems, aimed to solve the wireless and mobility issues

Cooperative Content Dissemination on Vehicle Networks

As redes veiculares têm sido alvo de grandes avanços nos últimos anos, sobretudo devido ao crescente interesse por veículos inteligentes e autónomos que motiva investimentos avultados por parte da indústria automóvel. A inexistência de uma forma oportuna e económica de executar atualizações OTA (over-the-air) está a contribuir para o adiar do lançamento de grandes frotas de veículos inteligentes. O custo associado à transmissão de dados através de redes celulares é muito elevado e não se pode garantir que cada veículo tenha acesso a uma estação ou estacionamento com conectividade adequada em tempo útil, onde possa obter os dados esperados. Com base nestas premissas, esta tese apresenta a concepção e implementação de um protocolo cooperativo de disseminação de conteúdos que aproveita as ligações Veículo-a-Veículo (V2V) para assegurar uma distribuição de dados pela rede com custos reduzidos. Além disso, este trabalho é complementado e suportado com uma análise do desempenho do protocolo numa rede de 25 veículos.Vehicular networks have seen great advancements over the last few years, mostly due to the increased eagerness for smart and autonomous vehicles that motivate hefty investments by the automotive industry. The absence of a timely and cost-effective way to perform over-the-air (OTA) updates is contributing to defer the deployment of large fleets of connected vehicles. There is a high cost associated with transmitting data over cellular networks and it cannot be expected that every vehicle has access to a station or depot with adequate connectivity where it can get the awaited data cheaply nor that this solution happens timely enough. With this in mind, this thesis presents the design and implementation of a cooperative content dissemination protocol that takes advantage of Vehicle-to-Vehicle (V2V) communication links to distribute data across a network with reduced costs. Moreover, this work is complemented with a performance analysis of the protocol on a deployed network of 25 vehicles

SCALABLE AND EFFICIENT VERTICAL HANDOVER DECISION ALGORITHMS IN VEHICULAR NETWORK CONTEXTS

A finales de los años noventa, y al comienzo del nuevo milenio, las redes inalámbricas han evolucionado bastante, pasando de ser sólo una tecnología prometedora para convertirse en un requisito para las actividades cotidianas en las sociedades desarrolladas. La infraestructura de transporte también ha evolucionado, ofreciendo comunicación a bordo para mejorar la seguridad vial y el acceso a contenidos de información y entretenimiento. Los requisitos de los usuarios finales se han hecho dependientes de la tecnología, lo que significa que sus necesidades de conectividad han aumentado debido a los diversos requisitos de las aplicaciones que se ejecutan en sus dispositivos móviles, tales como tabletas, teléfonos inteligentes, ordenadores portátiles o incluso ordenadores de abordo (On-Board Units (OBUs)) dentro de los vehículos. Para cumplir con dichos requisitos de conectividad, y teniendo en cuenta las diferentes redes inalámbricas disponibles, es necesario adoptar técnicas de Vertical Handover (VHO) para cambiar de red de forma transparente y sin necesidad de intervención del usuario. El objetivo de esta tesis es desarrollar algoritmos de decisión (Vertical Handover Decision Algorithms (VHDAs)) eficientes y escalables, optimizados para el contexto de las redes vehiculares. En ese sentido se ha propuesto, desarrollado y probado diferentes algoritmos de decisión basados en la infraestructura disponible en las actuales, y probablemente en las futuras, redes inalámbricas y redes vehiculares. Para ello se han combinado diferentes técnicas, métodos computacionales y modelos matemáticos, con el fin de garantizar una conectividad apropiada, y realizando el handover hacia las redes más adecuadas de manera a cumplir tanto con los requisitos de los usuarios como los requisitos de las aplicaciones. Con el fin de evaluar el contexto, se han utilizado diferentes herramientas para obtener información variada, como la disponibilidad de la red, el estado de la red, la geolocalizaciónMárquez Barja, JM. (2012). SCALABLE AND EFFICIENT VERTICAL HANDOVER DECISION ALGORITHMS IN VEHICULAR NETWORK CONTEXTS [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/17869Palanci

Cooperative & cost-effective network selection: a novel approach to support location-dependent & context-aware service migration in VANETs

Vehicular networking has gained considerable interest within the research community and industry. This class of mobile ad hoc network expects to play a vital role in the design and deployment of intelligent transportation systems. The research community expects to launch several innovative applications over Vehicular Ad hoc Networks (VANETs). The automotive industry is supporting the notion of pervasive connectivity by agreeing to equip vehicles with devices required for vehicular ad hoc networking. Equipped with these devices, mobile nodes in VANETs are capable of hosting many types of applications as services for other nodes in the network. These applications or services are classified as safety-critical (failure or unavailability of which may lead to a life threat) and non-safety-critical (failure of which do not lead to a life threat). Safety-critical and non-safety-critical applications need to be supported concurrently within VANETs. This research covers non-safety-critical applications since the research community has overlooked this class of applications. More specifically, this research focuses on VANETs services that are location-dependent. Due to high speed mobility, VANETs are prone to intermittent network connectivity. It is therefore envisioned that location-dependence and intermittent network connectivity are the two major challenges for VANETs to host and operate non-safety-critical VANETs services. The challenges are further exacerbated when the area where the services are to be deployed is unplanned i.e. lacks communication infrastructure and planning. Unplanned areas show irregular vehicular traffic on the road. Either network traffic flows produced by irregular vehicular traffic may lead to VANETs communication channel congestion, or it may leave the communication channel under-utilized. In both cases, this leads to communication bottlenecks within VANETs. This dissertation investigates the shortcomings of location-dependence, intermittent network connectivity and irregular network traffic flows and addresses them by exploiting location-dependent service migration over an integrated network in an efficient and cost-effective manner

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

The power of quasi-shortest paths and the impact of node mobility on dynamic networks

The objective of this thesis is to investigate three important aspects of dynamic networks: the impact of node mobility on multihop data transmission, the effect of the use of longer paths on the relative importance of nodes and the performance of the network in the presence of failure on central nodes. To analyze the first aspect, this work proposes the (κ, λ)-vicinity, which extends the traditional vicinity to consider as neighbors nodes at multihop distance and restricts the link establishment according to the relative speed between nodes. This proposal is used later on the development of three forwarding strategies. The relative speed restriction imposed on these strategies results in significant reduction of resources consumption, without incurring significant impact on the average packet delivery ratio. To analyze the second aspect, we propose the ρ-geodesic betweenness centrality, which uses shortest and quasi-shortest paths to quantify the relative importance of a node. The quasishortest paths are limited by a spreadness factor, ρ. The use of non-optimal paths causes the reranking of several nodes and its main effect is a reduced occupation of the most central positions by articulation points. Lastly, the network performenace in presence of failures is investigated through simulations, in which failures happen on nodes defined as the most central according to distinct centrality metrics. The result is a severe reduction of the average network throughput, and it is independent of the metric used to determine which nodes are the most central. The major strength of the proposed metric, then, is that, despite the severe reduction of the throughput, there is a high probability of maintaining the network connected after a failure, because it is unlikely that a failing node in the most central position is also an articulation point.O objetivo desta tese é investigar três aspectos importantes das redes dinâmicas: o impacto da mobilidade dos nós na transmissão de dados em múltiplos saltos, o efeito do uso de caminhos mais longos na importância relativa dos nós, e o desempenho da rede na presença de falha em nós centrais. Para analisar o primeiro aspecto, este trabalho propõe a (κ, λ)-vizinhança, que estende a vizinhança tradicional para considerar como vizinhos nós a múltiplos saltos de distância e restringe o estabelecimento de enlaces de acordo com a velocidade relativa entre os nós. Essa proposta é usada posteriormente no desenvolvimento de três estratégias de encaminhamento. A restrição de velocidade relativa imposta nessas estratégias resulta em uma redução significativa do consumo de recursos, sem que ocorra impacto significativo na taxa média de entrega de pacotes. Para analisar o segundo aspecto, propõe a centralidade de intermediação ρ-geodésica, que usa caminhos mais curtos e quase mais curtos para quantificar a importância relativa dos nos. Os caminhos quase mais curtos são limitados por um fator de espalhamento ρ. O uso de caminhos não ótimos provoca o reranqueamento de diversos nós e tem como principal efeito uma menor ocupação de posições mais centrais por pontos de articulação. Por fim, o desempenho da rede em presença de falha é investigado através de simulações nas quais as falhas atingem nós definidos como os mais centrais de acordo com métricas de centralidade distintas. O resultado é uma redução brusca da vazão média da rede, independentemente da métrica usada para determinar quais são os nós mais centrais. O grande trunfo da métrica proposta é que, apesar da severa redução na vazão, é grande a probabilidade de manter a rede conectada após a falha, uma vez que é pouco provável que um nó em falha nas posições mais centrais seja também um ponto de articulação

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: vehicular ad-hoc networks, security and caching, TCP in ad-hoc networks and emerging applications. It is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Contributions to provide a QoS-aware self-configured framework for video-streaming services over ad hoc networks

Aplicat embargament des del dia 27 d'octubre de 2021 fins 31 de juliol de 2022Ad hoc networks have attracted much attention from the research community over the last years and important technical advances have risen as a consequence. These networks are foreseen as an important kind of next generation access networks, where multimedia services will be demanded by end users from their wireless devices everywhere. In this thesis, we specially focus our research work on mobile ad hoc networks (MANETs) and on vehicular ad hoc networks (VANETs), two kind of ad hoc networks over which interesting multimedia services can be provided. The special haracteristics of MANETs/VANETs, such as mobility, dynamic network topology (specially in VANETs), energy constraints (in case of MANETs), infrastructureless and variable link capacity, make the QoS (Quality of Service) provision over these networks an important challenge for the research community. Due to that, there is a need to develop new routing protocols specially designed for MANETs and VANETs able to provide multimedia services. The main objective of this thesis is to contribute in the development of the communication framework for MANETs and VANETs to improve decisions to select paths or next hops in the moment of forwarding video-reporting messages. In this way, it would be possible to have a quick answer to manage daily problems in the city and help the emergency units (e.g., police, ambulances, health care units) in case of incidents (e.g., traffic accidents). Furthermore, in case of VANETs, a real scenario must be created and thus we have analysed the presence of obstacles in real maps. Also, in case of an obstacle found between the current forwarding node and the candidate next forwarding node, the packet is stored in a buffer, for a maximum time, until a forwarding neighbour node is found; otherwise, the packet is dropped. To improve the communication framework for MANETs, we propose a new routing protocol based on a game-theoretical scheme for N users specially designed to transmit video-reporting messages. Our proposal makes the network more efficient and provides a higher degree of satisfaction of the users by receiving much more packets with a lower average end-to-end delay, lower jitter and higher PSNR (Peak Signal-to-Noise Ratio). In addition, we propose a geographical routing protocol for VANETs that considers multiple metrics named 3MRP (Multimedia Multimetric Map-Aware Routing Protocol) [1]. 3MRP is a geographical protocol based on hop-by-hop forwarding. The metrics considered in 3MRP are the distance, the density of vehicles in transmission range, the available bandwidth, the future trajectory of the neighbouring nodes and the MAC layer losses. Those metrics are weighted to obtain a multimetric score. Thus, a node selects another node among its neighbours as the best forwarding node to increase the percentage of successful packet delivery, minimizing the average packet delay and offering a certain level of quality and service. Furthermore, a new algorithm named DSW (Dynamic Self-configured Weights) computes for each metric its corresponding weight depending on the current network conditions. As a consequence, nodes are classiffied in a better way.Les xarxes sense fils ad hoc han captat molt l'atenció per part de la comunitat científica en els últims anys, a més dels importants avenços tècnics que han sorgit. Aquestes xarxes es preveuen com un tipus important de xarxes d'accés de nova generació, a on els serveis multimèdia seran requerits pels usuaris a través dels seus dispositius sense fils desde tot arreu. En aquesta tesi, centrem el nostre treball especialment en les xarxes mòbils ad hoc (MANET, Mobile Ad hoc Network) i en les xarxes vehiculars ad hoc (VANET, Vehicular Ad hoc Network). Les característiques especials de les MANETs i les VANETs, com la mobilitat, la topologia dinàmica de la xarxa (especialment en VANETs), les restriccions de bateria (en cas de MANETs), l'absència d'infrastructura i la capacitat variable de l'enllaç sense fil fa que la provisió de la qualitat de servei en aquestes xarxes sigui un repte important per a la comunitat científica. A causa d'això, hi ha la necessitat de desenvolupar nous protocols d'encaminament especialment dissenyats per a MANETs i VANETs capaços de proporcionar els serveis de multimèdia requerits. L'objectiu principal d'aquesta tesi és proveir millores en la comunicació per a les xarxes ad hoc MANET i VANET per millorar les decisions a l'hora de seleccionar els propers camins o nodes, respectivament, en el moment de l'enviament de les trames del video. D'aquesta manera serà possible tenir una resposta ràpida per resoldre els problema diaris a la ciutat i ajudar a les unitats d'emergència (per exemple, policia, ambulàncies, unitats de salut) en cas d'incidents, com ara els accidents de trànsit. Per analitzar adequadament les nostres propostes sobre VANETs hem dissenyat un entorn de simulació realista que incorpora la presència d'edificis en mapes reals i en el cas que hi hagi un obstacle entre el node actual i el candidat per a ser el pròxim salt el paquet s'emmagatzema en un buffer, per un temps màxim, fins a trobar un nou candidat; en cas contrari, es descarta el paquet. Per millorar les comunicacions en les MANETs, proposem un nou protocol d'encaminament basat en teoria de jocs per a N usuaris especialment dissenyat per a enviar missatges de vídeo. Això fa que la xarxa sigui més eficient, i així s'aconsegueix un major grau de satisfacció dels usuaris en rebre molts més paquets amb un menor retard mig extrem a extrem, menor variació del retard (jitter ) i major PSNR (Relació Senyal Soroll de Pic) . A més, es proposa un protocol d'encaminament geogràfic basat en el reenviament hop-by-hop per a VANETs anomenat 3MRP (Multimedia Multimetric Map-Aware Routing Protocol ) [1] que prèn en consideració múltiples mètriques. Les mètriques considerades en 3MRP són la distància a destinació, la densitat de vehicles en el rang de transmissió, l'ample de banda disponible, la trajectòria futura dels nodes veíns i la perdua de paquets a la capa MAC. Aquestes mètriques es ponderen per a obtenir una puntuació multimètrica. Així, un node pot seleccionar el millor node de reenviament entre tots els seus veíns per augmentar la probabilitat d' èxit de lliurament de paquets, minimitzant el retard mitjà dels paquets i oferint un cert nivell de qualitat de servei.Las redes ad hoc han llamado mucho la atención por parte de la comunidad científica en los últimos años, además de los importantes avances técnicos que han surgido. Estas redes se prevén como un tipo importante de redes de acceso de nueva generación, donde los servicios multimedia sean requeridos por los usuarios a través de sus dispositivos inalámbricos desde todas partes. En esta tesis, centramos nuestro trabajo de investigación especialmente en las redes móviles ad hoc (MANET, Mobile Ad hoc Network) y las redes vehiculares ad hoc (VANET, Vehicular Ad hoc Network). Las características especiales de las MANETs y las VANETs, como la movilidad, la topología dinámica de la red (especialmente en VANETs), las restricciones de batería (en caso de MANETs), la ausencia de infraestructura y la capacidad variable del enlace inalámbrico hace que la provisión de la calidad de servicio en estas redes sea un reto importante para la comunidad científica. Debido a esto, existe la necesidad de desarrollar nuevos protocolos de encaminamiento especialmente diseñados para MANETs y VANETs capaces de proporcionar los servicios de multimedia requeridos. El objetivo principal de esta tesis es proveer mejoras en la comunicación para las redes ad hoc MANET y VANET para mejorar las decisiones a la hora de seleccionar los próximos caminos o nodos, respectivamente, en el momento del envío de las tramas del video y de esta manera sería posible tener una respuesta rápida para resolver los problema diarios en la ciudad y ayudar a las unidades de emergencia (por ejemplo, policía, ambulancias, unidades de salud) en caso de incidentes, como accidentes de tráfico. Para analizar adecuadamente nuestras propuestas sobre VANETs hemos diseñado un entorno de simulación realista que incorpora la presencia de edificios en mapas reales. En el caso de que haya un obstáculo entre el nodo actual y el candidato para ser el próximo salto el paquete se almacena en un buer, durante un tiempo máximo, hasta encontrar un nuevo candidato; en caso contrario, se descarta el paquete. Para mejorar las comunicaciones en las MANETs, proponemos un nuevo protocolo de encaminamiento basado en teoría de juegos para N usuarios especialmente diseñados para enviar mensajes de video. Esto hace que la red sea más eficiente, y así se consigue un mayor grado de satisfacción de los usuarios al recibir muchos más paquetes con un menor promedio de retardo de extremo a extremo, variación de retardo (jitter) y mayor PSNR (Relación Señal a Ruido de Pico). Además, se propone un protocolo de encaminamiento geográfico basado en el reenvío de salto-a-salto para VANETs llamado 3MRP (Multimedia multimetric Map-Aware Routing Protocol) [1] que incluye diversas métricas. Las métricas consideradas en 3MRP son la distancia al destino, la densidad de vehículos en el rango de transmisión, el ancho de banda disponible, la trayectoria futura de los nodos vecinos y la pérdida de paquetes en la capa MAC. Estas métricas se ponderan para obtener una puntuación multimetricanal. Así, un nodo puede seleccionar el mejor nodo de reenvío entre todos sus vecinos para aumentar la probabilidad de éxito de entrega de paquetes, minimizando el retardo medio de los paquetes y ofreciendo un cierto nivel de calidad de servicio. Por otra parte, se ha diseñado un nuevo algoritmo capaz de dar a cada métrica su correspondiente peso en función de las condiciones actuales de la red. De esta forma, los nodos se pueden clasificar de una mejor manera. Por último, se propone un nuevo protocolo de encaminamiento para VANETs llamado G-3MRP (Game Theoretical Multimedia Multimetric Map-aware Routing Protocol) [2] para enviar mensajes de video basado en teoría de juegos para N usuarios en escenarios urbanos. G-3MRP se basa en el protocolo de encaminamiento 3MRP. G-3MRP utiliza hasta tres nodos a través de los cuales los tres tipos de cuadros de video I, P y B serán enviados. Las métricas utilizadas son las mismas que en 3MRP. G-3MRP logra una mayor grado de satisfacción de los usuarios mediante la recepción de muchos más paquetes de video y con un mayor nivel de PSNR, que la anterior propuesta 3MRP+DSW. También hemos analizado el problema de detección de obstáculos en mapas reales para VANETs en escenarios urbanos. Para este propósito, hemos desarrollado nuestra herramienta REVsim [3] de tal forma que puede estar fácilmente integrada en nuestra propuesta de protocolo de encaminamiento para que las simulaciones sean más realistas.Postprint (published version

Building Realistic Mobility Models for Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a self-configuring wireless network in which each node could act as a router, as well as a data source or sink. Its application areas include battlefields and vehicular and disaster areas. Many techniques applied to infrastructure-based networks are less effective in MANETs, with routing being a particular challenge. This paper presents a rigorous study into simulation techniques for evaluating routing solutions for MANETs with the aim of producing more realistic simulation models and thereby, more accurate protocol evaluations. MANET simulations require models that reflect the world in which the MANET is to operate. Much of the published research uses movement models, such as the random waypoint (RWP) model, with arbitrary world sizes and node counts. This paper presents a technique for developing more realistic simulation models to test and evaluate MANET protocols. The technique is animation, which is applied to a realistic scenario to produce a model that accurately reflects the size and shape of the world, node count, movement patterns, and time period over which the MANET may operate. The animation technique has been used to develop a battlefield model based on established military tactics. Trace data has been used to build a model of maritime movements in the Irish Sea. Similar world models have been built using the random waypoint movement model for comparison. All models have been built using the ns-2 simulator. These models have been used to compare the performance of three routing protocols: dynamic source routing (DSR), destination-sequenced distance-vector routing (DSDV), and ad hoc n-demand distance vector routing (AODV). The findings reveal that protocol performance is dependent on the model used. In particular, it is shown that RWP models do not reflect the performance of these protocols under realistic circumstances, and protocol selection is subject to the scenario to which it is applied. To conclude, it is possible to develop a range of techniques for modelling scenarios applicable to MANETs, and these simulation models could be utilised for the evaluation of routing protocols