Recently, vehicular ad-hoc network (VANET) has emerged as an excellent candidate to change the life style of the traveling passengers along the roads and highways in terms of improving the safety levels and providing a wide range of comfort applications. Due to the foreseen impact of VANETs on our lives, extensive attentions in industry and academia are directed towards bringing VANETs into real life and standardizing its network operation. Unfortunately, the open medium nature of wireless communications and the high-speed mobility of a large number of vehicles in VANETs pose many challenges that should be solved before deploying VANETs. It is evident that any malicious behavior of a user, such as injecting false information, modifying and replaying the disseminated messages, could be fatal to other legal users. In addition, users show prime interest in protecting their privacy. The privacy of users must be guaranteed in the sense that the privacy-related information of a vehicle should be protected to prevent an observer from revealing the real identities of the users, tracking their locations, and inferring sensitive data. From the aforementioned discussion, it is clear that security and privacy preservation are among the critical challenges for the deployment of VANETs. Public Key Infrastructure (PKI) is a well-recognized solution to secure VANETs. However, the traditional management of PKI cannot meet the security requirements of VANETs. In addition, some security services such as location privacy and fast authentication cannot be provided by the traditional PKI. Consequently, to satisfy the security and privacy requirements, it is prerequisite to elaborately design an efficient management of PKI and complementary mechanisms for PKI to achieve security and privacy preservation for practical VANETs. In this thesis, we focus on developing an efficient certificate management in PKI and designing PKI complementary mechanisms to provide security and privacy for VANETs. The accomplishments of this thesis can be briefly summarized as follows. Firstly, we propose an efficient Distributed Certificate Service (DCS) scheme for vehicular networks. The proposed scheme offers a flexible interoperability for certificate service in heterogeneous administrative authorities, and an efficient way for any On-Board Units (OBUs) to update its certificate from the available infrastructure Road-Side Units (RSUs) in a timely manner. In addition, the DCS scheme introduces an aggregate batch verification technique for authenticating certificate-based signatures, which significantly decreases the verification overhead. Secondly, we propose an Efficient Decentralized Revocation (EDR) protocol based on a novel pairing-based threshold scheme and a probabilistic key distribution technique. Because of the decentralized nature of the EDR protocol, it enables a group of legitimate vehicles to perform fast revocation of a nearby misbehaving vehicle. Consequently, the EDR protocol improves the safety levels in VANETs as it diminishes the revocation vulnerability window existing in the conventional Certificate Revocation Lists (CRLs). Finally, we propose complementing PKI with group communication to achieve location privacy and expedite message authentication. In specific, the proposed complemented PKI features the following. First, it employs a probabilistic key distribution to establish a shared secret group key between non-revoked OBUs. Second, it uses the shared secret group key to perform expedite message authentication (EMAP) which replaces the time-consuming CRL checking process by an efficient revocation checking process. Third, it uses the shared secret group key to provide novel location privacy preservation through random encryption periods (REP) which ensures that the requirements to track a vehicle are always violated. Moreover, in case of revocation an OBU can calculate the new group key and update its compromised keys even if the OBU missed previous rekeying process. For each of the aforementioned accomplishments, we conduct security analysis and performance evaluation to demonstrate the reliable security and efficiency of the proposed schemes.

none

none

In recent years, road navigational devices equipped with GPS technologies are becoming more and more popular. These devices can facilitate drivers to guide the way to reach their destinations. In this Thesis, we propose a dynamic route navigational algorithm (DNA) that can be combined with GPS, electronic map system, and wireless technologies (such as DSRC, VANET, 802.11p, WLAN, WiMAX ..., etc.). By calculating metric from road type, road length, average distance, and average speed of each available candidate road, DNA generates road score table and choose the route with the highest score among candidate routes to reach destination. Additionally, in DNA, a Dynamic Block re-Broadcasting (DBB) scheme is designed to carry out Road-Request message (R-REQ) rebroadcast function. The R-REQ rebroadcast function provides two advantages: (i) It can broadcast R-REQ to a specific coverage area with least hop counts; (ii) It can reduce the number of R-REQ broadcast packets significantly. Although DNA takes more processing time than other navigational algorithms, it can greatly reduce the traveling time by determining the best route to destination. For the purpose of performance evaluation, we develop a simulator by using C++ programming language to compare the performance of DNA with other navigational algorithms. Simulation results have shown that DNA performs much better than other navigational algorithms in reaching destination with shorter travel distance and shorter traveling time.

