Quality of service aware data dissemination in vehicular Ad Hoc networks

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

Improving quality of service through road side back-bone network in VANET

The vehicular ad hoc Networks (VANETs) are expected to support a large spectrum of traffic alert, dynamic route planning, file sharing, safety and infotainment applications to improve traffic management. User satisfaction plus in time delivery of real-time messages is the most significant quality evaluation criterion for vehicular applications. High mobility and rapidly changing topologies always lead to intermittent quality of services, higher delay and packet dropping issues in network. To improve the quality of services for multi-hop and dynamic environment, different types of solutions have been proposed. The article introduces multi-protocol label switching based on roadside backbone network to provide widespread, scalable, high-speed, robust quality of services and improve network efficiency. The simulation results showed that proposed model improves data transmission and routing performance in terms of data delivery, throughput, end-to-end delay and achieve adequate utilization of resources

Design and analysis of a beacon-less routing protocol for large volume content dissemination in vehicular ad hoc networks

Largevolumecontentdisseminationispursuedbythegrowingnumberofhighquality applications for Vehicular Ad hoc NETworks(VANETs), e.g., the live road surveillance service and the video-based overtaking assistant service. For the highly dynamical vehicular network topology, beacon-less routing protocols have been proven to be efficient in achieving a balance between the system performance and the control overhead. However, to the authors’ best knowledge, the routing design for large volume content has not been well considered in the previous work, which will introduce new challenges, e.g., the enhanced connectivity requirement for a radio link. In this paper, a link Lifetime-aware Beacon-less Routing Protocol (LBRP) is designed for large volume content delivery in VANETs. Each vehicle makes the forwarding decision based on the message header information and its current state, including the speed and position information. A semi-Markov process analytical model is proposed to evaluate the expected delay in constructing one routing path for LBRP. Simulations show that the proposed LBRP scheme outperforms the traditional dissemination protocols in providing a low end-to-end delay. The analytical model is shown to exhibit a good match on the delay estimation with Monte Carlo simulations, as well

An effective transmit packet coding with trust-based relay nodes in VANETs

ehicular ad-hoc networks (VANETs) are characterized by limited network resources such as limited bandwidth and battery capacity. Hence, it is necessary that unnecessary use of network resources (such as unnecessary packet transfers) is reduced in such networks so that the available power can be conserved for efficient multicast communications. In this paper, we have presented a Transmit Packet Coding (TPC) Network Coding in VANET to ensure reliable and efficient multicasting. With network coding, the number of transmitted packets over the network can be reduced, ensuring efficient utilization of network devices and resources. Here, the trust-based graph optimization is performed using Cuckoo search algorithm to select the secure relay nodes. The experimental results showed the superiority of the presented approach compared to the existing techniques in terms of throughput, latency, hop delay, packet delivery ratio, network decoder outage probability, and block error rate

Reliable and efficient data dissemination schemein VANET: a review

Vehicular ad-hoc network (VANET), identified as a mobile ad hoc network MANETs with several added constraints. Basically, in VANETs, the network is established on the fly based on the availability of vehicles on roads and supporting infrastructures along the roads, such as base stations. Vehicles and road-side infrastructures are required to provide communication facilities, particularly when enough vehicles are not available on the roads for effective communication. VANETs are crucial for providing a wide range of safety and non-safety applications to road users. However, the specific fundamental problem in VANET is the challenge of creating effective communication between two fast-moving vehicles. Therefore, message routing is an issue for many safety and non-safety of VANETs applications. The challenge in designing a robust but reliable message dissemination technique is primarily due to the stringent QoS requirements of the VANETs safety applications. This paper investigated various methods and conducted literature on an idea to develop a model for efficient and reliable message dissemination routing techniques in VANET

Achieving reliable and enhanced communication in vehicular ad hoc networks (VANETs)

