This thesis consists of two projects focusing on how 5G can be used to make vehicles safer. The first project focuses on conceptualizing near-future use cases of how Advanced Driver Assistance Systems (ADAS) can be enhanced through 5G technology. Four concepts were developed in collaboration with various industry partners. These concepts were successfully demonstrated in a proof-of-concept at the 5G Automotive Association (5GAA) “The 5G Path of Vehicle-to-Everything Communication: From Local to Global” conference in Turin, Italy. This proof-of-concept was the world’s first demonstration of such a system. The second project focuses on a futuristic use case, namely remote operation of semi-autonomous vehicles (sAVs). As part of this work, it was explored if augmented reality (AR) can be used to warn remote operators of dangerous events. It was explored if such augmentations can be used to compensate during critical events. These events are defined as occurrences in which the network conditions are suboptimal, and information provided to the operator is limited. To evaluate this, a simulator environment was developed that uses eye- tracking technology to study the impact of such scenarios through user studies. The simulator establishes an extendable platform for future work. Through experiments, it was found that AR can be beneficial in spotting danger. However, it can also be used to directly affect the scanning patterns at which the operator views the scene and directly affect their visual scanning behavior. / Denna avhandling består av två projekt med fokus på hur 5G kan användas för att göra fordon säkrare. Det första projektet fokuserar på att konceptualisera användningsfall i närmaste framtid av hur Advanced Driver Assistance Systems (ADAS) kan förbättras genom 5G-teknik. Fyra koncept utvecklades i samarbete med olika branschpartner. Dessa koncept demonstrerade i ett proof-of- concept på 5G Automotive Association (5GAA) “5G Path of Vehicle to to Everything Communication: From Local to Global” -konferensen i Turin, Italien. Detta bevis-of-concept var världens första demonstration av ett sådant system. Det andra projektet fokuserar på ett långt futuristiskt användningsfall, nämligen fjärrstyrning av semi-autonoma fordon (sAVs). Som en del av detta arbete undersöktes det om augmented reality (AR) kan användas för att varna fjärroperatörer om farliga händelser. Det undersöktes om sådana förstärkningar kan användas för att kompensera under kritiska händelser. Dessa händelser definieras som händelser där nätverksförhållandena är suboptimala och information som tillhandahålls till operatören är begränsad. För att utvärdera detta utvecklades en simulatormiljö som använder ögonspårningsteknologi för att studera effekterna av sådana scenarier genom en användarstudie. Simulatorn bildar en utdragbar plattform för framtida arbete. Genom experiment fann man att AR kan vara fördelaktigt när det gäller att upptäcka fara. Men det kan också användas för att direkt påverka skanningsmönstret där operatören tittar på scenen och direkt påverka deras visuella skanningsbeteende.

