Intelligent and bandwidth-efficient medium access control protocols for IEEE 802.11p-based Vehicular Ad hoc Networks

Vehicle-to-Vehicle (V2V) technology aims to enable safer and more sophisticated transportation via the spontaneous formation of Vehicular Ad hoc Networks (VANETs). This type of wireless networks allows the exchange of kinematic and other data among vehicles, for the primary purpose of safer and more efficient driving, as well as efficient traffic management and other third-party services. Their infrastructure-less, unbounded nature allows the formation of dense networks that present a channel sharing issue, which is harder to tackle than in conventional WLANs. This thesis focuses on optimising channel access strategies, which is important for the efficient usage of the available wireless bandwidth and the successful deployment of VANETs. To start with, the default channel access control method for V2V is evaluated hardware via modifying the appropriate wireless interface Linux driver to enable finer on-the-fly control of IEEE 802.11p access control layer parameters. More complex channel sharing scenarios are evaluated via simulations and findings on the behaviour of the access control mechanism are presented. A complete channel sharing efficiency assessment is conducted, including throughput, fairness and latency measurements. A new IEEE 802.11p-compatible Q-Learning-based access control approach that improves upon the studied protocol is presented. The stations feature algorithms that “learn” how to act optimally in VANETs in order to maximise their achieved packet delivery and minimise bandwidth wastage. The feasibility of Q-Learning to be used as the base of selflearning protocols for IEEE 802.11p-based V2V communication access control in dense environments is investigated in terms of parameter tuning, necessary time of exploration, achieving latency requirements, scaling, multi-hop and accommodation of simultaneous applications. Additionally, the novel Collection Contention Estimation (CCE) mechanism for Q-Learning-based access control is presented. By embedding it on the Q-Learning agents, faster convergence, higher throughput, better service separation and short-term fairness are achieved in simulated network deployments. The acquired new insights on the network performance of the proposed algorithms can provide precise guidelines for efficient designs of practical, reliable, fair and ultra-low latency V2V communication systems for dense topologies. These results can potentially have an impact across a range of related areas, including various types of wireless networks and resource allocation for these, network protocol and transceiver design as well as QLearning applicability and considerations for correct use

A Q-Learning approach with collective contention estimation for bandwidth-efficient and fair access control in IEEE 802.11p vehicular networks

Vehicular Ad hoc Networks (VANETs) are wireless networks formed of moving vehicle-stations, that enable safety-related packet exchanges among them. Their infrastructure-less, unbounded nature allows the formation of dense networks that present a channel sharing issue, which is harder to tackle than in conventional WLANs, due to fundamental differences of the protocol stack. Optimising channel access strategies is important for the efficient usage of the available wireless bandwidth and the successful deployment of VANETs. We present a Q-Learning-based approach to wirelessly network a big number of vehicles and enable the efficient exchange of data packets among them. More specifically, this work focuses on a IEEE 802.11p-compatible contention-based Medium Access Control (MAC) protocol for efficiently sharing the wireless channel among multiple vehicular stations. The stations feature algorithms that "learn" how to act optimally in a network in order to maximise their achieved packet delivery and minimise bandwidth wastage. Additionally, via a Collective Contention Estimation (CCE) mechanism which we embed on the Q-Learning agent, faster convergence, higher throughput and short-term fairness are achieved

A Cyber Physical Systems Perspective on the Real-time and Reliable Dissemination of Information in Intelligent Transportation Systems

Timely and reliable dissemination of traffic-related information to drivers is a key property that intelligent transportation systems (ITS) should support. Numerous impediments stemming due to (a) physical factors, such as mobility and speed of vehicles, density of vehicles, characteristics of the wireless radio channel, and power and bit rate of radio transceivers, and (b) cyber issues, such as MAC layer access point associations and address resolutions (ARP), network layer addressing, routing and handoffs, and transport layer retransmissions lead to unpredictability in the timely and reliable dissemination of information to drivers. This paper presents compelling arguments in favor of new research directions in this area that are based on a cyber-physical systems (CPS) perspective. In particular, this paper makes three contributions. First, it considers a vehicle-centric perspective to survey and study the physics-and cyber-imposed impediments to the timely and reliable dissemination of information. Second, it presents a promising CPS solution to overcome a subset of the impediments discovered. Third, it outlines lessons learned indicating the need for more focused research and realistic testbeds. The evaluations 1 www.macrothink.org/npa Network Protocols and Algorithm

Achieving reliable and enhanced communication in vehicular ad hoc networks (VANETs)

