• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 10
  • 1
  • Tagged with
  • 11
  • 7
  • 5
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Dynamic Time-Stable Geocast Routing in Vehicular Ad Hoc Networks

Rahbar, Hamidreza January 2010 (has links)
Vehicular ad hoc networks (VANETs) have emerged as an area of interest for both industry and research scholars because they have become an essential part of intelligent transportation systems (ITSs). Many applications in VANET require sending a message to certain or all vehicles within a region, called geocast. Sometimes geocast requires that the message be kept alive within the region for a period of time. This time-stable geocast has a vital role in some ITS applications, particularly commercial applications. This study presents a novel time-stable geocast protocol that works well even in too sparse networks. Moreover, since commercial applications sometimes make it necessary to change the duration of the stable message within the region, the dynamic nature of a geocast protocol should allow this time to be extended, reduced, or canceled without any additional cost. Therefore, we call it a dynamic time-stable geocast, DTSG, protocol. It works in two phases (the pre-stable period and the stable period), and the simulation results show that it works well in its performance metrics (delivery ratio and network cost). In addition, these results validate the protocol prediction of its performance metrics. Moreover, with the informed time of zero, all the intended vehicles will be informed as soon as they enter the region. The fact that the protocol is independent of the networks’ density, the vehicles’ speed, and the vehicles’ broadcasting range, makes it more robust than others that fail in sparse networks or in high-speed nodes.
2

Dynamic Time-Stable Geocast Routing in Vehicular Ad Hoc Networks

Rahbar, Hamidreza January 2010 (has links)
Vehicular ad hoc networks (VANETs) have emerged as an area of interest for both industry and research scholars because they have become an essential part of intelligent transportation systems (ITSs). Many applications in VANET require sending a message to certain or all vehicles within a region, called geocast. Sometimes geocast requires that the message be kept alive within the region for a period of time. This time-stable geocast has a vital role in some ITS applications, particularly commercial applications. This study presents a novel time-stable geocast protocol that works well even in too sparse networks. Moreover, since commercial applications sometimes make it necessary to change the duration of the stable message within the region, the dynamic nature of a geocast protocol should allow this time to be extended, reduced, or canceled without any additional cost. Therefore, we call it a dynamic time-stable geocast, DTSG, protocol. It works in two phases (the pre-stable period and the stable period), and the simulation results show that it works well in its performance metrics (delivery ratio and network cost). In addition, these results validate the protocol prediction of its performance metrics. Moreover, with the informed time of zero, all the intended vehicles will be informed as soon as they enter the region. The fact that the protocol is independent of the networks’ density, the vehicles’ speed, and the vehicles’ broadcasting range, makes it more robust than others that fail in sparse networks or in high-speed nodes.
3

Semantic and Self-Decision Geocast Protocol for Data Dissemination over Vehicle Ad Hoc Network

Alsubaihi, Badr January 2014 (has links)
In this work, we provide a qualitative comparison between existing geocast protocols and then we present an efficient geocast routing protocol for VANET. This protocol is a semantic and self-decision geocast routing protocol for disseminating safety and non-safety information over VANET (SAS-GP). SAS-PG initially executes an algorithm to locally determine the semantic geocast area. Then, the protocol disseminates the information in three phases: Spread, Preserve, and Assurance, which utilize the traffic information system and the digital map. SAS-GP principally employs timer-based techniques in order to avoid overhead and broadcast storm problems; nonetheless, novel factors are enhanced to calculate the timer’s values in each phase. Simulation results demonstrate effective and reliable dissemination in terms of delivery ratio and number of false warnings compared to existing protocols when evaluated in high scale and realistic scenarios. Also, SAS-GP performs faster in notifying vehicles resulting in a higher geocast distance before approaching the location of the event.
4

Agrégation et dissémination de données dans un réseau véhiculaire VANET. / Data Dissemination and Aggregation in Vehicular Adhoc Network

