Vehicular ad-hoc networks (VANETs) are envisioned to provide many road and safety applications that will improve drivers' awareness and enhance the driving experience. Many of proposed applications are location-based that depend on sharing the location information of vehicles and events among neighboring nodes. The location-based applications should provide vehicle operators with knowledge of the current surrounding conditions to help them make appropriate traveling decisions, such as avoiding traffic congestion. Drivers expect to receive accurate and reliable information from other vehicles. Therefore, securing localization service integrity is important to support a VANET's overall system reliability. In this thesis, we study the exchanged location information in VANETs and designed a framework to prevent potential security threats that will violate users' privacy and overcome limitations that can impact the exchanged data integrity and reliability. The solution developed a secure neighborhood awareness service and shared localization information management protocol in a VANET. The proposed framework is constructed through several components: (i) a location verification protocol that will secure location information by providing a non-line-of-sight (NLOS) verification protocol to overcome moving obstacle effects; (ii) privacy-preserving location information management to detect data inconsistency and provide a recovery process while preventing attackers from tracking individual vehicles; (iii) a trust model evaluation mechanism based on neighborhood awareness; (iv) an adaptive beacon protocol that will reduce the number of messages and provide quality of service(QoS) control for network managers and authorities. We also propose a security evaluation model that quantifies the security attributes for the localization service in a VANET. The model will help evaluate an integrated security measures that are provided by different components of the network services.

Vehicular ad-hoc networks (VANETs) are envisioned to provide many road and safety applications that will improve drivers' awareness and enhance the driving experience. Many of proposed applications are location-based that depend on sharing the location information of vehicles and events among neighboring nodes. The location-based applications should provide vehicle operators with knowledge of the current surrounding conditions to help them make appropriate traveling decisions, such as avoiding traffic congestion. Drivers expect to receive accurate and reliable information from other vehicles. Therefore, securing localization service integrity is important to support a VANET's overall system reliability. In this thesis, we study the exchanged location information in VANETs and designed a framework to prevent potential security threats that will violate users' privacy and overcome limitations that can impact the exchanged data integrity and reliability. The solution developed a secure neighborhood awareness service and shared localization information management protocol in a VANET. The proposed framework is constructed through several components: (i) a location verification protocol that will secure location information by providing a non-line-of-sight (NLOS) verification protocol to overcome moving obstacle effects; (ii) privacy-preserving location information management to detect data inconsistency and provide a recovery process while preventing attackers from tracking individual vehicles; (iii) a trust model evaluation mechanism based on neighborhood awareness; (iv) an adaptive beacon protocol that will reduce the number of messages and provide quality of service(QoS) control for network managers and authorities. We also propose a security evaluation model that quantifies the security attributes for the localization service in a VANET. The model will help evaluate an integrated security measures that are provided by different components of the network services.

With the fast development of 5G networks and the advancement in networking technologies, more and more new technologies such as internet of vehicles (IoV) is catching our eyes. With technologies of artificial intelligence and automatic control, IoV is transformed into an intelligent transportation system (ITS). The object of this thesis is to analyze the connectivity probability issues in vehicle ad hoc networks (VANETs), which is a subset of ITS. This will be achieved by a platoon-based two dimensional model. In order to make the results more accurate and more close to real scenario, different situations will be analyzed separately, and different types of platoon will be included. In addition, other system parameters are also discussed and stimulated. The results show that many parameters like the increases of traffic density, ratio of platoon, and lane numbers will improve connectivity probability. No-leader based platoons are easier to connect to the base stations compared to leader based platoons.

