Un protocole de diffusion des messages dans les réseaux véhiculaires

De nos jours, la voiture est devenue le mode de transport le plus utilisé, mais malheureusement, il est accompagné d’un certain nombre de problèmes (accidents, pollution, embouteillages, etc.), qui vont aller en s’aggravant avec l’augmentation prévue du nombre de voitures particulières, malgré les efforts très importants mis en œuvre pour tenter de les réduire ; le nombre de morts sur les routes demeure très important. Les réseaux sans fil de véhicules, appelés VANET, qui consistent de plusieurs véhicules mobiles sans infrastructure préexistante pour communiquer, font actuellement l’objet d'une attention accrue de la part des constructeurs et des chercheurs, afin d’améliorer la sécurité sur les routes ou encore les aides proposées aux conducteurs. Par exemple, ils peuvent avertir d’autres automobilistes que les routes sont glissantes ou qu’un accident vient de se produire. Dans VANET, les protocoles de diffusion (broadcast) jouent un rôle très important par rapport aux messages unicast, car ils sont conçus pour transmettre des messages de sécurité importants à tous les nœuds. Ces protocoles de diffusion ne sont pas fiables et ils souffrent de plusieurs problèmes, à savoir : (1) Tempête de diffusion (broadcast storm) ; (2) Nœud caché (hidden node) ; (3) Échec de la transmission. Ces problèmes doivent être résolus afin de fournir une diffusion fiable et rapide. L’objectif de notre recherche est de résoudre certains de ces problèmes, tout en assurant le meilleur compromis entre fiabilité, délai garanti, et débit garanti (Qualité de Service : QdS). Le travail de recherche de ce mémoire a porté sur le développement d’une nouvelle technique qui peut être utilisée pour gérer le droit d’accès aux médias (protocole de gestion des émissions), la gestion de grappe (cluster) et la communication. Ce protocole intègre l'approche de gestion centralisée des grappes stables et la transmission des données. Dans cette technique, le temps est divisé en cycles, chaque cycle est partagé entre les canaux de service et de contrôle, et divisé en deux parties. La première partie s’appuie sur TDMA (Time Division Multiple Access). La deuxième partie s’appuie sur CSMA/CA (Carrier Sense Multiple Access / Collision Avoidance) pour gérer l’accès au medium. En outre, notre protocole ajuste d’une manière adaptative le temps consommé dans la diffusion des messages de sécurité, ce qui permettra une amélioration de la capacité des canaux. Il est implanté dans la couche MAC (Medium Access Control), centralisé dans les têtes de grappes (CH, cluster-head) qui s’adaptent continuellement à la dynamique des véhicules. Ainsi, l’utilisation de ce protocole centralisé nous assure une consommation efficace d’intervalles de temps pour le nombre exact de véhicules actifs, y compris les nœuds/véhicules cachés; notre protocole assure également un délai limité pour les applications de sécurité, afin d’accéder au canal de communication, et il permet aussi de réduire le surplus (overhead) à l’aide d’une propagation dirigée de diffusion.Nowadays, the car has become the most popular mode of transport, but unfortunately its use is accompanied by a number of problems (accidents, pollution, congestion, etc.). These problems will get worse with the increase in the number of passenger cars, despite very significant efforts made to reduce the number of road deaths, which is still very high. Wireless networks for vehicles called VANET (Vehicle Ad Hoc Networks), were developed when it became possible to connect several mobile vehicles without relying on pre existing communication infrastructures. These networks have currently become the subject of increased attention from manufacturers and researchers, due to their potential for improving road safety and/or offering assistance to drivers. They can, for example, alert other drivers that roads are slippery or that an accident has just occurred. In VANETs, broadcast protocols play a very important role compared to unicast protocols, since they are designed to communicate important safety messages to all nodes. Existing broadcast protocols are not reliable and suffer from several problems: (1) broadcast storms, (2) hidden nodes, and (3) transmission failures. These problems must solved if VANETs are to become reliable and able to disseminate messages rapidly. The aim of our research is to solve some of these problems while ensuring the best compromise among reliability, guaranteed transmission times and bandwidth (Quality of Service: QoS). The research in this thesis focuses on developing a new technique for managing medium access. This protocol incorporates the centralized management approach involving stable clusters. In this technique, time is divided into cycles; with each cycle being shared among the control and service channels, and is divided into two segments. The first is based on TDMA (Time Division Multiple Access) while the second is based on CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) to manage access to the medium. Furthermore, our protocol adaptively adjusts the time consumed in broadcasting safety messages, thereby improving channel capacity. It is implemented in the MAC (Medium Access Control), and centralized in stable cluster heads that are able to adapt to the dynamics of vehicles. This protocol provides a centralized and efficient use of time intervals for an exact number of active vehicles, including hidden nodes/vehicles. Our protocol also provides time intervals dedicated to security applications for providing access to communication channels, and also reduces overhead via directed diffusion of data. Keywords: Ad-hoc networks, VANET, Vehicle, Periodic Safety Messages, broadcast protocols, contention-free