The deployment of dedicated short-range communications (DSRC) roadside units (RSUs) allows a connected or automated vehicle to acquire information from the surrounding environment using vehicle-to-infrastructure (V2I) communication. However, wireless communication using DSRC has shown to exhibit null points, at repeatable distances. The null points are significant and there was unexpected loss in the wireless signal strength along the pathway of the V2I communication. If the wireless connection is poor or non-existent, the V2I safety application will not obtain sufficient data to perform the operation services. In other words, a poor wireless connection between a vehicle and infrastructure (e.g., RSU) could hamper the performance of a safety application. For example, a designer of a V2I safety application may require a minimum rate of data (or packet count) over 1,000 meters to effectively implement a Reduced Speed/Work Zone Warning (RSZW) application. The RSZW safety application is aimed to alert or warn drivers, in a Cooperative Adaptive Cruise Control (CACC) platoon, who are approaching a work zone. Therefore, the packet counts and/or signal strength threshold criterion must be determined by the developer of the V2I safety application. Thus, we selected an arbitrary criterion to develop an empirical method of ascertaining the null points from a DSRC RSU. The research motivation focuses on developing an empirical method of calculating the null points of a DSRC RSU for V2I communication at a highway on/off-ramp. The intent is to improve safety, mobility, and environmental applications since a map of the null points can be plotted against the distance between the DSRC RSU and a vehicle's onboard unit (OBU). The main research question asks: 'What is a more robust empirical method, compared to the horizontal and vertical laws of reflection formula, in determining the null points from a DSRC RSU on a highway on/off ramp?' The research objectives are as follows: 1. Explain where and why null points occur from a DSRC RSU (Chapter 2) 2. Apply the existing horizontal and vertical polarization model and discuss the limitations of the model in a real-world scenario for a DSRC RSU on a highway on/off ramp (Chapter 3 and Appendix A) 3. Introduce an extended horizontal and vertical polarization null point model using empirical data (Chapter 4) 4. Discuss the conclusion, limitations of work, and future research (Chapter 5). The simplest manner to understand where and why null points occur is depicted as two sinusoidal waves: direct and reflective waves (i.e., also known as a two-ray model). The null points for a DSRC RSU occurs because the direct and reflective waves produce a destructive interference (i.e., decrease in signal strength) when they collide. Moreover, the null points can be located using Pythagorean theorem for the direct and reflective waves. Two existing models were leveraged to analyze null points: 1) signal strength loss (i.e., a free space path loss model, or FSPL, in Appendix A) and 2) the existing horizontal and vertical polarization null points from a DSRC RSU. Using empirical data from two different field tests, the existing horizontal and vertical polarization null point model was shown to contain limitations in short distances from the DSRC RSU. Moreover, the existing horizontal and vertical polarization model for null points was extremely challenging to replicate with over 15 DSRC RSU data sets. After calculating the null point for several DSRC RSU heights, the paper noticed a limitation of the existing horizontal and vertical polarization null point model with over 15 DSRC RSU data sets (i.e., the model does not account for null points along the full length of the FSPL model). An extended horizontal and vertical polarization model is proposed that calculates the null point from a DSRC RSU. There are 18 model comparisons of the packet counts and signal strengths at various thresholds as perspective extended horizontal and vertical polarization models. This paper compares the predictive ability of 18 models and measures the fit. Finally, a predication graph is depicted with the neural network's probability profile for packet counts =1 when greater than or equal to 377. Likewise, a python script is provided of the extended horizontal and vertical polarization model in Appendix C. Consequently, the neural network model was applied to 10 different DSRC RSU data sets at 10 unique locations around a circular test track with packet counts ranging from 0 to 11. Neural network models were generated for 10 DSRC RSUs using three thresholds with an objective to compare the predictive ability of each model and measure the fit. Based on 30 models at 10 unique locations, the highest misclassification was 0.1248, while the lowest misclassification was 0.000. There were six RSUs mounted at 3.048 (or 10 feet) from the ground with a misclassification rate that ranged from 0.1248 to 0.0553. Out of 18 models, seven had a misclassification rate greater than 0.110, while the remaining misclassification rates were less than 0.0993. There were four RSUs mounted at 6.096 meters (or 20 feet) from the ground with a misclassification rate that ranged from 0.919 to 0.000. Out of 12 models, four had a misclassification rate greater than 0.0590, while the remaining misclassification rates were less than 0.0412. Finally, there are two major limitations in the research: 1) the most effective key parameter is packet counts, which often require expensive data acquisition equipment to obtain the information and 2) the categorical type (i.e., decision tree, logistic regression, and neural network) will vary based on the packet counts or signal strength threshold that is dictated by the threshold criterion. There are at least two future research areas that correspond to this body of work: 1) there is a need to leverage the extended horizontal and vertical polarization null point model on multiple DSRC RSUs along a highway on/off ramp, and 2) there is a need to apply and validate different electric and magnetic (or propagation) models. / Ph. D. / The deployment of dedicated short-range communications (DSRC) roadside units (RSUs) allows a connected or automated vehicle to acquire information from the surrounding environment using vehicle-to-infrastructure (V2I) communication. However, wireless communication using DSRC has shown to exhibit null points, at repeatable distances. The null points are significant and there was unexpected loss in the wireless signal strength along the pathway of the V2I communication. If the wireless connection is poor or non-existent, the V2I safety application will not obtain sufficient data to perform the operation services. In other words, a poor wireless connection between a vehicle and infrastructure (e.g., RSU) could hamper the performance of a safety application. For example, a designer of a V2I safety application may require a minimum rate of data (or packet count) over 1,000 meters to effectively implement a Reduced Speed/Work Zone Warning (RSZW) application. The RSZW safety application is aimed to alert or warn drivers, in a Cooperative Adaptive Cruise Control (CACC) platoon, who are approaching a work zone. Therefore, the packet counts and/or signal strength threshold criterion must be determined by the developer of the V2I safety application. Thus, we selected an arbitrary criterion to develop an empirical method of ascertaining the null points from a DSRC RSU. The research motivation focuses on developing an empirical method of calculating the null points of a DSRC RSU for V2I communication at a highway on/off-ramp. The intent is to improve safety, mobility, and environmental applications since a map of the null points can be plotted against the distance between the DSRC RSU and a vehicle’s onboard unit (OBU). The main research question asks: “What is a more robust empirical method, compared to the horizontal and vertical laws of reflection formula, in determining the null points from a DSRC RSU on a highway on/off ramp?” The research objectives are as follows: 1. Explain where and why null points occur from a DSRC RSU (Chapter 2) 2. Apply the existing horizontal and vertical polarization model and discuss the limitations of the model in a real-world scenario for a DSRC RSU on a highway on/off ramp (Chapter 3 and Appendix A) 3. Introduce an extended horizontal and vertical polarization null point model using empirical data (Chapter 4) 4. Discuss the conclusion, limitations of work, and future research (Chapter 5). The simplest manner to understand where and why null points occur is depicted as two sinusoidal waves: direct and reflective waves (i.e., also known as a two-ray model). The null points for a DSRC RSU occurs because the direct and reflective waves produce a destructive interference (i.e., decrease in signal strength) when they collide. Moreover, the null points can be located using Pythagorean theorem for the direct and reflective waves. Two existing models were leveraged to analyze null points: 1) signal strength loss (i.e., a free space path loss model, or FSPL, in Appendix A) and 2) the existing horizontal and vertical polarization null points from a DSRC RSU. Using empirical data from two different field tests, the existing horizontal and vertical polarization null point model was shown to contain limitations in short distances from the DSRC RSU. Moreover, the existing horizontal and vertical polarization model for null points was extremely challenging to replicate with over 15 DSRC RSU data sets. After calculating the null point for several DSRC RSU heights, the paper noticed a limitation of the existing horizontal and vertical polarization null point model with over 15 DSRC RSU data sets (i.e., the model does not account for null points along the full length of the FSPL model). An extended horizontal and vertical polarization model is proposed that calculates the null point from a DSRC RSU. There are 18 model comparisons of the packet counts and signal strengths at various thresholds as perspective extended horizontal and vertical polarization models. This paper compares the predictive ability of 18 models and measures the fit. Finally, a predication graph is depicted with the neural network’s probability profile for packet counts =1 when greater than or equal to 377. Likewise, a python script is provided of the extended horizontal and vertical polarization model in Appendix C. Consequently, the neural network model was applied to 10 different DSRC RSU data sets at 10 unique locations around a circular test track with packet counts ranging from 0 to 11. Neural network models were generated for 10 DSRC RSUs using three thresholds with an objective to compare the predictive ability of each model and measure the fit. Based on 30 models at 10 unique locations, the highest misclassification was 0.1248, while the lowest misclassification was 0.000. There were six RSUs mounted at 3.048 (or 10 feet) from the ground with a misclassification rate that ranged from 0.1248 to 0.0553. Out of 18 models, seven had a misclassification rate greater than 0.110, while the remaining misclassification rates were less than 0.0993. There were four RSUs mounted at 6.096 meters (or 20 feet) from the ground with a misclassification rate that ranged from 0.919 to 0.000. Out of 12 models, four had a misclassification rate greater than 0.0590, while the remaining misclassification rates were less than 0.0412. Finally, there are two major limitations in the research: 1) the most effective key parameter is packet counts, which often require expensive data acquisition equipment to obtain the information and 2) the categorical type (i.e., decision tree, logistic regression, and neural network) will vary based on the packet counts or signal strength threshold that is dictated by the threshold criterion. There are at least two future research areas that correspond to this body of work: 1) there is a need to leverage the extended horizontal and vertical polarization null point model on multiple DSRC RSUs along a highway on/off ramp, and 2) there is a need to apply and validate different electric and magnetic (or propagation) models.