A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirement for the degree of Doctor of PhilosophyWith the envisioned age of Internet of Things (IoTs), different aspects of Intelligent Transportation System (ITS) will be linked so as to advance road transportation safety, ease congestion of road traffic, lessen air pollution, improve passenger transportation comfort and significantly reduce road accidents. In vehicular networks, regular exchange of current position, direction, speed, etc., enable mobile vehicle to foresee an imminent vehicle accident and notify the driver early enough in order to take appropriate action(s) or the vehicle on its own may take adequate preventive measures to avert the looming accident. Actualizing this concept requires use of shared media access protocol that is capable of guaranteeing reliable and timely broadcast of safety messages. This dissertation investigates the use of Network Coding (NC) techniques to enrich the content of each transmission and ensure improved high reliability of the broadcasted safety messages with less number of retransmissions. A Code Aided Retransmission-based Error Recovery (CARER) protocol is proposed. In order to avoid broadcast storm problem, a rebroadcasting vehicle selection metric η, is developed, which is used to select a vehicle that will rebroadcast the received encoded message. Although the proposed CARER protocol demonstrates an impressive performance, the level of incurred overhead is fairly high due to the use of complex rebroadcasting vehicle selection metric. To resolve this issue, a Random Network Coding (RNC) and vehicle clustering based vehicular communication scheme with low algorithmic complexity, named Reliable and Enhanced Cooperative Cross-layer MAC (RECMAC) scheme, is proposed. The use of this clustering technique enables RECMAC to subdivide the vehicular network into small manageable, coordinated clusters which further improve transmission reliability and minimise negative impact of network overhead. Similarly, a Cluster Head (CH) selection metric ℱ(\u1d457) is designed, which is used to determine and select the most suitably qualified candidate to become the CH of a particular cluster. Finally, in order to investigate the impact of available radio spectral resource, an in-depth study of the required amount of spectrum sufficient to support high transmission reliability and minimum latency requirements of critical road safety messages in vehicular networks was carried out. The performance of the proposed schemes was clearly shown with detailed theoretical analysis and was further validated with simulation experiments

Reliable Message Dissemination in Mobile Vehicular Networks

Les réseaux véhiculaires accueillent une multitude d’applications d’info-divertissement et de sécurité. Les applications de sécurité visent à améliorer la sécurité sur les routes (éviter les accidents), tandis que les applications d’info-divertissement visent à améliorer l'expérience des passagers. Les applications de sécurité ont des exigences rigides en termes de délais et de fiabilité ; en effet, la diffusion des messages d’urgence (envoyés par un véhicule/émetteur) devrait être fiable et rapide. Notons que, pour diffuser des informations sur une zone de taille plus grande que celle couverte par la portée de transmission d’un émetteur, il est nécessaire d’utiliser un mécanisme de transmission multi-sauts. De nombreuses approches ont été proposées pour assurer la fiabilité et le délai des dites applications. Toutefois, ces méthodes présentent plusieurs lacunes. Cette thèse, nous proposons trois contributions. La première contribution aborde la question de la diffusion fiable des messages d’urgence. A cet égard, un nouveau schéma, appelé REMD, a été proposé. Ce schéma utilise la répétition de message pour offrir une fiabilité garantie, à chaque saut, tout en assurant un court délai. REMD calcule un nombre optimal de répétitions en se basant sur l’estimation de la qualité de réception de lien dans plusieurs locations (appelées cellules) à l’intérieur de la zone couverte par la portée de transmission de l’émetteur. REMD suppose que les qualités de réception de lien des cellules adjacentes sont indépendantes. Il sélectionne, également, un nombre de véhicules, appelés relais, qui coopèrent dans le contexte de la répétition du message d’urgence pour assurer la fiabilité en multi-sauts. La deuxième contribution, appelée BCRB, vise à améliorer REMD ; elle suppose que les qualités de réception de lien des cellules adjacentes sont dépendantes ce qui est, généralement, plus réaliste. BCRB utilise les réseaux Bayésiens pour modéliser les dépendances en vue d’estimer la qualité du lien de réception avec une meilleure précision. La troisième contribution, appelée RICS, offre un accès fiable à Internet. RICS propose un modèle d’optimisation, avec une résolution exacte optimale à l'aide d’une technique de réduction de la dimension spatiale, pour le déploiement des passerelles. Chaque passerelle utilise BCRB pour établir une communication fiable avec les véhicules.Vehicular networks aim to enable a plethora of safety and infotainment applications. Safety applications aim to preserve people's lives (e.g., by helping in avoiding crashes) while infotainment applications focus on enhancing the passengers’ experience. These applications, especially safety applications, have stringent requirements in terms of reliability and delay; indeed, dissemination of an emergency message (e.g., by a vehicle/sender involved in a crash) should be reliable while satisfying short delay requirements. Note, that multi-hop dissemination is needed to reach all vehicles, in the target area, that may be outside the transmission range of the sender. Several schemes have been proposed to provide reliability and short delay for vehicular applications. However, these schemes have several limitations. Thus, the design of new solutions, to meet the requirement of vehicular applications in terms of reliability while keeping low end-to-end delay, is required. In this thesis, we propose three schemes. The first scheme is a multi-hop reliable emergency message dissemination scheme, called REMD, which guarantees a predefined reliability , using message repetitions/retransmissions, while satisfying short delay requirements. It computes an optimal number of repetitions based on the estimation of link reception quality at different locations (called cells) in the transmission range of the sender; REMD assumes that link reception qualities of adjacent cells are independent. It also adequately selects a number of vehicles, called forwarders, that cooperate in repeating the emergency message with the objective to satisfy multi-hop reliability requirements. The second scheme, called BCRB, overcomes the shortcoming of REMD by assuming that link reception qualities of adjacent cells are dependent which is more realistic in real-life scenarios. BCRB makes use of Bayesian networks to model these dependencies; this allows for more accurate estimation of link reception qualities leading to better performance of BCRB. The third scheme, called RICS, provides internet access to vehicles by establishing multi-hop reliable paths to gateways. In RICS, the gateway placement is modeled as a k-center optimisation problem. A space dimension reduction technique is used to solve the problem in exact time. Each gateway makes use of BCRB to establish reliable communication paths to vehicles