A Comparative Survey of VANET Clustering Techniques

© 2016 Crown. A vehicular ad hoc network (VANET) is a mobile ad hoc network in which network nodes are vehicles - most commonly road vehicles. VANETs present a unique range of challenges and opportunities for routing protocols due to the semi-organized nature of vehicular movements subject to the constraints of road geometry and rules, and the obstacles which limit physical connectivity in urban environments. In particular, the problems of routing protocol reliability and scalability across large urban VANETs are currently the subject of intense research. Clustering can be used to improve routing scalability and reliability in VANETs, as it results in the distributed formation of hierarchical network structures by grouping vehicles together based on correlated spatial distribution and relative velocity. In addition to the benefits to routing, these groups can serve as the foundation for accident or congestion detection, information dissemination and entertainment applications. This paper explores the design choices made in the development of clustering algorithms targeted at VANETs. It presents a taxonomy of the techniques applied to solve the problems of cluster head election, cluster affiliation, and cluster management, and identifies new directions and recent trends in the design of these algorithms. Additionally, methodologies for validating clustering performance are reviewed, and a key shortcoming - the lack of realistic vehicular channel modeling - is identified. The importance of a rigorous and standardized performance evaluation regime utilizing realistic vehicular channel models is demonstrated

Resource sharing in vehicular cloud