In this dissertation, analysis and design of the efficient Medium Access Control (MAC) sub-layer schemes are considered for Vehicular Ad hoc Networks (VANE~s). The contributions of this study are three-fold. First, an analytical model based on Markov chain is developed in order to investigate the performance of the MAC sub-layer of the IEEE 802.11p for vehicular communications. The results indicate that single channel MAC sub-layers may not be adequate for the future Intelligent Transportation Systems (ITS). The analytical model is validated with the results from simulation-based analysis. Performance analysis based on simulations is given on MAC metrics such as throughput, access delay, packet delivery. Second, a multi-channel MAC protocol is proposed and comprehensively analyzed in terms of channel utilizing and Quality of service (QoS) differentiation for dense VANETs. It is demonstrated that the proposed scheme, namely Asynchronous Multichannel MAC with Distributed TDMA (AMCMACD), improves the system performance in terms of throughput, packet delivery rate, collision rate on service channels, load balancing, and service differentiation for dense vehicular networks. Third, to cope with the interference from contention with neighbours within two hops in large-scale networks, a Large-scale Asynchronous Multichannel MAC (LS-AMCMAC) is proposed. The proposed scheme outperforms other benchmark multichannel MAC schemes in large-scale networks, in terms of throughput, channel utilization, dissemination of emergency messages, and the collision rates on control and service channels.

Recently, vehicular ad-hoc network (VANET) has emerged as an excellent candidate to change the life style of the traveling passengers along the roads and highways in terms of improving the safety levels and providing a wide range of comfort applications. Due to the foreseen impact of VANETs on our lives, extensive attentions in industry and academia are directed towards bringing VANETs into real life and standardizing its network operation. Unfortunately, the open medium nature of wireless communications and the high-speed mobility of a large number of vehicles in VANETs pose many challenges that should be solved before deploying VANETs. It is evident that any malicious behavior of a user, such as injecting false information, modifying and replaying the disseminated messages, could be fatal to other legal users. In addition, users show prime interest in protecting their privacy. The privacy of users must be guaranteed in the sense that the privacy-related information of a vehicle should be protected to prevent an observer from revealing the real identities of the users, tracking their locations, and inferring sensitive data. From the aforementioned discussion, it is clear that security and privacy preservation are among the critical challenges for the deployment of VANETs. Public Key Infrastructure (PKI) is a well-recognized solution to secure VANETs. However, the traditional management of PKI cannot meet the security requirements of VANETs. In addition, some security services such as location privacy and fast authentication cannot be provided by the traditional PKI. Consequently, to satisfy the security and privacy requirements, it is prerequisite to elaborately design an efficient management of PKI and complementary mechanisms for PKI to achieve security and privacy preservation for practical VANETs. In this thesis, we focus on developing an efficient certificate management in PKI and designing PKI complementary mechanisms to provide security and privacy for VANETs. The accomplishments of this thesis can be briefly summarized as follows. Firstly, we propose an efficient Distributed Certificate Service (DCS) scheme for vehicular networks. The proposed scheme offers a flexible interoperability for certificate service in heterogeneous administrative authorities, and an efficient way for any On-Board Units (OBUs) to update its certificate from the available infrastructure Road-Side Units (RSUs) in a timely manner. In addition, the DCS scheme introduces an aggregate batch verification technique for authenticating certificate-based signatures, which significantly decreases the verification overhead. Secondly, we propose an Efficient Decentralized Revocation (EDR) protocol based on a novel pairing-based threshold scheme and a probabilistic key distribution technique. Because of the decentralized nature of the EDR protocol, it enables a group of legitimate vehicles to perform fast revocation of a nearby misbehaving vehicle. Consequently, the EDR protocol improves the safety levels in VANETs as it diminishes the revocation vulnerability window existing in the conventional Certificate Revocation Lists (CRLs). Finally, we propose complementing PKI with group communication to achieve location privacy and expedite message authentication. In specific, the proposed complemented PKI features the following. First, it employs a probabilistic key distribution to establish a shared secret group key between non-revoked OBUs. Second, it uses the shared secret group key to perform expedite message authentication (EMAP) which replaces the time-consuming CRL checking process by an efficient revocation checking process. Third, it uses the shared secret group key to provide novel location privacy preservation through random encryption periods (REP) which ensures that the requirements to track a vehicle are always violated. Moreover, in case of revocation an OBU can calculate the new group key and update its compromised keys even if the OBU missed previous rekeying process. For each of the aforementioned accomplishments, we conduct security analysis and performance evaluation to demonstrate the reliable security and efficiency of the proposed schemes.