Thesis (MScEng)--Stellenbosch University, 2011. / ENGLISH ABSTRACT: The recent emergence of ubiquitous wireless connectivity and the increasing computational capacity of modern vehicles have triggered immense interest in the possibilities of vehicular connectivity. A plethora of potential applications for vehicular networks have been proposed in the areas of safety, traffic infrastructure management, information, and entertainment. The broad range of applications requires creative utilisation of the available wireless medium, using a combination of existing and novel wireless technologies. In this research the evaluation of one such configuration is performed. Dedicated short range communication for safety applications is assumed, and the use of Wi- Fi and WiMAX for non-safety applications is evaluated. Little is known about the media streaming performance of these wireless technologies in realistic vehicular ad-hoc network (VANET) scenarios. Due to the extreme mobility and unpredictable environmental aspects in a real road environment, an empirical evaluation is performed and presented. Evaluation of a multi-vehicle to infrastructure (V2V2I) VANET, using Wi-Fi for the vehicle-to-vehicle communication and WiMAX for the vehicle to infrastructure (V2I) communication is experimented. It is observed that Wi-Fi is unaffected by the vehicle speed; whenever nodes are within communication range, data gets transferred normally. A detailed characterisation of the network architecture is presented and the results show that a multitude of applications can be supported with this proposed network architecture. / AFRIKAANSE OPSOMMING: Die toenemende beskikbaarheid en digtheid van koordlose netwerke en die verhoogde verwerkingsvermoëns van moderne voertuie het die afgelope paar jaar aansienlike belangstelling gewek in die moontlikhede wat voertuig-kommunikasie bied. ʼn Magdom moontlike toepassings is voorgestel in ʼn wye verskeidenheid van velde insluitende veiligheid, verkeersinfrastruktuur, informasie en vermaak. Hierdie voorstelle vereis die kreatiewe benutting van die beskikbare en nuwe koordlose tegnologieë. Hierdie tesis evalueer een voorbeeld van so ‘n opstelling. ʼn Toegewyde kortafstand kommunikasie modus vir veiligheidstoepassings word aangeneem, terwyl Wi-Fi en WiMAX vir ander toepassings evalueer word. Daar is min navorsing oor die kapasiteit en seinsterkte van hierdie beskikbare netwerke onder realistiese voertuig netwerk (VANET) scenario‘s. Weens die hoë mobiliteit van voertuie en ook die onvoorspelbaarheid van hierdie omgewing word ʼn empiriese evaluasie beskou as die mees gepaste metode. Die navorsing ondersoek ʼn multi-voertuig-totinfrastruktuur- netwerk wat Wi-Fi gebruik vir voertuig-tot-voertuig (V2V) kommunikasie en WiMAX vir voertuig-tot-infrastruktuur (V2I) kommunikasie. Die navorsing bevind dat Wi-Fi nie beïnvloed word deur die spoed van die voertuig nie: wanneer die nodes binne die bereik is van die netwerk word data normaal oorgedra. ‗n Gedetailleerde karakterisering van dié netwerk word gedoen en die resultate dui aan dat ‗n groot hoeveelheid toepassings ondersteun kan word deur dié opstelling.