Au cours des dernières années, on a observé l'intérêt croissant envers l'accessibilité à l'information et, en particulier, envers des approches innovantes utilisant les services à distance accessibles depuis les appareils mobiles à travers le monde. Parallèlement, la communication des véhicules, utilisant des capteurs embarqués et des dispositifs de communication sans fil, a été introduite pour améliorer la sécurité routière et l'expérience de conduite à travers ce qui est communément appelé réseaux véhiculaires (VANET). L'accès sans fil à l’Internet à partir des véhicules a déclenché l'émergence de nouveaux services pouvant être disponibles à partir ceux-ci. Par ailleurs, une extension du paradigme des réseaux véhiculaires a été récemment promue à un autre niveau. Le nuage véhiculaire (Vehicular Cloud) (VC) est la convergence ultime entre le concept de l’infonuagique (cloud computing) et les réseaux véhiculaires dans le but de l’approvisionnement et la gestion des services. Avec cette approche, les véhicules peuvent être connectés au nuage, où une multitude de services sont disponibles, ou ils peuvent aussi être des fournisseurs de services. Cela est possible en raison de la variété des ressources disponibles dans les véhicules: informatique, bande passante, stockage et capteurs. Dans cette thèse, on propose des méthodes innovantes et efficaces pour permettre la délivrance de services par des véhicules dans le VC. Plusieurs schémas, notamment la formation de grappes ou nuages de véhicules, la planification de transmission, l'annulation des interférences et l'affectation des fréquences à l'aide de réseaux définis par logiciel (SDN), ont été développés et leurs performances ont été analysées. Les schémas de formation de grappes proposés sont DHCV (un algorithme de clustering D-hop distribué pour VANET) et DCEV (une formation de grappes distribuée pour VANET basée sur la mobilité relative de bout en bout). Ces schémas de regroupement sont utilisés pour former dynamiquement des nuages de véhicules. Les systèmes regroupent les véhicules dans des nuages qui ne se chevauchent pas et qui ont des tailles adaptées à leurs mobilités. Les VC sont créés de telle sorte que chaque véhicule soit au plus D sauts plus loin d'un coordonnateur de nuage. La planification de transmission proposée implémente un contrôle d'accès moyen basé sur la contention où les conditions physiques du canal sont entièrement analysées. Le système d'annulation d'interférence permet d'éliminer les interférences les plus importantes; cela améliore les performances de planification d’utilisation de la bande passante et le partage des ressources dans les nuages construits. Enfin, on a proposé une solution à l'aide de réseaux définis par logiciel, SDN, où différentes bandes de fréquences sont affectées aux différentes liens de transmission de chaque VC afin d’améliorer les performances du réseau.Abstract : In recent years, we have observed a growing interest in information accessibility and especially innovative approaches for making distant services accessible from mobile devices across the world. In tandem with this growth of interest, there was the introduction of vehicular communication, also known as vehicular ad hoc networks (VANET), leveraging onboard sensors and wireless communication devices to enhance road safety and driving experience. Vehicles wireless accessibility to the internet has triggered the emergence of service packages that can be available to or from vehicles. Recently, an extension of the vehicular networks paradigm has been promoted to a new level. Vehicular cloud (VC) is the ultimate convergence between the cloud computing concept and vehicular networks for the purpose of service provisioning and management. Vehicles can get connected to the cloud, where a multitude of services are available to them. Also vehicles can offer services and act as service providers rather than service consumers. This is possible because of the variety of resources available in vehicles: computing, bandwidth, storage and sensors. In this thesis, we propose novel and efficient methods to enable vehicle service delivery in VC. Several schemes including cluster/cloud formation, transmission scheduling, interference cancellation, and frequency assignment using software defined networking (SDN) have been developed and their performances have been analysed. The proposed cluster formation schemes are DHCV (a distributed D-hop clustering algorithm for VANET) and DCEV (a distributed cluster formation for VANET based on end-to-end relative mobility). These clustering schemes are used to dynamically form vehicle clouds. The schemes group vehicles into non-overlapping clouds, which have adaptive sizes according to their mobility. VCs are created in such a way that each vehicle is at most D-hops away from a cloud coordinator. The proposed transmission scheduling implements a contention-free-based medium access control where physical conditions of the channel are fully analyzed. The interference cancellation scheme makes it possible to remove the strongest interferences; this improves the scheduling performance and resource sharing inside the constructed clouds. Finally, we proposed an SDN based vehicular cloud solution where different frequency bands are assigned to different transmission links to improve the network performance

Design and Analysis of An Improved AODV Protocol Based on Clustering Approach for Internet of Vehicles (AODV-CD)

The Internet of Vehicles (IoVs) has become a vital research area in order to enhance passenger and road safety, increasing traffic efficiency and enhanced reliable connectivity. In this regard, for monitoring and controlling the communication between IoVs, routing protocols are deployed. Frequent changes that occur in the topology often leads to major challenges in IoVs, such as dynamic topology changes, shortest routing paths and also scalability. One of the best solutions for such challenges is “clustering”. This study focuses on IoVs’ stability and to create an efficient routing protocol in dynamic environment. In this context, we proposed a novel algorithm called Cluster-based enhanced AODV for IoVs (AODV-CD) to achieve stable and efficient clustering for simplifying routing and ensuring quality of service (QoS). Our proposed protocol enhances the overall network throughput and delivery ratio, with less routing load and less delay compared to AODV. Thus, extensive simulations are carried out in SUMO and NS2 for evaluating the efficiency of the AODV-CD that is superior to the classic AODV and other recent modified AODV algorithms.

Design and Analysis of An Improved AODV Protocol Based on Clustering Approach for Internet of Vehicles (AODV-CD)