Allani, Sabri 02 November 2018 (has links)
Cette thèse traite la problématique de la dissémination et l’agrégation des données dans un contexte de réseaux VANET (Vehicle Ad-Hoc Networks). Cette problématique est fort intéressante, toujours d’actualité dans un monde de plus en plus urbanisé. En effet, d’un côté la dissémination permet d’informer les véhicules mobiles des principaux événements en temps utile, et de l’autre côté l’agrégation permet de résumer plusieurs données émanant de sources différentes concernant le même événement. Le challenge de la dissémination consiste à calculer la zone de relevance d’un événement, de délivrer les messages aux véhicules de cette zone, et de continuer à délivrer les messages en continu aux véhicules de cette zone. Le challenge de l’agrégation consiste essentiellement à sélectionner les messages à agréger et à qualifier les messages provenant de véhicules lointains. Pour résoudre le problème de dissémination nous proposons un nouveau protocole de dissémination des données dans les réseaux VANET. La principale idée de ce protocole est basée sur la définition de zones de relevance ZOR (zone of relevance of a région) pour la mesure de l’intérêt d’une zone par rapport à un évènement donné, et la définition de split Map permettant de décomposer une grande région en un ensemble de ZORs. L’approche de calcul des ZORs est formalisée, elle est basée sur les techniques de greedy pour l’extraction de la couverture pertinente. Le protocole de dissémination présenté sous forme de diagramme Flowchart qui résumé les activités lorsque qu’un véhicule est en mouvement, un événement est détecté. La performance du protocole proposé est évaluée et comparé au protocole Slotted1-Persistence à travers un environnement de simulations et une topologie réelle de routes de la ville de Bizerte en Tunisie. Les résultats de simulation sont présentés et discutés.D’autre part, certaines applications VANET, par exemple le système d’information de trafic (TIS), nécessitent une agrégation de données pour informer les véhicules des conditions de circulation, ce qui réduit les embouteillages et par conséquent les émissions de CO2 Par conséquent, la conception d'un protocole d'agrégation efficace combinant des informations de trafic corrélées telles que l'emplacement, la vitesse et la direction, appelées données flottantes sur les voitures (FCD), pose un problème complexe. Dans cette thèse, nous introduisons un nouveau protocole d’agrégation de données dans un réseau VANET appelé SDDA (Smart Directional Data Aggregation). Ce protocole est dédié aussi bien à l’échange de données dans un contexte urbain et autoroutier. Le protocole proposé est basé sur une sélection des messages à agréger. Trois principaux filtres ont été utilisés : filtrage basé sur la direction des véhicules, filtrage basé sur la limitation de vitesse, et filtrage basé sur l’élimination des messages dupliqués. Trois algorithmes d’agrégation sont proposés, ils visent à optimiser l’algorithme de SOTIS. Les trois algorithmes traitent des cas de routes unidirectionnelles, bidirectionnelles et les réseaux urbains. A l’image du chapitre précédent, la performance des algorithmes proposés sont évaluées à travail un travail de simulation et différents résultats sont présentés et discutés. / Since the last decade, the emergence of affordable wireless devices in vehicle ad-hoc networks has been a key step towards improving road safety as well as transport efficiency. Informing vehicles about interesting safety and non-safety events is of key interest. Thus, the design of an efficient data dissemination protocol has been of paramount importance. A careful scrutiny of the pioneering vehicle-to-vehicle data dissemination approaches highlights that geocasting is the most feasible approach for VANET applications, more especially in safety applications, since safety events are of interest mainly to vehicles located within a specific area, commonly called ZOR or Zone Of Relevance, close to the event. Indeed, the most challenging issue in geocast protocols is the definition of the ZOR for a given event dissemination. In this thesis, our first contribution introduces a new geocast approach, called Data Dissemination Protocol based on Map Splitting(DPMS). The main thrust of DPMS consists of building the zones of relevance through the mining of correlations between vehicles’ trajectories and crossed regions. To do so, we rely on the Formal Concept Analysis (FCA), which is a method of extracting interesting clusters from relational data. The performed experiments show that DPMS outperforms its competitors in terms of effectiveness and efficiency. In another hand, some VANET applications, e.g., Traffic Information System (TIS), require data aggregation in order to inform vehicles about road traffic conditions, which leads to reduce traffic jams and consequently CO2 emission while increasing the user comfort. Therefore, the design of an efficient aggregation protocol that combines correlated traffic information like location, speed and direction known as Floating Car Data (FCD) is a challenging issue. In this thesis, we introduce a new TIS data aggregation protocol called Smart Directional Data Aggregation (SDDA) able to decrease the network overload while obtaining high accurate information on traffic conditions for large road sections. To this end, we introduce three levels of messages filtering: (i) filtering all FCD messages before the aggregation process based on vehicle directions and road speed limitations, (ii) integrating a suppression technique in the phase of information gathering in order to eliminate the duplicate data, and (iii) aggregating the filtered FCD data and then disseminating it to other vehicles. The performed experiments show that the SDDA outperforms existing approaches in terms of effectiveness and efficiency.
5

