1,216 research outputs found

    Quality of service aware data dissemination in vehicular Ad Hoc networks

    Full text link
    Des systĂšmes de transport intelligents (STI) seront Ă©ventuellement fournis dans un proche avenir pour la sĂ©curitĂ© et le confort des personnes lors de leurs dĂ©placements sur les routes. Les rĂ©seaux ad-hoc vĂ©hiculaires (VANETs) reprĂ©sentent l'Ă©lĂ©ment clĂ© des STI. Les VANETs sont formĂ©s par des vĂ©hicules qui communiquent entre eux et avec l'infrastructure. En effet, les vĂ©hicules pourront Ă©changer des messages qui comprennent, par exemple, des informations sur la circulation routiĂšre, les situations d'urgence et les divertissements. En particulier, les messages d'urgence sont diffusĂ©s par des vĂ©hicules en cas d'urgence (p.ex. un accident de voiture); afin de permettre aux conducteurs de rĂ©agir Ă  temps (p.ex., ralentir), les messages d'urgence doivent ĂȘtre diffusĂ©s de maniĂšre fiable dans un dĂ©lai trĂšs court. Dans les VANETs, il existe plusieurs facteurs, tels que le canal Ă  pertes, les terminaux cachĂ©s, les interfĂ©rences et la bande passante limitĂ©e, qui compliquent Ă©normĂ©ment la satisfaction des exigences de fiabilitĂ© et de dĂ©lai des messages d'urgence. Dans cette thĂšse, en guise de premiĂšre contribution, nous proposons un schĂ©ma de diffusion efficace Ă  plusieurs sauts, appelĂ© Dynamic Partitioning Scheme (DPS), pour diffuser les messages d'urgence. DPS calcule les tailles de partitions dynamiques et le calendrier de transmission pour chaque partition; Ă  l'intĂ©rieur de la zone arriĂšre de l'expĂ©diteur, les partitions sont calculĂ©es de sorte qu'en moyenne chaque partition contient au moins un seul vĂ©hicule; l'objectif est de s'assurer que seul un vĂ©hicule dans la partition la plus Ă©loignĂ©e (de l'expĂ©diteur) est utilisĂ© pour diffuser le message, jusqu'au saut suivant; ceci donne lieu Ă  un dĂ©lai d'un saut plus court. DPS assure une diffusion rapide des messages d'urgence. En outre, un nouveau mĂ©canisme d'Ă©tablissement de liaison, qui utilise des tonalitĂ©s occupĂ©es, est proposĂ© pour rĂ©soudre le problĂšme du problĂšme de terminal cachĂ©. Dans les VANETs, la Multidiffusion, c'est-Ă -dire la transmission d'un message d'une source Ă  un nombre limitĂ© de vĂ©hicules connus en tant que destinations, est trĂšs importante. Par rapport Ă  la diffusion unique, avec Multidiffusion, la source peut simultanĂ©ment prendre en charge plusieurs destinations, via une arborescence de multidiffusion, ce qui permet d'Ă©conomiser de la bande passante et de rĂ©duire la congestion du rĂ©seau. Cependant, puisque les VANETs ont une topologie dynamique, le maintien de la connectivitĂ© de l'arbre de multidiffusion est un problĂšme majeur. Comme deuxiĂšme contribution, nous proposons deux approches pour modĂ©liser l'utilisation totale de bande passante d'une arborescence de multidiffusion: (i) la premiĂšre approche considĂšre le nombre de segments de route impliquĂ©s dans l'arbre de multidiffusion et (ii) la seconde approche considĂšre le nombre d'intersections relais dans l'arbre de multidiffusion. Une heuristique est proposĂ©e pour chaque approche. Pour assurer la qualitĂ© de service de l'arbre de multidiffusion, des procĂ©dures efficaces sont proposĂ©es pour le suivi des destinations et la surveillance de la qualitĂ© de service des segments de route. Comme troisiĂšme contribution, nous Ă©tudions le problĂšme de la congestion causĂ©e par le routage du trafic de donnĂ©es dans les VANETs. Nous proposons (1) une approche de routage basĂ©e sur l’infonuagique qui, contrairement aux approches existantes, prend en compte les chemins de routage existants qui relaient dĂ©jĂ  les donnĂ©es dans les VANETs. Les nouvelles demandes de routage sont traitĂ©es de sorte qu'aucun segment de route ne soit surchargĂ© par plusieurs chemins de routage croisĂ©s. Au lieu d'acheminer les donnĂ©es en utilisant des chemins de routage sur un nombre limitĂ© de segments de route, notre approche Ă©quilibre la charge des donnĂ©es en utilisant des chemins de routage sur l'ensemble des tronçons routiers urbains, dans le but d'empĂȘcher, dans la mesure du possible, les congestions locales dans les VANETs; et (2) une approche basĂ©e sur le rĂ©seau dĂ©fini par logiciel (SDN) pour surveiller la connectivitĂ© VANET en temps rĂ©el et les dĂ©lais de transmission sur chaque segment de route. Les donnĂ©es de surveillance sont utilisĂ©es en entrĂ©e de l'approche de routage.Intelligent Transportation Systems (ITS) will be eventually provided in the near future for both safety and comfort of people during their travel on the roads. Vehicular ad-hoc Networks (VANETs), represent the key component of ITS. VANETs consist of vehicles that communicate with each other and with the infrastructure. Indeed, vehicles will be able to exchange messages that include, for example, information about road traffic, emergency situations, and entertainment. Particularly, emergency messages are broadcasted by vehicles in case of an emergency (e.g., car accident); in order to allow drivers to react in time (e.g., slow down), emergency messages must be reliably disseminated with very short delay. In VANETs, there are several factors, such as lossy channel, hidden terminals, interferences and scarce bandwidth, which make satisfying reliability and delay requirements of emergency messages very challenging. In this thesis, as the first contribution, we propose a reliable time-efficient and multi-hop broadcasting scheme, called Dynamic Partitioning Scheme (DPS), to disseminate emergency messages. DPS computes dynamic partition sizes and the transmission schedule for each partition; inside the back area of the sender, the partitions are computed such that in average each partition contains at least a single vehicle; the objective is to ensure that only a vehicle in the farthest partition (from the sender) is used to disseminate the message, to next hop, resulting in shorter one hop delay. DPS ensures fast dissemination of emergency messages. Moreover, a new handshaking mechanism, that uses busy tones, is proposed to solve the problem of hidden terminal problem. In VANETs, Multicasting, i.e. delivering a message from a source to a limited known number of vehicles as destinations, is very important. Compared to Unicasting, with Multicasting, the source can simultaneously support multiple destinations, via a multicast tree, saving bandwidth and reducing overall communication congestion. However, since VANETs have a dynamic topology, maintaining the connectivity of the multicast tree is a major issue. As the second contribution, we propose two approaches to model total bandwidth usage of a multicast tree: (i) the first approach considers the number of road segments involved in the multicast tree and (ii) the second approach considers the number of relaying intersections involved in the multicast tree. A heuristic is proposed for each approach. To ensure QoS of the multicasting tree, efficient procedures are proposed for tracking destinations and monitoring QoS of road segments. As the third contribution, we study the problem of network congestion in routing data traffic in VANETs. We propose (1) a Cloud-based routing approach that, in opposition to existing approaches, takes into account existing routing paths which are already relaying data in VANETs. New routing requests are processed such that no road segment gets overloaded by multiple crossing routing paths. Instead of routing over a limited set of road segments, our approach balances the load of communication paths over the whole urban road segments, with the objective to prevent, whenever possible, local congestions in VANETs; and (2) a Software Defined Networking (SDN) based approach to monitor real-time VANETs connectivity and transmission delays on each road segment. The monitoring data is used as input to the routing approach

    A Driving Path Based Opportunistic Routing in Vehicular Ad Hoc Network

    Get PDF
    Vehicular Ad Hoc Networks is a promising technologythat can widely apply to monitor the physical world in urban areas.Efficient data delivery is important in these networks and optimalroute selection is vital to improve this factor. Vehicular mobility isa reflection of human social activity and human trajectories show ahigh degree of temporal and spatial regularity. Therefore, vehiculardriving paths are predictable in a large extent. A new opportunisticrouting protocol (DPOR) is proposed in this study that uses drivingpath predictability and vehicular distribution in its route selectionprocedure. This protocol is composed of two phases: intersectionand next hop selection phases. A utility function is calculated toselect the next intersection and a new mechanism is also proposedfor the next hop selection phase. Simulation results show thatDPOR achieves high delivery ratio and low end-to-end delay in thenetwork

    Contribution to design a communication framework for vehicular ad hoc networks in urban scenarios

    Get PDF
    The constant mobility of people, the growing need to be always connected, the large number of vehicles that nowadays can be found in the roads and the advances in technology make Vehicular Ad hoc Networks (VANETs) be a major area of research. Vehicular Ad hoc Networks are a special type of wireless Mobile Ad hoc Networks (MANETs), which allow a group of mobile nodes configure a temporary network and maintain it without the need of a fixed infrastructure. A vehicular network presents some specific characteristics, as the very high speed of nodes. Due to this high speed the topology changes are frequent and the communication links may last only a few seconds. Smart cities are now a reality and have a direct relationship with vehicular networks. With the help of existing infrastructure such as traffic lights, we propose a scheme to update and analyse traffic density and a warning system to spread alert messages. With this, traffic lights assist vehicular networks to take proper decisions. This would ensure less congested streets. It would also be possible that the routing protocol forwards data packets to vehicles on streets with enough neighbours to increase the possibility of delivering the packets to destination. Sharing updated, reliable and real-time information, about traffic conditions, weather or security alerts, increases the need of algorithms for the dissemination of information that take into account the main beneffits and constraints of these networks. For all this, routing protocols for vehicular networks have the difficult task to select and establish transmission links to send the data packets from source to destination through multiple nodes using intermediate vehicles efficiently. The main objective of this thesis is to provide improvements in the communication framework for vehicular networks to improve decisions to select next hops in the moment to send information, in this way improving the exchange of information to provide suitable communication to minimize accidents, reduce congestion, optimize resources for emergencies, etc. Also, we include intelligence to vehicles at the moment to take routing decisions. Making them map-aware, being conscious of the presence of buildings and other obstacles in urban environments. Furthermore, our proposal considers the decision to store packets for a maximum time until finding other neighbouring nodes to forward the packets before discarding them. For this, we propose a protocol that considers multiple metrics that we call MMMR (A Multimetric, Map-Aware Routing Protocol ). MMMR is a protocol based on geographical knowledge of the environment and vehicle location. The metrics considered are the distance, the density of vehicles in transmission range, the available bandwidth and the future trajectory of the neighbouring nodes. This allows us to have a complete view of the vehicular scenario to anticipate the driver about possible changes that may occur. Thus, a node can select a node among all its neighbours, which is the best option to increase the likelihood of successful packet delivery, minimizing time and offering a level of quality and service. In the same way, being aware of the increase of information in wireless environments, we analyse the possibility of offering anonymity services. We include a mechanism of anonymity in routing protocols based on the Crowd algorithm, which uses the idea of hiding the original source of a packet. This allowed us to add some level of anonymity on VANET routing protocols. The analytical modeling of the available bandwidth between nodes in a VANET, the use of city infrastructure in a smart way, the forwarding selection in data routing byvehicles and the provision of anonymity in communications, are issues that have been addressed in this PhD thesis. In our research work we provide contributions to improve the communication framework for Vehicular Ad hoc Networks obtaining benefits toenhance the everyday of the population.La movilidad constante de las personas y la creciente necesidad de estar conectados en todo momento ha hecho de las redes vehiculares un ĂĄrea cuyo interĂ©s ha ido en aumento. La gran cantidad de vehĂ­culos que hay en la actualidad, y los avances tecnolĂłgicos han hecho de las redes vehiculares (VANETS, Vehicular Ad hoc Networks) un gran campo de investigaciĂłn. Las redes vehiculares son un tipo especial de redes mĂłviles ad hoc inalĂĄmbricas, las cuales, al igual que las redes MANET (Mobile Ad hoc Networks), permiten a un grupo de nodos mĂłviles tanto configurar como mantener una red temporal por si mismos sin la necesidad de una infraestructura fija. Las redes vehiculares presentan algunas caracterĂ­sticas muy representativas, por ejemplo, la alta velocidad que pueden alcanzar los nodos, en este caso vehĂ­culos. Debido a esta alta velocidad la topologĂ­a cambia frecuentemente y la duraciĂłn de los enlaces de comunicaciĂłn puede ser de unos pocos segundos. Estas redes tienen una amplia ĂĄrea de aplicaciĂłn, pudiendo tener comunicaciĂłn entre los mismos nodos (V2V) o entre los vehĂ­culos y una infraestructura fija (V2I). Uno de los principales desafĂ­os existentes en las VANET es la seguridad vial donde el gobierno y fabricantes de automĂłviles han centrado principalmente sus esfuerzos. Gracias a la rĂĄpida evoluciĂłn de las tecnologĂ­as de comunicaciĂłn inalĂĄmbrica los investigadores han logrado introducir las redes vehiculares dentro de las comunicaciones diarias permitiendo una amplia variedad de servicios para ofrecer. Las ciudades inteligentes son ahora una realidad y tienen una relaciĂłn directa con las redes vehiculares. Con la ayuda de la infraestructura existente, como semĂĄforos, se propone un sistema de anĂĄlisis de densidad de trĂĄfico y mensajes de alerta. Con esto, los semĂĄforos ayudan a la red vehicular en la toma de decisiones. AsĂ­ se lograrĂĄ disponer de calles menos congestionadas para hacer una circulaciĂłn mĂĄs fluida (lo cual disminuye la contaminaciĂłn). AdemĂĄs, serĂ­a posible que el protocolo de encaminamiento de datos elija vehĂ­culos en calles con suficientes vecinos para incrementar la posibilidad de entregar los paquetes al destino (minimizando pĂ©rdidas de informaciĂłn). El compartir informaciĂłn actualizada, confiable y en tiempo real sobre el estado del trĂĄfico, clima o alertas de seguridad, aumenta la necesidad de algoritmos de difusiĂłn de la informaciĂłn que consideren los principales beneficios y restricciones de estas redes. AsĂ­ mismo, considerar servicios crĂ­ticos que necesiten un nivel de calidad y servicio es otro desafĂ­o importante. Por todo esto, un protocolo de encaminamiento para este tipo de redes tiene la difĂ­cil tarea de seleccionar y establecer enlaces de transmisiĂłn para enviar los datos desde el origen hacia el destino vĂ­a mĂșltiples nodos utilizando vehĂ­culos intermedios de una manera eficiente. El principal objetivo de esta tesis es ofrecer mejoras en los sistemas de comunicaciĂłn vehicular que mejoren la toma de decisiones en el momento de realizar el envĂ­o de la informaciĂłn, con lo cual se mejora el intercambio de informaciĂłn para poder ofrecer comunicaciĂłn oportuna que minimice accidentes, reduzca atascos, optimice los recursos destinados a emergencias, etc. AsĂ­ mismo, incluimos mĂĄs inteligencia a los coches en el momento de tomar decisiones de encaminamiento de paquetes. HaciĂ©ndolos conscientes de la presencia de edificios y otros obstĂĄculos en los entornos urbanos. AsĂ­ como tomar la decisiĂłn de guardar paquetes durante un tiempo mĂĄximo de modo que se encuentre otros nodos vecinos para encaminar paquetes de informaciĂłn antes de descartarlo. Para esto, proponemos un protocolo basado en mĂșltiples mĂ©tricas (MMMR, A Multimetric, Map-aware Routing Protocol ) que es un protocolo geogrĂĄfio basado en el conocimiento del entorno y localizaciĂłn de los vehĂ­culos. Las mĂ©tricas consideradas son la distancia, la densidad de vehĂ­culos en el ĂĄrea de transmisiĂłn, el ancho de banda disponible y la trayectoria futura de los nodos vecinos. Esto nos permite tener una visiĂłn completa del escenario vehicular y anticiparnos a los posibles cambios que puedan suceder. AsĂ­, un nodo podrĂĄ seleccionar aquel nodo entre todos sus vecinos posibles que sea la mejor opciĂłn para incrementar la posibilidad de entrega exitosa de paquetes, minimizando tiempos y ofreciendo un cierto nivel de calidad y servicio. De la misma manera, conscientes del incremento de informaciĂłn que circula por medios inalĂĄmbricos, se analizĂł la posibilidad de servicios de anonimato. Incluimos pues un mecanismo de anonimato en protocolos de encaminamiento basado en el algoritmo Crowd, que se basa en la idea de ocultar la fuente original de un paquete. Esto nos permitiĂł añadir cierto nivel de anonimato que pueden ofrecer los protocolos de encaminamiento. El modelado analĂ­tico del ancho de banda disponible entre nodos de una VANET, el uso de la infraestructura de la ciudad de una manera inteligente, la adecuada toma de decisiones de encaminamiento de datos por parte de los vehĂ­culos y la disposiciĂłn de anonimato en las comunicaciones, son problemas que han sido abordados en este trabajo de tesis doctoral que ofrece contribuciones a la mejora de las comunicaciones en redes vehiculares en entornos urbanos aportando beneficios en el desarrollo de la vida diaria de la poblaciĂłn

    Leveraging Communicating UAVs for Emergency Vehicle Guidance in Urban Areas

    Get PDF
    International audienceThe response time to emergency situations in urban areas is considered as a crucial key in limiting material damage or even saving human lives. Thanks to their "bird's eye view" and their flexible mobility, Unmanned Aerial Vehicles (UAVs) can be a promising candidate for several vital applications. Under these perspectives, we investigate the use of communicating UAVs to detect any incident on the road, provide rescue teams with their exact locations, and plot the fastest path to intervene, while considering the constraints of the roads. To efficiently inform the rescue services, a robust routing scheme is introduced to ensure a high level of communication stability based on an efficient backbone, while considering both the high mobility and the restricted energy capacity of UAVs. This allows both predicting any routing path breakage prior to its occurrence, and carrying out a balanced energy consumption among UAVs. To ensure a rapid intervention by rescue teams, UAVs communicate in an ad hoc fashion with existing vehicles on the ground to estimate the fluidity of the roads. Our system is implemented and evaluated through a series of experiments. The reported results show that each part of the system reliably succeeds in achieving its planned objective

    Multi-metric Geographic Routing for Vehicular Ad hoc Networks

    Get PDF
    Maintaining durable connectivity during data forwarding in Vehicular Ad hoc Networks has witnessed significant attention in the past few decades with the aim of supporting most modern applications of Intelligent Transportation Systems (ITS). Various techniques for next hop vehicle selection have been suggested in the literature. Most of these techniques are based on selection of next hop vehicles from fixed forwarding region with two or three metrics including speed, distance and direction, and avoid many other parameters of urban environments. In this context, this paper proposes a Multi-metric Geographic Routing (M-GEDIR) technique for next hop selection. It selects next hop vehicles from dynamic forwarding regions, and considers major parameters of urban environments including, received signal strength, future position of vehicles, and critical area vehicles at the border of transmission range, apart from speed, distance and direction. The performance of M-GEDIR is evaluated carrying out simulations on realistic vehicular traffic environments. In the comparative performance evaluation, analysis of results highlight the benefit of the proposed geographic routing as compared to the state-of-the-art routing protocols

    OBPF: Opportunistic Beaconless Packet Forwarding Strategy for Vehicular Ad Hoc Networks

    Full text link
    [EN] In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.The authors would like to extend their sincere appreciation to the Deanship of Scientific Research at King Saud University for funding this research. The research is supported by Ministry of Education Malaysia (MOE) and conducted in collaboration with Research Management Center (RMC) at Universiti Teknologi Malaysia (UTM) under VOT NUMBER: QJ130000.2528.06H00.Qureshi, KN.; Abdullah, AH.; Lloret, J.; Altameem, A. (2016). OBPF: Opportunistic Beaconless Packet Forwarding Strategy for Vehicular Ad Hoc Networks. KSII Transactions on Internet and Information Systems. 10(5):2144-2165. https://doi.org/10.3837/tiis.2016.05.011S2144216510
    • 

    corecore