The Internet of Vehicles (IoVs) has become a vital research area in order to enhance passenger and road safety, increasing traffic efficiency and enhanced reliable connectivity. In this regard, for monitoring and controlling the communication between IoVs, routing protocols are deployed. Frequent changes that occur in the topology often leads to major challenges in IoVs, such as dynamic topology changes, shortest routing paths and also scalability. One of the best solutions for such challenges is “clustering”. This study focuses on IoVs’ stability and to create an efficient routing protocol in dynamic environment. In this context, we proposed a novel algorithm called Cluster-based enhanced AODV for IoVs (AODV-CD) to achieve stable and efficient clustering for simplifying routing and ensuring quality of service (QoS). Our proposed protocol enhances the overall network throughput and delivery ratio, with less routing load and less delay compared to AODV. Thus, extensive simulations are carried out in SUMO and NS2 for evaluating the efficiency of the AODV-CD that is superior to the classic AODV and other recent modified AODV algorithms.

A Novel Stable Clustering Approach Based On Gaussian Distribution And Relative Velocity In VANETs

Vehicles in Vehicular Ad-hoc Networks (VANETs) are characterized by their high dynamic mobility (velocity). Changing in VANET topology is happened frequently which caused continuous network communication failures. Clustering is one of the solutions applied to reduce the VANET topology changes. Stable clusters are required and Indispensable to control, improve and analyze VANET. In this paper, we introduce a new analytical VANET's clustering approach. This approach aims to enhance the network stability. The new proposed grouping process in this study depends on the vehicles velocities mean and standard deviation. The principle of the normal (Gaussian) distribution is utilized and emerged with the relative velocity to propose two clustering levels. The staying duration of vehicles in a cluster is also calculated and used as an indication. The first level represents a very high stabile cluster. To form this cluster, only the vehicles having velocities within the range of mean ± standard deviation, collected in one cluster (i.e. only 68% of the vehicles allowed to compose this cluster). The cluster head is selected from the vehicles having velocities close to the average cluster velocity. The second level is to create a stable cluster by grouping about 95% of the vehicles. Only the vehicles having velocities within the range of mean ± 2 standard deviation are collected in one cluster. This type of clustering is less stable than the first one. The analytical analysis shows that the stability and the staying duration of vehicles in the first clustering approach are better than their values in the second clustering approach

Routage basé sur le contenu dans les réseaux ad-hoc aéronautiques