A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirement for the degree of Doctor of PhilosophyWith the envisioned age of Internet of Things (IoTs), different aspects of Intelligent Transportation System (ITS) will be linked so as to advance road transportation safety, ease congestion of road traffic, lessen air pollution, improve passenger transportation comfort and significantly reduce road accidents. In vehicular networks, regular exchange of current position, direction, speed, etc., enable mobile vehicle to foresee an imminent vehicle accident and notify the driver early enough in order to take appropriate action(s) or the vehicle on its own may take adequate preventive measures to avert the looming accident. Actualizing this concept requires use of shared media access protocol that is capable of guaranteeing reliable and timely broadcast of safety messages. This dissertation investigates the use of Network Coding (NC) techniques to enrich the content of each transmission and ensure improved high reliability of the broadcasted safety messages with less number of retransmissions. A Code Aided Retransmission-based Error Recovery (CARER) protocol is proposed. In order to avoid broadcast storm problem, a rebroadcasting vehicle selection metric η, is developed, which is used to select a vehicle that will rebroadcast the received encoded message. Although the proposed CARER protocol demonstrates an impressive performance, the level of incurred overhead is fairly high due to the use of complex rebroadcasting vehicle selection metric. To resolve this issue, a Random Network Coding (RNC) and vehicle clustering based vehicular communication scheme with low algorithmic complexity, named Reliable and Enhanced Cooperative Cross-layer MAC (RECMAC) scheme, is proposed. The use of this clustering technique enables RECMAC to subdivide the vehicular network into small manageable, coordinated clusters which further improve transmission reliability and minimise negative impact of network overhead. Similarly, a Cluster Head (CH) selection metric ℱ(\u1d457) is designed, which is used to determine and select the most suitably qualified candidate to become the CH of a particular cluster. Finally, in order to investigate the impact of available radio spectral resource, an in-depth study of the required amount of spectrum sufficient to support high transmission reliability and minimum latency requirements of critical road safety messages in vehicular networks was carried out. The performance of the proposed schemes was clearly shown with detailed theoretical analysis and was further validated with simulation experiments

UAV-assisted data dissemination based on network coding in vehicular networks

Efficient and emergency data dissemination service in vehicular networks (VN) is very important in some situations, such as earthquakes, maritime rescue, and serious traffic accidents. Data loss frequently occurs in the data transition due to the unreliability of the wireless channel and there are no enough available UAVs providing data dissemination service for the large disaster areas. UAV with an adjustable active antenna can be used in light of the situation. However, data dissemination assisted by UAV with the adjustable active antenna needs corresponding effective data dissemination framework. A UAV-assisted data dissemination method based on network coding is proposed. First, the graph theory to model the state of the data loss of the vehicles is used; the data dissemination problem is transformed as the maximum clique problem of the graph. With the coverage of the directional antenna being limited, a parallel method to find the maximum clique based on the region division is proposed. Lastly, the method\u27s effectiveness is demonstrated by the simulation; the results show that the solution proposed can accelerate the solving process of finding the maximum clique and reduce the number of UAV broadcasts. This manuscript designs a novel scheme for the UAV-assisted data dissemination in vehicular networks based on network coding. The graph theory is used to model the state of the data loss of the vehicles. With the coverage of the directional antenna being limited, then a parallel method is proposed to find the maximum clique of the graph based on the region division. The effectiveness of the method is demonstrated by the simulation

Supporting Protocols for Structuring and Intelligent Information Dissemination in Vehicular Ad Hoc Networks

The goal of this dissertation is the presentation of supporting protocols for structuring and intelligent data dissemination in vehicular ad hoc networks (VANETs). The protocols are intended to first introduce a structure in VANETs, and thus promote the spatial reuse of network resources. Segmenting a flat VANET in multiple cluster structures allows for more efficient use of the available bandwidth, which can effectively increase the capacity of the network. The cluster structures can also improve the scalability of the underlying communication protocols. The structuring and maintenance of the network introduces additional overhead. The aim is to provide a mechanism for creating stable cluster structures in VANETs, and to minimize this associated overhead. Further a hybrid overlay-based geocast protocol for VANETs is presented. The protocol utilizes a backbone overlay virtual infrastructure on top of the physical network to provide geocast support, which is crucial for intervehicle communications since many applications provide group-oriented and location-oriented services. The final contribution is a structureless information dissemination scheme which creates a layered view of road conditions with a diminishing resolution as the viewing distance increases. Namely, the scheme first provides a high-detail local view of a given vehicle\u27s neighbors and its immediate neighbors, which is further extended when information dissemination is employed. Each vehicle gets aggregated information for road conditions beyond this extended local view. The scheme allows for the preservation of unique reports within aggregated frames, such that safety critical notifications are kept in high detail, all for the benefit of the driver\u27s improved decision making during emergency scenarios