Vehicular communication networks are essential to the development of intelligent navigation systems and improvement of road safety. Unlike most terrestrial networks of today, vehicular networks are characterized by stringent reliability and latency requirements. In order to design efficient networks to meet these requirements, it is important to understand the system-level performance of vehicular networks. Stochastic geometry has recently emerged as a powerful tool for the modeling and analysis of wireless communication networks. However, the canonical spatial models such as the 2D Poisson point process (PPP) does not capture the peculiar spatial layout of vehicular networks, where the locations of vehicular nodes are restricted to roadways. Motivated by this, we consider a doubly stochastic spatial model that captures the spatial coupling between the vehicular nodes and the roads and analyze the performance of vehicular communication networks. We model the spatial layout of roads by a Poisson line process (PLP) and the locations of nodes on each line (road) by a 1D PPP, thereby forming a Cox process driven by a PLP or Poisson line Cox process (PLCP). In this dissertation, we develop the theory of the PLCP and apply it to study key performance metrics such as coverage probability and rate coverage for vehicular networks under different scenarios. First, we compute the signal-to-interference plus noise ratio (SINR)-based success probability of the typical communication link in a vehicular ad hoc network (VANET). Using this result, we also compute the area spectral efficiency (ASE) of the network. Our results show that the optimum transmission probability that maximizes the ASE of the network obtained for the Cox process differs significantly from that of the conventional 1D and 2D PPP models. Second, we calculate the signal-to-interference ratio (SIR)-based downlink coverage probability of the typical receiver in a vehicular network for the cellular network model in which each receiver node connects to its closest transmitting node in the network. The conditioning on the serving node imposes constraints on the spatial configuration of interfering nodes and also the underlying distribution of lines. We carefully handle these constraints using various fundamental distance properties of the PLCP and derive the exact expression for the coverage probability. Third, building further on the above mentioned works, we consider a more complex cellular vehicle-to-everything (C-V2X) communication network in which the vehicular nodes are served by roadside units (RSUs) as well as cellular macro base stations (MBSs). For this setup, we present the downlink coverage analysis of the typical receiver in the presence of shadowing effects. We address the technical challenges induced by the inclusion of shadowing effects by leveraging the asymptotic behavior of the Cox process. These results help us gain useful insights into the behavior of the networks as a function of key network parameters, such as the densities of the nodes and selection bias. Fourth, we characterize the load on the MBSs due to vehicular users, which is defined as the number of vehicular nodes that are served by the MBS. Since the limited network resources are shared by multiple users in the network, the load distribution is a key indicator of the demand of network resources. We first compute the distribution of the load on MBSs due to vehicular users in a single-tier vehicular network. Building on this, we characterize the load on both MBSs and RSUs in a heterogeneous C-V2X network. Using these results, we also compute the rate coverage of the typical receiver in the network. Fifth and last, we explore the applications of the PLCP that extend beyond vehicular communications. We derive the exact distribution of the shortest path distance between the typical point and its nearest neighbor in the sense of path distance in a Manhattan Poisson line Cox process (MPLCP), which is a special variant of the PLCP. The analytical framework developed in this work allows us to answer several important questions pertaining to transportation networks, urban planning, and personnel deployment. / Doctor of Philosophy / Vehicular communication networks are essential to the development of intelligent transportation systems (ITS) and improving road safety. As the in-vehicle sensors can assess only their immediate environment, vehicular nodes exchange information about critical events, such as accidents and sudden braking, with other vehicles, pedestrians, roadside infrastructure, and cellular base stations in order to make critical decisions in a timely manner. Considering the time-sensitive nature of this information, it is of paramount importance to design efficient communication networks that can support the exchange of this information with reliable and high-speed wireless links. Typically, prior to actual deployment, any design of a wireless network is subject to extensive analysis under various operational scenarios using computer simulations. However, it is not viable to rely entirely on simulations for the system design of highly complex systems, such as the vehicular networks. Hence, it is necessary to develop analytical methods that can complement simulators and also serve as a benchmark. One of the approaches that has gained popularity in the recent years for the modeling and analysis of large-scale wireless networks is the use of tools from stochastic geometry. In this approach, we endow the locations of wireless nodes with some distribution and analyze various aspects of the network by leveraging the properties of the distribution. Traditionally, wireless networks have been studied using simple spatial models in which the wireless nodes can lie anywhere on the domain of interest (often a 1D or a 2D plane). However, vehicular networks have a unique spatial geometry because the locations of vehicular nodes are restricted to roadways. Therefore, in order to model the locations of vehicular nodes in the network, we have to first model the underlying road systems. Further, we should also consider the randomness in the locations of vehicles on each road. So, we consider a doubly stochastic model called Poisson line Cox process (PLCP), in which the spatial layout of roads are modeled by random lines and the locations of vehicles on the roads are modeled by random set of points on these lines. As is usually the case in wireless networks, multiple vehicular nodes and roadside units (RSUs) operate at the same frequency due to the limited availability of radio frequency spectrum, which causes interference. Therefore, any receiver in the network obtains a signal that is a mixture of the desired signal from the intended transmitter and the interfering signals from the other transmitters. The ratio of the power of desired signal to the aggregate power of the interfering signals, which is called as the signal-to-interference ratio (SIR), depends on the locations of the transmitters with respect to the receiver. A receiver in the network is said to be in coverage if the SIR measured at the location of the receiver exceeds the required threshold to successfully decode the message. The probability of occurrence of this event is referred to as the coverage probability and it is one of the fundamental metrics that is used to characterize the performance of a wireless network. In our work, we have analytically characterized the coverage probability of the typical vehicular node in the network. This was the first work to present the coverage analysis of a vehicular network using the aforementioned doubly stochastic model. In addition to coverage probability, we have also explored other performance metrics such as data rate, which is the number of bits that can be successfully communicated per unit time, and spectral efficiency. Our analysis has revealed interesting trends in the coverage probability as a function of key system parameters such as the density of roads in a region (total length of roads per unit area), and the density of vehicles on the roads. We have shown that the vehicular nodes in areas with high density of roads have lower coverage than those in areas with sparsely distributed roads. On the other hand, the coverage probability of a vehicular node improves as the density of vehicles on the roads increases. Such insights are quite useful in the design and deployment of network infrastructure. While our research was primarily focused on communication networks, the utility of the spatial models considered in these works extends to other areas of engineering. For a special variant of the PLCP, we have derived the distribution of the shortest path distance between an arbitrary point and its nearest neighbor in the sense of path distance. The analytical framework developed in this work allows us to answer several important questions pertaining to infrastructure planning and personnel deployment.