Cette thèse présente des applications véhiculaires à différentes échelles : de la petite qui permet d'effectuer des tests réels de communication et de service ; à des plus grandes incluant plus de contraintes mais permettant des simulations sur l'ensemble du réseau. Dans ce contexte nous soulignons l'importance d'avoir et de traiter des données réelles afin de pouvoir interpréter correctement les résultats. A travers ces échelles nous proposons différents services utilisant la communication V2V et V2I. Nous ne prétendons pas prendre le contrôle du véhicule, notre but est de montrer le potentiel de la communication à travers différents services. La petite échelle se focalise sur un service à un feu de circulation permettant d'améliorer les temps de parcours et d'attente, et la consommation en CO2 et en carburant. La moyenne échelle se situant sur un rond-point, permet grâce à un algorithme décentralisé, d'améliorer ces mêmes paramètres, mais montre également qu'avec une prise de décision simple et décentralisée, le système est robuste face à la perte de paquet, à la densité, aux comportements humains ou encore aux taux d'équipement. Enfin à l'échelle d'une ville, nous montrons que grâce à des décisions prises de manière locale et décentralisée, avec seulement un accès à une information partielle dans le réseau, nous obtenons des résultats proches des solutions centralisées. La quantité de données transitant ainsi dans le réseau est considérablement diminuée. Nous testons également la réponse de ces systèmes en cas de perturbation plus ou moins importante tels que des travaux, un acte terroriste ou une catastrophe naturelle. Les modèles permettant une prise de décision locale grâce aux informations délivrées autour du véhicule montrent leur potentiel que se soit avec de la communication avec l'infrastructure V2I ou entre les véhicules V2V. / In this thesis we present vehicular applications across different scales: from small scale that allows real tests of communication and services; to larger scales that include more constraints but allowing simulations on the entire network. In this context, we highlight the importance of real data and real urban topology in order to properly interpret the results of simulations. We describe different services using V2V and V2I communication. In each of them we do not pretend to take control of the vehicle, the driver is present in his vehicle, our goal is to show the potential of communication through services taking into account the difficulties outlined above. In the small scale, we focus on a service with a traffic light that improves travel times, waiting times and CO2 and fuel consumption. The medium scale is a roundabout, it allows, through a decentralized algorithm, to improve the same parameters. It also shows that with a simple and decentralized decision-making process, the system is robust to packet loss, density, human behavior or equipment rate. Finally on the scale of a city, we show that local and decentralized decisions, with only a partial access to information in the network, lead to results close to centralized solutions. The amount of data in the network is greatly reduced. We also test the response of these systems in case of significant disruption in the network such as roadworks, terrorist attack or natural disaster. Models, allowing local decision thanks to information delivered around the vehicle, show their potential whatsoever with the V2I communication or V2V.

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.