The Mobility Impact in IEEE 802.11p Infrastructureless Vehicular Networks

Vehicular ad hoc networks (VANETs) are an extreme case of mobile ad hoc networks (MANETs). High speed and frequent network topology changes are the main characteristics of vehicular networks. These characteristics lead to special issues and challenges in the network design, especially at the medium access control (MAC) layer. Due to high speed of nodes and their frequent disconnections, it is difficult to design a MAC scheme in VANETs that satisfies the quality-of-service requirements in all networking scenarios. In this thesis, we provide a comprehensive evaluation of the mobility impact on the IEEE 802.11p MAC performance. The study evaluates basic performance metrics such as packet delivery ratio, throughput, and delay, as well as the impact of mobility factors. The study also presents a relation between the mobility factors and the respective medium access behavior. Moreover, a new unfairness problem according to node relative speed is identified for both broadcast and unicast scenarios. To achieve better performance, we propose two dynamic contention window mechanisms to alleviate network performance degradation due to high mobility. Extensive simulation results show the significant impact of mobility on the IEEE 802.11p MAC performance, an identification of a new unfairness problem in the vehicle-to-vehicle (V2V) communications, and the effectiveness of the proposed MAC schemes

A middleware protocol for time-critical wireless communication of large data samples

We present a middleware-based protocol that reliably synchronizes large samples consisting of multiple frames efficiently and within application level QoS requirements over a lossy wireless channel. The protocol uses a custom retransmission scheme, exploiting the latency requirements on sample level for frame level scheduling. It can be integrated into the popular DDS middleware. We investigate some technical limits of such a protocol and compare it to existing error protocols in the software stack and in the wireless protocol and combinations thereof. The comparison is based on an Omnet++ simulation using an established wireless channel error model. For evaluation, we take a use case from automated valet parking where infrastructure data provided via a wireless link augments in-vehicle sensor data. The use case respects the related safety requirements. Results show that the application awareness of the presented protocol, significantly improves service availability by transmitting data efficiently in time even under higher frame error rates

Increased Persistence of Wi-Fi Direct Networks for Smartphone-based Collision Avoidance

Inter-vehicular communication is a promising technology to improve road safety. Inter-vehicular communication over a wireless medium can be used to exchange important information such as the speed, location, and headings of a vehicle with nearby vehicles. Using this information, it is possible to calculate if a collision is imminent and warn the driver to take action. Wi-Fi can also be used to share this information, however it requires an access point hardware to facilitate communication. Wi-Fi Direct enabled devices can share information without a hardware access point. Wi-Fi Direct provides peer to peer communication by employing a software defined access point embedded within the system. Wi-Fi Direct is a technology that is present on many smart phones, eliminating the need for dedicated access point hardware. In collision avoidance application, Wi-Fi Direct maybe used to exchange safety-related information between vehicles. Collision avoidance systems developed using smartphones can also be extended to protecting pedestrians carrying a smartphone and in this role they could be a long-term solution for certain vulnerable road user collision scenarios. Smartphones with Wi-Fi Direct capability could provide a path to early, low-cost implementation of inter-vehicle communication for collision avoidance. However, there are many limitations to such a system that are addressed in this thesis. Wi-Fi Direct functions by creating groups. One of the nodes in the group is elected as the group owner that acts as an access point and manages the communication between the nodes within the group. If the group owner moves out of range, reforming the group is a lengthy process. This thesis proposes a new method for nomination of the group owner to reduce the likelihood that the group owner will move out of range. This thesis introduces the concept of nominating a Backup Group Owner that can quickly replace the group owner if the group owner shuts down or moves out of range of the group. An orderly handoff from the group owner to the Backup Group Owner can prevent loss of communication among nodes. An analytical study of the amount of time saved by adopting the proposed method of electing the BGO is presented