Automobile accidents are one of the leading causes of death and claim more than 40,000 lives annually in the US alone. A substantial portion of these accidents occur at road intersections. Stop signs and traffic signals are some of the intersection control devices used to increase safety and prevent collisions. However, these devices themselves can contribute to collisions, are costly, inefficient, and are prone to failure. This thesis proposes an adaptive, decentralized, cooperative collision avoidance (CCA) system that optimizes each vehicle's controls subject to the constraint that no collisions occur. Three major contributions to the field of collision avoidance have resulted from this research. First, a nonlinear 5-state variable vehicle model is expanded from an earlier model developed in [1]. The model accounts for internal engine characteristics and more realistically approximates vehicle behavior in comparison to idealized, linear models. Second, a set of constrained, coupled Extended Kalman Filters (EKF) are used to predict the trajectory of the vehicles approaching an intersection in real-time. The coupled filters support decentralized operation and ensure that the optimization algorithm bases its decisions on good, reliable estimates. Third, a vehicular network based on the new WAVE standard is presented that provides cooperative capabilities by enabling intervehicle communication. The system is simulated against today's common intersection control devices and is shown to be superior in minimizing average vehicle delay. / Master of Science

Le protocole MAC du standard IEEE 802.11p dédié aux réseaux véhiculaires interdit les transmissions simultanées dans une même zone de détection afin d’éviter d’éventuelles interférences entre les véhicules voisins. Cette interdiction entraîne un blocage temporaire de réception de données, ce qui diminue le débit global du réseau. Pour résoudre ce problème, nous proposons dans cette thèse une architecture cross-layer PHY/MAC basée sur un algorithme de sélection d’antennes émettrices et un protocole MAC dédié afin de réduire le blocage. Ce cross-layer permet au récepteur de choisir la meilleure combinaison d’antennes émettrices pour améliorer le débit utile normalisé de chaque lien V2V. L’algorithme est présenté avec une méthode de détection multi-utilisateurs. Cette méthode annule les interférences entre voisins et permet à plusieurs véhicules d’émettre des données simultanément. Le protocole MAC associé assure la coordination entre les véhicules durant les communications. Les résultats de simulation montrent une amélioration du débit utile normalisé du réseau en comparaison au standard actuel. Néanmoins, ces bonnes performances diminuent avec l’augmentation de la densité véhiculaire. Pour pallier à cette baisse, nous proposons de joindre à la première solution une nouvelle architecture crosslayer PHY/MAC. Cette architecture est basée sur un algorithme d’adaptation de la puissance émise en fonction de la densité de voisinage du récepteur. Elle est également accompagnée par un protocole MAC dédié. Les résultats de simulation montrent que cette solution permet à plus de véhicules de communiquer simultanément et ainsi améliore significativement le débit utile normalisé notamment dans les réseaux véhiculaires denses. / The MAC protocol IEEE 802.11p, dedicated to vehicular ad-hoc networks VANETs, prohibits simultaneous transmissions in the same detection area, in order to avoid interference between neighboring vehicles. This prohibition causes a temporary data reception blocking, which reduces the network throughput. To reduce this adverse impact, we propose in this thesis a cross-layer design PHY/MAC based on a transmit antennas selection algorithm jointly with a dedicated MAC protocol. This design allows receivers to select the best combination of transmit antennas to improve the throughput of each V2V link. The algorithm is presented with a multi-user detection method, which cancels neighbor’s interference and allows vehicles to transmit data simultaneously. The associated MAC protocol ensures the coordination between vehicles during the simultaneous transmission period. The simulation results show a significant network throughput improvement compared to the conventional case. However, this improvement is less important in dense VANETs. For this purpose, we propose to join a cross-layer design PHY/MAC based on a transmit power adaptation algorithm. This design allows transmitters to choice the adequate power level based on corresponding receivers density. The simulation results show that this solution allows more vehicles to communicate simultaneously and thus improves the network throughput, in particular in dense VANETs.