<p>This licentiate thesis work investigates two medium access control (MAC) methods, when used in traffic safety applications over vehicular <em>ad hoc</em> networks (VANETs). The MAC methods are carrier sense multiple access (CSMA), as specified by the leading standard for VANETs IEEE 802.11p, and self-organizing time-division multiple access (STDMA) as used by the leading standard for transponders on ships. All vehicles in traffic safety applications periodically broadcast cooperative awareness messages (CAMs). The CAM based data traffic implies requirements on a predictable, fair and scalable medium access mechanism. The investigated performance measures are <em>channel access delay</em>, <em>number of consecutive packet drops</em> and the <em>distance between concurrently transmitting nodes</em>. Performance is evaluated by computer simulations of a highway scenario in which all vehicles broadcast CAMs with different update rates and packet lengths. The obtained results show that nodes in a CSMA system can experience <em>unbounded channel access delays</em> and further that there is a significant difference between the best case and worst case channel access delay that a node could experience. In addition, with CSMA there is a very high probability that several <em>concurrently transmitting nodes are located close to each other</em>. This occurs when nodes start their listening periods at the same time or when nodes choose the same backoff value, which results in nodes starting to transmit at the same time instant. The CSMA algorithm is therefore both <em>unpredictable</em> and <em>unfair</em> besides the fact that it <em>scales badly</em> for broadcasted CAMs. STDMA, on the other hand, will always grant channel access for all packets before a predetermined time, regardless of the number of competing nodes. Therefore, the STDMA algorithm is <em>predictable</em> and <em>fair</em>. STDMA, using parameter settings that have been adapted to the vehicular environment, is shown to outperform CSMA when considering the performance measure <em>distance between concurrently transmitting nodes</em>. In CSMA the distance between concurrent transmissions is random, whereas STDMA uses the side information from the CAMs to properly schedule concurrent transmissions in space. The price paid for the superior performance of STDMA is the required network synchronization through a global navigation satellite system, e.g., GPS. That aside since STDMA was shown to be scalable, predictable and fair; it is an excellent candidate for use in VANETs when complex communication requirements from traffic safety applications should be met.</p>