SIMULATION-BASED PERFORMANCE COMPARISONS OF GEOCAST ROUTING PROTOCOLS

Hequn, Zhang, Rui, Wang January 2014 (has links)
Intelligent Transportation System (ITS)  is the main research domain for making road transport safer and more comfortable. For the sake of increasing the benefits of ITS, projects about Inter-Vehicle Communication (IVC)  system have been proposed to make communications among vehicles possible, to exchange traffic information and avoid accidents. In order to create communication network among vehicles or between vehicles and infrastructure,  Vehicular Ad hoc Networks (VANETs) has been proposed. Many applications in VANETs need to send messages to vehicles within a specific geographic region. This behavior is called geocast and this specific geographic region is called the Zone of Relevance (ZOR). Some routing protocols which are related to Geocast have been proposed in literature for VANETs. So it is significant to evaluate and compare the performance of these known Geocast routing protocols. In this thesis, categories of the routing protocols, as well as communication forwarding schemes are introduced. The routing protocols in VANETs are also summarized and compared. In order to evaluate the performance of these protocols, the evaluation methods are proposed and then a Geocast routing simulator is designed and used to simulate the Geocast network environment and several Geocast routing protocols.
6

Reliable and Secure Geocasting in VANETs

Prado Bernia, Antonio 19 September 2012 (has links)
Current geocasting algorithms for VANETs are being designed to enable either private or reliable communications, but not both. Existing algorithms preserve privacy by minimizing the information used for routing, and sacrifice message delivery success. On the other hand, reliable protocols often store node information that can be used to compromise a vehicle's privacy. We have designed two private and reliable geocasting protocols for VANETs that ensure confidentiality. One is a probabilistic algorithm that uses direction-based dissemination, while the other is a deterministic algorithm that uses transmission-coverage dissemination. To preserve privacy, we create unlinkable and pseudonymous channels of communication with geocasting. For encryption and authentication, we use a public key technique. Our probabilistic forwarding model depends on message rate and cumulative payload, as well as the value of the angle of spreading of the direction-based scheme. To reduce message duplication, we apply dynamic traffic restriction and probabilistic forwarding techniques. The deterministic forwarding algorithm delays forwarding messages based on its uncovered transmission area after neighbouring nodes have broadcast the message. We prove that both algorithms ensure node privacy with appropriate message encryption security, and we ran simulations to demonstrate that both meet the message delivery requirements. From the gathered data, we observe that both algorithms behave differently depending on the scenario, with node density affecting the deterministic algorithm, while the angle of spreading does have a significant impact on the probabilistic protocol.
7

Reliable and Secure Geocasting in VANETs

Prado Bernia, Antonio 19 September 2012 (has links)
Current geocasting algorithms for VANETs are being designed to enable either private or reliable communications, but not both. Existing algorithms preserve privacy by minimizing the information used for routing, and sacrifice message delivery success. On the other hand, reliable protocols often store node information that can be used to compromise a vehicle's privacy. We have designed two private and reliable geocasting protocols for VANETs that ensure confidentiality. One is a probabilistic algorithm that uses direction-based dissemination, while the other is a deterministic algorithm that uses transmission-coverage dissemination. To preserve privacy, we create unlinkable and pseudonymous channels of communication with geocasting. For encryption and authentication, we use a public key technique. Our probabilistic forwarding model depends on message rate and cumulative payload, as well as the value of the angle of spreading of the direction-based scheme. To reduce message duplication, we apply dynamic traffic restriction and probabilistic forwarding techniques. The deterministic forwarding algorithm delays forwarding messages based on its uncovered transmission area after neighbouring nodes have broadcast the message. We prove that both algorithms ensure node privacy with appropriate message encryption security, and we ran simulations to demonstrate that both meet the message delivery requirements. From the gathered data, we observe that both algorithms behave differently depending on the scenario, with node density affecting the deterministic algorithm, while the angle of spreading does have a significant impact on the probabilistic protocol.
8