Ubiquitous Sensor Network (USN) est un réseau conceptuel construit sur des réseaux physiques existantes. Il se sert des données détectées et fournit des services de connaissances à quiconque, n'importe où et à tout moment, et où l'information est générée en utilisant la sensibilité au contexte. Dispositifs et USN portables intelligents émergent rapidement en offrant de nombreux services fiables facilitant la vie des gens. Ces petits terminaux et terminaux très utiles besoin d'un substrat de communication globale pour fournir un service complet de l'utilisateur final global. En 2010, ITU -T a fourni les exigences pour supporter des applications et services USN dans le Next Generation Network (NGN) de l'environnement d'exploiter les avantages du réseau de base. L'un des principaux marchés prometteurs pour l'application et les services USN est la e- santé. Il fournit le suivi des patients en continu et permet une grande amélioration dans les services médicaux. D'autre part, des Véhicules Ad-hoc NETwork (VANET) est une technologie émergente qui permet une communication intelligente entre les véhicules mobiles. Intégrer VANET avec USN a un grand potentiel pour améliorer la sécurité routière et la fluidité du trafic. La plupart des applications VANET sont appliqués en temps réel et ils sont sensibles à retarder, en particulier ceux liés à la sécurité et à la santé. Dans ce travail, nous proposons d'utiliser l'IP Multimédia Subsystem (IMS) comme une sous- couche de contrôle de service dans l'environnement USN fournir un substrat mondiale pour un service complet de bout en bout. De plus, nous vous proposons d'intégrer VANETs avec USN pour des applications et des installations riches plus, ce qui facilitera la vie des humains. Nous avons commencé à étudier les défis sur la route pour atteindre cet objectif / Ubiquités Sensor Network (USN) is a conceptual network built over existing physical networks. It makes use of sensed data and provides knowledge services to anyone, anywhere and at anytime, and where the information is generated by using context awareness. Smart wearable devices and USNs are emerging rapidly providing many reliable services facilitating people life. Those very useful small end terminals and devices require a global communication substrate to provide a comprehensive global end user service. In 2010, the ITU-T provided the requirements to support USN applications and services in the Next Génération Network (NGN) environment to exploit the advantages of the core network. One of the main promising markets for the USN application and services is the e-Health. It provides continuous patients’ monitoring and enables a great improvement in medical services. On the other hand, Vehicular Ad-Hoc NETwork (VANET) is an emerging technology, which provides intelligent communication between mobile vehicles. Integrating VANET with USN has a great potential to improve road safety and traffic efficiency. Most VANET applications are applied in real time and they are sensitive to delay, especially those related to safety and health. In this work, we propose to use IP Multimedia Subsystem (IMS) as a service controller sub-layer in the USN environment providing a global substrate for a comprehensive end-to-end service. Moreover, we propose to integrate VANETs with USN for more rich applications and facilities, which will ease the life of humans. We started studying the challenges on the road to achieve this goal