Zugl.: Karlsruhe, University, Diss., 2007.

Zugl.: München, Techn. Univ., Diss., 2006

Recently, the wide range of communication applications has greatly increased the number of connected devices, and this trend continues by emerging new technologies such as Internet-of-Things (IoT) and vehicular ad hoc networks (VANETs). The increase in the number of devices may sooner or later cause wireless spectrum shortage. Furthermore, with the limited wireless spectrum, transmission efficiency degrades when the network faces a super-dense situation. In IEEE 802.11ah-based networks whose channel access protocol is basically a contention-based one, the protocol loses its efficiency when the total number of contending users grows. VANETs suffer from the same problem, where broadcasting and receiving safety messages, i.e., beacons, are critical. An inefficient medium access control (MAC) can negatively impact the network's reliability. Effective resource management solutions are needed to improve the network's reliability and scalability considering the features of different types of networks. In this work, we address the resource management problem in dense wireless networks in vehicle-to-everything (V2X) systems and IoT networks. For IoT networks, e.g., sensor networks, in which the network topology is quite stable, the grouping technique is exploited to make the stations (STAs) compete in a group to mitigate the contention and improve the channel access quality. While, in VANETs, devices are mobile and the network topology changes over time. In VANETs, beacons should be broadcast periodically by each vehicle reliably to improve road safety. Therefore, how to share the wireless resources to ensure reliability and scalability for these dense static and mobile wireless networks is still a difficult and open problem. In static IoT networks, we apply the Max-Min fairness criterion to the STAs' throughput to group the STAs to ensure network performance and fairness. Formulation of the problem results in a non-convex integer programming optimization problem which avoids hidden terminals opportunistically. As solving the optimization problem has a high time complexity, the Ant Colony Optimization (ACO) method is applied to the problem to find the sub-optimal solution. To support reliable and efficient broadcasting in VANET, wireless resources are divided into basic resource units in the time and frequency domains, and a distributed and adaptive reservation-based MAC protocol (DARP) is proposed. For decentralized control in VANETs, each vehicle's channel access is coordinated with its neighbors to solve the hidden terminal problem. To ensure the reliability of beacon broadcasting, different kinds of preambles are applied in DARP to support distributed reservation, detect beacon collisions, and resolve the collisions. Once a vehicle reserves a resource unit successfully, it will not release it until a collision occurs due to topology change. Protocol parameters, including transmission power and time slots duration, can be adjusted to reduce collision probability and enhance reliability and scalability. Simulation of urban mobility (SUMO) is used to generated two different city traces to assess the DARP's performance. Then, a distributed network coding-based MAC protocol (NC-MAC) is proposed to support reliable single-hop vehicle-to-vehicle (V2V) beacon broadcasting. We combine the preamble-based feedback mechanism, retransmissions, and network coding together to enhance broadcasting reliability. We deploy the preamble mechanism to facilitate the negative acknowledgment (NACK) and retransmission request procedures. Moreover, linear combinations of missed beacons are generated according to the network coding (NC) principles. We also use SUMO to evaluate the NC-MAC's performance in highway and urban scenarios. Group-casting and applying multi-hop communication can ensure reliability in V2X systems. As an extension of the proposed NC-MAC, a distributed grouping and network coding-assisted MAC protocol (GNC-MAC) is proposed to support reliable group-casting and multi-hop communication, which can address blockchain protocols' requirements. We propose a new grouping protocol by combining preamble-based feedback mechanism, multi-hop communication, and network coding to improve group-casting reliability. The preamble mechanism is responsible for reporting a NACK and requesting retransmission due to beacon missing. The missed beacons are combined according to the NC principles and sent on a resource block. / Graduate