Optimisation des échanges dans le routage géocast pour les réseaux de Véhicules Ad Hoc VANETs. / Exchanges optimization in the geocast routing for vehicular Ad HOC Networks VANETs

Allal, Salim 10 December 2014 (has links)
Les travaux réalisés dans cette thèse traitent de l'optimisation des échanges dans les réseaux véhiculaires sans fil en mode sans infrastructure Ad Hoc (VANETs). Les VANETs sont une partie des systèmes de transports intelligents (STIs).Ces derniers essaient de répondre à la question de comment équiper les véhicules de systèmes de communications sans fil pour éviter les accidents, mieux gérer les embouteillages et avoir des.impacts économiques, énergétiques et environnementaux positifs. Les VANETs utilisent les équipements mis en place dans les véhicules par les STI pour assurer des communications sans fil autonomes (IEEE 802.11p, 3G, LTE, etc) entre les véhicules ou entre les véhicules et les infrastructures fixes. Avec de tels mécanismes de communication, un véhicule peut échanger des informations avec ses voisins proches à un saut ou loin à deux sauts et plus grâce à la technique de relayage des messages de la source à la destination à travers les véhicules intermédiaires. Afin d'assurer un cheminement optimal de ces messages, des protocoles de routage existent. Dans ce travail, nous proposons un nouveau concept de routage de type géocast pour lequel la littérature ne répond pas. Le routage géocast dans la littérature permettant d'acheminer un message d'un véhicule source unique vers tous les véhicules situés dans une zone de destination géographique bien définie, nous avons proposée de scinder cette zone de destination en plusieurs sous-zones géographiques. La solution que nous avons proposé est le protocole GeoSUZ qui permet d'optimiser les échanges dans le contexte de routage géocast multi-zones de destination. / Vehicular ad hoc networks (VANETs) are a part of intelligent transportation systems (ITS). These letter attempt to answer the question of how to equip vehicles with wireless communication means to avoid accidents, better manage congestion and have positive impact on economics, energy and environment. Indeed, with wireless communication mechanisms such as IEEE 802.11p, a vehicle may exchange information with its near neighbors at one hop or at two furthur hops trhough relaying messages technique across intermediate vehicles. Some of these messages may cover vehicles wich are in a defined geographical area and spread throughout the network will consume bandwidth and penalize other vehicles. This is the case for information on the road trafic, for example. In the latter case, routing protocols said Geocast are used for the dissemination of these messages. The protocols are used to route a message from a unique source to multiple destination vehicles locked in the same geographic area. In this thesis, we considered the case where we have several geographic areas of interest and have proposed a new Geocast routing mechanism, called GeoSUZ, for conveying a message optimally between a source and multiple destination areas. An optimized broadcasting mechanism within an area is also combined with GeoSUZ algorithm to ensure end-to-end routing with minimal overhead.
9

Reliable and Secure Geocasting in VANETs

Prado Bernia, Antonio January 2012 (has links)
Current geocasting algorithms for VANETs are being designed to enable either private or reliable communications, but not both. Existing algorithms preserve privacy by minimizing the information used for routing, and sacrifice message delivery success. On the other hand, reliable protocols often store node information that can be used to compromise a vehicle's privacy. We have designed two private and reliable geocasting protocols for VANETs that ensure confidentiality. One is a probabilistic algorithm that uses direction-based dissemination, while the other is a deterministic algorithm that uses transmission-coverage dissemination. To preserve privacy, we create unlinkable and pseudonymous channels of communication with geocasting. For encryption and authentication, we use a public key technique. Our probabilistic forwarding model depends on message rate and cumulative payload, as well as the value of the angle of spreading of the direction-based scheme. To reduce message duplication, we apply dynamic traffic restriction and probabilistic forwarding techniques. The deterministic forwarding algorithm delays forwarding messages based on its uncovered transmission area after neighbouring nodes have broadcast the message. We prove that both algorithms ensure node privacy with appropriate message encryption security, and we ran simulations to demonstrate that both meet the message delivery requirements. From the gathered data, we observe that both algorithms behave differently depending on the scenario, with node density affecting the deterministic algorithm, while the angle of spreading does have a significant impact on the probabilistic protocol.
10

Concurrent Geometric Routing

Adamek, Jordan Matthew 28 July 2017 (has links)
No description available.

Page generated in 0.0344 seconds