This thesis presents a novel approach to several problems in intelligent transportation systems using collaborative driving coordination. With inter-vehicle communication and intelligent vehicle cooperation, important tasks in transportation such as lane position determination, lane assignment and platoon formation can be solved. Several topics in regard to inter-vehicle communication, lane positioning, lane assignment and platoon formation are explored in this thesis: First, the design and experimental results of low-cost lane-level positioning system that can support a large number of transportation applications are discussed. Using a Markov-based approach based on sharing information among a group of vehicles that are traveling within the communication range of each other, the lane positions of vehicles can be determined. The robustness effectiveness of the system is shown in both simulations and real road tests. Second, a decentralized approach to lane scheduling for vehicles with an aim to increase traffic throughput while ensuring the vehicles exit successfully at their destinations is presented. Most of current traffic management systems do not consider lane organization of vehicles and only regulate traffic flows by controlling traffic signals or ramp meters. However, traffic throughput and efficient use of highways can be increased by coordinating driver behaviors intelligently. The lane optimization problem is formulated as a linear programming problem that can be solved using the Simplex method. Finally, a direction for cooperative vehicle platoon formation is proposed. To enhance traffic safety, increase lane capacities and reduce fuel consumption, vehicles can be organized into platoons with the objective of maximizing the travel distance that platoons stay intact. Toward this end, this work evaluates a proposed strategy which assigns vehicles to platoons by solving an optimization problem. A linear model for assigning vehicles to appropriate platoons when they enter the highway is formulated. Simulation results demonstrate that lane capacity can be increased effectively when platooning operation is used.

This thesis presents a novel approach to several problems in intelligent transportation systems using collaborative driving coordination. With inter-vehicle communication and intelligent vehicle cooperation, important tasks in transportation such as lane position determination, lane assignment and platoon formation can be solved. Several topics in regard to inter-vehicle communication, lane positioning, lane assignment and platoon formation are explored in this thesis: First, the design and experimental results of low-cost lane-level positioning system that can support a large number of transportation applications are discussed. Using a Markov-based approach based on sharing information among a group of vehicles that are traveling within the communication range of each other, the lane positions of vehicles can be determined. The robustness effectiveness of the system is shown in both simulations and real road tests. Second, a decentralized approach to lane scheduling for vehicles with an aim to increase traffic throughput while ensuring the vehicles exit successfully at their destinations is presented. Most of current traffic management systems do not consider lane organization of vehicles and only regulate traffic flows by controlling traffic signals or ramp meters. However, traffic throughput and efficient use of highways can be increased by coordinating driver behaviors intelligently. The lane optimization problem is formulated as a linear programming problem that can be solved using the Simplex method. Finally, a direction for cooperative vehicle platoon formation is proposed. To enhance traffic safety, increase lane capacities and reduce fuel consumption, vehicles can be organized into platoons with the objective of maximizing the travel distance that platoons stay intact. Toward this end, this work evaluates a proposed strategy which assigns vehicles to platoons by solving an optimization problem. A linear model for assigning vehicles to appropriate platoons when they enter the highway is formulated. Simulation results demonstrate that lane capacity can be increased effectively when platooning operation is used.

Vehicular networking is envisioned to be a key technology area for significant growth in the coming years. Although the expectations for this emerging technology are set very high, many practical aspects remain still unsolved for a vast deployment of vehicular networks. This dissertation addresses the enabling physical layer techniques to meet the challenges in vehicular networks operating in mobile wireless environments. Considering the infrastructure-less nature of vehicular networks, we envision cooperative diversity well positioned to meet the demanding requirements of vehicular networks with their underlying distributed structure. Cooperative diversity has been proposed as a powerful means to enhance the performance of high-rate communications over wireless fading channels. It realizes spatial diversity advantages in a distributed manner where a node uses others antennas to relay its message creating a virtual antenna array. Although cooperative diversity has garnered much attention recently, it has not yet been fully explored in the context of vehicular networks considering the unique characteristics of vehicular networks, this dissertation provides an error performance analysis study of cooperative transmission schemes for various deployment and traffic scenarios. In the first part of this dissertation, we investigate the performance of a cooperative vehicle-to-vehicle (V2V) system with amplify-and-forward relaying for typical traffic scenarios under city/urban settings and a highway area. We derive pairwise error probability (PEP) expressions and demonstrate the achievable diversity gains. The effect of imperfect channel state information (CSI) is also studied through an asymptotical PEP analysis. We present Monte-Carlo simulations to confirm the analytical derivations and present the error rate performance of the vehicular scheme with perfect and imperfect-CSI. In the second part, we consider road-to-vehicle (R2V) communications in which roadside access points use cooperating vehicles as relaying terminals. Under the assumption of decode-and-forward relaying, we derive PEP expressions for single-relay and multi-relay scenarios. In the third part, we consider a cooperative multi-hop V2V system in which direct transmission is not possible and investigate its performance through the PEP derivation and diversity gain analysis. Monte-Carlo simulations are further provided to con firm the analytical derivations and provide insight into the error rate performance improvement.