La communication véhiculaire permet le développement de nouvelles applications multicast émergentes telles que la gestion de la flotte et la distribution des Points d'Intérêt (POI). Ces deux catégories d'applications nécessitent une communication multicast de l'Internet vers les réseaux véhiculaires (VANET). Afin de mettre en place une communication multicast adaptée au contexte de la communication Internet-vers-réseaux véhiculaires, notre travail traite de deux aspects différents. Tout d'abord, l'accessibilité des véhicules en mouvement au service Internet et en deuxième lieu, la dissémination du message dans les VANET. Nous introduisons un schéma d'adressage multicast basé sur les coordonnées géographiques des véhicules qui leur permet de s'auto-configurer d'une façon dynamique sans aucun besoin d'échanger des messages de signalisation avec Internet. Nous proposons aussi une approche simplifiée de gestion de la mobilité des véhicules dans le cadre des architectures Mobile IP et Proxy Mobile IP. Le but de cette approche est d'optimiser l'échange des messages avec les entités responsables de la gestion de la mobilité dans Internet. Afin d'étudier les mécanismes de dissémination appropriés aux applications de gestion de flottes, nous nous proposons de revisiter les techniques de routage multicast traditionnelles basées sur une structure de diffusion en arbre. Pour cela, nous étudions leur application aux réseaux véhiculaires. Nous présentons une étude théorique portant sur la durée de vie des liens entre les véhicules en milieux urbains. Ensuite, en utilisant la simulation, nous étudions l'application de Multicast Adhoc On Demand Vector, MAODV et proposons Motion-MAODV, une version adaptée de MAODV qui a pour objectif d'établir des routes plus robustes Enfin, concernat la dissémination multicast géolocalisée dans les applications POI, nous proposons le protocole de routage Melody qui permet une diffusion geocast en milieu urbain. A partir de simulations, nous constatons que, comparé aux protocoles de géo-brodcasting dans les milieux urbain très denses, Melody assure plus de fiabilité et d'efficacité lors de l'acheminement des données vers les zones géographiques de destination. / Vehicular communications allow emerging new multicast applications such as fleet management and point of interest (POI). Both applications require Internet-to-vehicle multicasting. These approaches could not be applied to vehicular networks (VANET) due to their dynamic and distributed nature. In order to enable such multicasting, our work deals with two aspects. First, reachability of the moving vehicles to the multicast service and second, multicast message dissemination in VANET. We introduce first a self-configuring multicast addressing scheme that allows the vehicles to auto-configure a dynamic multicast address without a need to exchange signalling messages with the Internet. Second, we propose a simplified approach that extends Mobile IP and Proxy Mobile IP. This approach aims at optimizing message exchange between vehicles and entities responsible for managing their mobility in Internet. To study the dissemination mechanisms that are suitable for fleet management applications, we propose to revisit traditional multicast routing techniques that rely on a tree structure. For this purpose, we study their application to vehicular networks. In particular, as vehicular networks are known to have changing topology, we present a theoretical study of the link lifetime between vehicles in urban environments. Then, using simulations, we study the application of Multicast Adhoc On Demand Vector, MAODV. We propose then Motion-MAODV, an improved version of MAODV that aims at enhancing routes built by MAODV in vehicular networks and guarantee longer route lifetime. Finally, to enable geographic dissemination as required by POI applications, we propose a routing protocol Melody that provides a geocast dissemination in urban environments. Through simulations, Melody ensures more reliable and efficient packet delivery to a given geographic area compared to traditional geo-brodcasting schemes in highly dense scenarios.