484 research outputs found

    Quality-Aware Broadcasting Strategies for Position Estimation in VANETs

    Full text link
    The dissemination of vehicle position data all over the network is a fundamental task in Vehicular Ad Hoc Network (VANET) operations, as applications often need to know the position of other vehicles over a large area. In such cases, inter-vehicular communications should be exploited to satisfy application requirements, although congestion control mechanisms are required to minimize the packet collision probability. In this work, we face the issue of achieving accurate vehicle position estimation and prediction in a VANET scenario. State of the art solutions to the problem try to broadcast the positioning information periodically, so that vehicles can ensure that the information their neighbors have about them is never older than the inter-transmission period. However, the rate of decay of the information is not deterministic in complex urban scenarios: the movements and maneuvers of vehicles can often be erratic and unpredictable, making old positioning information inaccurate or downright misleading. To address this problem, we propose to use the Quality of Information (QoI) as the decision factor for broadcasting. We implement a threshold-based strategy to distribute position information whenever the positioning error passes a reference value, thereby shifting the objective of the network to limiting the actual positioning error and guaranteeing quality across the VANET. The threshold-based strategy can reduce the network load by avoiding the transmission of redundant messages, as well as improving the overall positioning accuracy by more than 20% in realistic urban scenarios.Comment: 8 pages, 7 figures, 2 tables, accepted for presentation at European Wireless 201

    SDDV: scalable data dissemination in vehicular ad hoc networks

    Get PDF
    An important challenge in the domain of vehicular ad hoc networks (VANET) is the scalability of data dissemination. Under dense traffic conditions, the large number of communicating vehicles can easily result in a congested wireless channel. In that situation, delays and packet losses increase to a level where the VANET cannot be applied for road safety applications anymore. This paper introduces scalable data dissemination in vehicular ad hoc networks (SDDV), a holistic solution to this problem. It is composed of several techniques spread across the different layers of the protocol stack. Simulation results are presented that illustrate the severity of the scalability problem when applying common state-of-the-art techniques and parameters. Starting from such a baseline solution, optimization techniques are gradually added to SDDV until the scalability problem is entirely solved. Besides the performance evaluation based on simulations, the paper ends with an evaluation of the final SDDV configuration on real hardware. Experiments including 110 nodes are performed on the iMinds w-iLab.t wireless lab. The results of these experiments confirm the results obtained in the corresponding simulations

    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

    Optimisation of Mobile Communication Networks - OMCO NET

    Get PDF
    The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

    A Taxonomy for Congestion Control Algorithms in Vehicular Ad Hoc Networks

    Full text link
    One of the main criteria in Vehicular Ad hoc Networks (VANETs) that has attracted the researchers' consideration is congestion control. Accordingly, many algorithms have been proposed to alleviate the congestion problem, although it is hard to find an appropriate algorithm for applications and safety messages among them. Safety messages encompass beacons and event-driven messages. Delay and reliability are essential requirements for event-driven messages. In crowded networks where beacon messages are broadcasted at a high number of frequencies by many vehicles, the Control Channel (CCH), which used for beacons sending, will be easily congested. On the other hand, to guarantee the reliability and timely delivery of event-driven messages, having a congestion free control channel is a necessity. Thus, consideration of this study is given to find a solution for the congestion problem in VANETs by taking a comprehensive look at the existent congestion control algorithms. In addition, the taxonomy for congestion control algorithms in VANETs is presented based on three classes, namely, proactive, reactive and hybrid. Finally, we have found the criteria in which fulfill prerequisite of a good congestion control algorithm

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

    Get PDF
    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
    • 

    corecore