In a context of growing needs of communication means to increase flight safety and meet the expectations of companies and passengers, the world of civil aviation seeks new communication systems that can meet these objectives. The Aeronautical Ad-Hoc Networks, AANETs represent an innovative approach to address this problem. It is self-configured networks, using no fixed infrastructure where the nodes are commercial aircraft. The AANETs can be seen as a subset of the VANET (Vehicular Ad-Hoc Networks) since they share many features as the constraints imposed on the trajectories. In order to use these mobile networks more efficiently while meeting the needs of new applications, such as the transmission of weather information in real time, requiring air to air communications. , we propose in this thesis to use the paradigm of content based routing above AANET. In this kind of routing, it is not a destination address that is used to identify the recipients, but the message content itself. In this paradigm, a transmitter sends a message having attributes and the message is then transmitted by the network to nodes interested by the content of the message. Applied to weather information update, this approach allows an aircraft detecting a dangerous phenomenon such as a thunderstorm to only prevent interested nodes, ie those whose the trajectory come close to the storm during the lifetime of the event. In this thesis, we have chosen to rely on the popular Publish / Subscribe (P / S) paradigm to provide a content based routing service. In this approach, publishers publish events. On the other side, nodes send subscriptions to declare their interest and the system is then in charge of forward events to nodes that match their needs.. After a state of the art about existing P / S systems, particularly those adapted to VANETs, we choose to test the solutions seemed interesting in a AANET context. To accomplish this, we have developed as a Omnet ++ mobility model using real position reports to replay a full day of traffic of aircraft and several aeronautical applications based on a P / S system to generate realistic data. The results show that these solutions are not completely suitable for AANET context. Therefore, in a second step, we proposed a new P / S system which is more efficient on a AANET. This solution is based on an overlay network built thanks to a new of 1-hopping clustering algorithm suitable for AANET. In order to increase the stability of the overlay architecture, this algorithm is based on the number of neighbors and the relative mobility between the nodes to define groups. The tests show that the P iii / S system based on this overlay provides better results than the previously tested solutions, whether in terms of network load or percentage of transmitted events.Les réseaux Ad Hoc mobiles (MANET : Mobile Ad hoc NETworks), sont des réseaux auto-configurés, n'utilisant pas d'infrastructure fixe. Les AANET (Aeronautical Ad hoc NETworks) sont un sous-ensemble de ces réseaux dont la spécificité réside dans le fait que les nœuds composant le réseau sont des avions commerciaux avec des schémas de mouvements caractéristiques. Les AANETs peuvent apparaître comme un moyen de communication complémentaire aux systèmes existants entre les avions et le sol ou entre les avions eux mêmes. Afin de répondre aux besoins de nouvelles applications, telle que l'information météorologique sur des phénomènes dangereux en temps réel, qui nécessitent des communications d'avion à avion, le paradigme du routage basé sur le contenu semble prometteur. Dans ce type de routage, ce n'est plus une adresse de destination qui est utilisée pour joindre le ou les correspondants, mais le contenu du message qui permet de décider des destinataires. Dans ce paradigme, un émetteur envoi un message possédant des attributs et le message est alors transmis par le réseau uniquement aux terminaux intéressés par le contenu du message. Dans cette thèse, nous avons conçu un système de publication/souscription basé sur le contenu et adapté aux AANETs. Ce système s'appuie sur une architecture recouvrante ("overlay network") construite à l'aide d'un algorithme original de regroupement à 1-saut (1-hop clusterisation) adapté aux AANETs. Ce système a été validé en simulation avec un rejeu de trajectoires avion réelles

Fast propagation of messages in VANETs and the impact of vehicles as obstacles on signal propagation

Vehicular Ad hoc NETworks (VANETs), an emerging technology, use vehicles as nodes to form a mobile ad hoc network for the dissemination of safety and entertainment messages. The thesis provides a scheme for the fast propagation of messages in VANETs and evaluates the impact of vehicles as obstacles on signal propagation. An improved scheme for intermediate node selection in DBA-MAC (Dynamic Backbone Assisted MAC) is proposed, which consists of a CW (Contention Window) constraint scheme and an updated criterion of suitability. A performance comparison shows that messages in the proposed scheme propagate faster than in DBA-MAC. The CW constraint scheme is also applicable in VANET protocols which adapt the CW mechanism to communicate the suitability of vehicles for acting as intermediate nodes. Additionally, the mathematical models for DBAMAC and the proposal are established, which indicate the probability of candidates to be chosen over alternatives in the intermediate node selection. A novel metric - delay taking into account the effect of formation time(DEFT) - is proposed. DEFT combines the network formation time and propagation delay. It shows the impact of network formation on propagation latency. The configuration for optimal performance can be acquired using the proposed DEFT. In order to evaluate the proposals, a novel distribution of vehicle location is proposed. In the proposed distribution, the security distances between adjacent vehicles in the same lane are considered. The estimation of vehicles’ location can be more practical and accurate using the proposed distribution. In the wide body of the VANET literature, it is assumed that all the vehicles within the radio range of a transmitter are able to receive the signal. Yet, in practice, the vehicles as obstacles between the transmitter and the receiver affect the signal propagation significantly. This thesis presents the impact of these obstacles on the network connectivity and system performance of the protocols. The results and the analysis show that neglecting obstacles in practice leads to a significant degree of error in the estimation of system performance. In practice, tall vehicles forward messages in a more efficient way than do lower vehicles since they are free from the obstacle effect. An improved scheme is proposed, in which the height of vehicles is used as a factor to determine their suitability for message forwarding