Vehicular networking is envisioned to be a key technology area for significant growth in the coming years. Although the expectations for this emerging technology are set very high, many practical aspects remain still unsolved for a vast deployment of vehicular networks. This dissertation addresses the enabling physical layer techniques to meet the challenges in vehicular networks operating in mobile wireless environments. Considering the infrastructure-less nature of vehicular networks, we envision cooperative diversity well positioned to meet the demanding requirements of vehicular networks with their underlying distributed structure. Cooperative diversity has been proposed as a powerful means to enhance the performance of high-rate communications over wireless fading channels. It realizes spatial diversity advantages in a distributed manner where a node uses others antennas to relay its message creating a virtual antenna array. Although cooperative diversity has garnered much attention recently, it has not yet been fully explored in the context of vehicular networks considering the unique characteristics of vehicular networks, this dissertation provides an error performance analysis study of cooperative transmission schemes for various deployment and traffic scenarios. In the first part of this dissertation, we investigate the performance of a cooperative vehicle-to-vehicle (V2V) system with amplify-and-forward relaying for typical traffic scenarios under city/urban settings and a highway area. We derive pairwise error probability (PEP) expressions and demonstrate the achievable diversity gains. The effect of imperfect channel state information (CSI) is also studied through an asymptotical PEP analysis. We present Monte-Carlo simulations to confirm the analytical derivations and present the error rate performance of the vehicular scheme with perfect and imperfect-CSI. In the second part, we consider road-to-vehicle (R2V) communications in which roadside access points use cooperating vehicles as relaying terminals. Under the assumption of decode-and-forward relaying, we derive PEP expressions for single-relay and multi-relay scenarios. In the third part, we consider a cooperative multi-hop V2V system in which direct transmission is not possible and investigate its performance through the PEP derivation and diversity gain analysis. Monte-Carlo simulations are further provided to con firm the analytical derivations and provide insight into the error rate performance improvement.

This licentiate thesis work investigates two medium access control (MAC) methods, when used in traffic safety applications over vehicular ad hoc networks (VANETs). The MAC methods are carrier sense multiple access (CSMA), as specified by the leading standard for VANETs IEEE 802.11p, and self-organizing time-division multiple access (STDMA) as used by the leading standard for transponders on ships. All vehicles in traffic safety applications periodically broadcast cooperative awareness messages (CAMs). The CAM based data traffic implies requirements on a predictable, fair and scalable medium access mechanism. The investigated performance measures are channel access delay, number of consecutive packet drops and the distance between concurrently transmitting nodes. Performance is evaluated by computer simulations of a highway scenario in which all vehicles broadcast CAMs with different update rates and packet lengths. The obtained results show that nodes in a CSMA system can experience unbounded channel access delays and further that there is a significant difference between the best case and worst case channel access delay that a node could experience. In addition, with CSMA there is a very high probability that several concurrently transmitting nodes are located close to each other. This occurs when nodes start their listening periods at the same time or when nodes choose the same backoff value, which results in nodes starting to transmit at the same time instant. The CSMA algorithm is therefore both unpredictable and unfair besides the fact that it scales badly for broadcasted CAMs. STDMA, on the other hand, will always grant channel access for all packets before a predetermined time, regardless of the number of competing nodes. Therefore, the STDMA algorithm is predictable and fair. STDMA, using parameter settings that have been adapted to the vehicular environment, is shown to outperform CSMA when considering the performance measure distance between concurrently transmitting nodes. In CSMA the distance between concurrent transmissions is random, whereas STDMA uses the side information from the CAMs to properly schedule concurrent transmissions in space. The price paid for the superior performance of STDMA is the required network synchronization through a global navigation satellite system, e.g., GPS. That aside since STDMA was shown to be scalable, predictable and fair; it is an excellent candidate for use in VANETs when complex communication requirements from traffic safety applications should be met.