Dans le cadre du développement des innovations dans les Systèmes de Transport Intelligents, les véhicules connectés devront être capables de télécharger des informations basées sur la position sur et depuis des serveurs distants. Ces véhicules seront équipés avec des différentes technologies d’accès radio, telles que les réseaux cellulaires ou les réseaux véhicule-à-véhicule (V2V) comme IEEE 802.11p. Les réseaux cellulaires, avec une couverture presque omniprésente, fournissent un accès à internet avec garanties de qualité de service. Cependant, l’accès à ces réseaux est payant. Dans cette thèse, un algorithme de clustering multi-saut est proposé avec pour objectif de réduire le coût d’accès au réseau cellulaire en agrégeant des données sur le réseau V2V. Pour faire ceci, le leader du cluster (CH, de l’anglais Cluster Head) est utilisé comme passerelle unique vers le réseau cellulaire. Pour le test d’une application d’exemple pour télécharger du Floating Car Data agrégé, les résultats des simulations montrent que cette approche réduit l’utilisation du réseau cellulaire de plus de 80%, en s’attaquant à la redondance typique des données basées sur la position dans les réseaux véhiculaires. Il y a une contribution en trois parties : Premièrement, une approche pour déléguer la sélection du CH à la station de base du réseau cellulaire afin de maximiser la taille des clusters, et par conséquent le taux de compression. Deuxièmement, un algorithme auto-adaptatif qui change dynamiquement le nombre maximum de sauts afin de maintenir un équilibre entre la réduction des coûts d’accès au réseau cellulaire et le taux de perte de paquets dans le réseau V2V. Finalement, l’incorporation d’une théorie de la justice distributive, afin d’améliorer l’équité sur la durée concernant la distribution des coûts auxquels les CH doivent faire face, améliorant ainsi l’acceptabilité sociale de la proposition. Les algorithmes proposés ont été testés via simulation, et les résultats montrent une réduction significative dans l’utilisation du réseau cellulaire, une adaptation réussie du nombre de sauts aux changements de la densité du trafic véhiculaire, et une amélioration dans les métriques d’équité, sans affecter la performance des réseaux. / For the development of innovative Intelligent Transportation Systems applications, connected vehicles will frequently need to upload and download position-based information to and from servers. These vehicles will be equipped with different Radio Access Technologies (RAT), like cellular and vehicle-to-vehicle (V2V) technologies such as LTE and IEEE 802.11p respectively. Cellular networkscan provide internet access almost anywhere, with QoS guarantees. However, accessing these networks has an economic cost. In this thesis, a multi-hop clustering algorithm is proposed in the aim of reducing the cellular access costs by aggregating information and off-loading data in the V2V network, using the Cluster Head as a single gateway to the cellular network. For the example application of uploading aggregated Floating Car Data, simulation results show that this approach reduce cellular data consumption by more than 80% by reducing the typical redundancy of position-based data in a vehicular network. There is a threefold contribution: First, an approach that delegates the Cluster Head selection to the cellular base station in order to maximize the cluster size, thus maximizing aggregation. Secondly, a self-adaptation algorithm that dynamically changes the maximum number of hops, addressing the trade-off between cellular access reduction and V2V packet loss. Finally, the incorporation of a theory of distributive justice, for improving fairness over time regarding the distribution of the cost in which Cluster Heads have to incur, thus improving the proposal’s social acceptability. The proposed algorithms were tested via simulation, and the results show a significant reduction in cellular network usage, a successful adaptation of the number of hops to changes in the vehicular traffic density, and an improvement in fairness metrics, without affecting network performance.