Towards reliable geographic broadcasting in vehicular networks

In Vehicular ad hoc Networks (VANETs), safety-related messages are broadcasted amongst cars, helping to improve drivers' awareness of the road situation. VANETs’ reliability are highly affected by channel contention. This thesis first addresses the issue of channel use efficiency in geographical broadcasts (geocasts). Constant connectivity changes inside a VANET make the existing routing algorithms unsuitable. This thesis presents a geocast algorithm that uses a metric to estimate the ratio of useful to useless packet received. Simulations showed that this algorithm is more channel-efficient than the farthest-first strategy. It also exposes a parameter, allowing it to adapt to channel load. Second, this thesis presents a method of estimating channel load for providing feedback to moderate the offered load. A theoretical model showing the relationship between channel load and the idle time between transmissions is presented and used to estimate channel contention. Unsaturated stations on the network were shown to have small but observable effects on this relationship. In simulations, channel estimators based on this model show higher accuracy and faster convergence time than by observing packet collisions. These estimators are also less affected by unsaturated stations than by observing packet collisions. Third, this thesis couples the channel estimator to the geocast algorithm, producing a closed-loop load-reactive system that allows geocasts to adapt to instantaneous channel conditions. Simulations showed that this system is not only shown to be more efficient in channel use and be able to adapt to channel contention, but is also able to self-correct suboptimal retransmission decisions. Finally, this thesis demonstrates that all tested network simulators exhibit unexpected behaviours when simulating broadcasts. This thesis describes in depth the error in ns-3, leading to a set of workarounds that allows results from most versions of ns-3 to be interpreted correctly

Novel Internet of Vehicles Approaches for Smart Cities

Smart cities are the domain where many electronic devices and sensors transmit data via the Internet of Vehicles concept. The purpose of deploying many sensors in cities is to provide an intelligent environment and a good quality of life. However, different challenges still appear in smart cities such as vehicular traffic congestion, air pollution, and wireless channel communication aspects. Therefore, in order to address these challenges, this thesis develops approaches for vehicular routing, wireless channel congestion alleviation, and traffic estimation. A new traffic congestion avoidance approach has been developed in this thesis based on the simulated annealing and TOPSIS cost function. This approach utilizes data such as the traffic average travel speed from the Internet of Vehicles. Simulation results show that the developed approach improves the traffic performance for the Sheffield the scenario in the presence of congestion by an overall average of 19.22% in terms of travel time, fuel consumption and CO2 emissions as compared to other algorithms. In contrast, transmitting a large amount of data among the sensors leads to a wireless channel congestion problem. This affects the accuracy of transmitted information due to the packets loss and delays time. This thesis proposes two approaches based on a non-cooperative game theory to alleviate the channel congestion problem. Therefore, the congestion control problem is formulated as a non-cooperative game. A proof of the existence of a unique Nash equilibrium is given. The performance of the proposed approaches is evaluated on the highway and urban testing scenarios. This thesis also addresses the problem of missing data when sensors are not available or when the Internet of Vehicles connection fails to provide measurements in smart cities. Two approaches based on l1 norm minimization and a relevance vector machine type optimization are proposed. The performance of the developed approaches has been tested involving simulated and real data scenarios

A Survey on platoon-based vehicular cyber-physical systems

Vehicles on the road with some common interests can cooperatively form a platoon-based driving pattern, in which a vehicle follows another one and maintains a small and nearly constant distance to the preceding vehicle. It has been proved that, compared to driving individually, such a platoon-based driving pattern can significantly improve the road capacity and energy efficiency. Moreover, with the emerging vehicular adhoc network (VANET), the performance of platoon in terms of road capacity, safety and energy efficiency, etc., can be further improved. On the other hand, the physical dynamics of vehicles inside the platoon can also affect the performance of VANET. Such a complex system can be considered as a platoon-based vehicular cyber-physical system (VCPS), which has attracted significant attention recently. In this paper, we present a comprehensive survey on platoon-based VCPS. We first review the related work of platoon-based VCPS. We then introduce two elementary techniques involved in platoon-based VCPS: the vehicular networking architecture and standards, and traffic dynamics, respectively. We further discuss the fundamental issues in platoon-based VCPS, including vehicle platooning/clustering, cooperative adaptive cruise control (CACC), platoon-based vehicular communications, etc., and all of which are characterized by the tight coupled relationship between traffic dynamics and VANET behaviors. Since system verification is critical to VCPS development, we also give an overview of VCPS simulation tools. Finally, we share our view on some open issues that may lead to new research directions

Enhancing infotainment applications quality of service in vehicular ad hoc networks

Les réseaux ad hoc de véhicules accueillent une multitude d’applications intéressantes. Parmi celles-ci, les applications d’info-divertissement visent à améliorer l’expérience des passagers. Ces applications ont des exigences rigides en termes de délai de livraison et de débit. De nombreuses approches ont été proposées pour assurer la qualité du service des dites applications. Elles sont réparties en deux couches : réseau et contrôle d’accès. Toutefois, ces méthodes présentent plusieurs lacunes. Cette thèse a trois volets. Le premier aborde la question du routage dans le milieu urbain. A cet égard, un nouveau protocole, appelé SCRP, a été proposé. Il exploite l’information sur la circulation des véhicules en temps réel pour créer des épines dorsales sur les routes et les connecter aux intersections à l’aide des nœuds de pont. Ces derniers collectent des informations concernant la connectivité et le délai, utilisées pour choisir les chemins de routage ayant un délai de bout-en-bout faible. Le deuxième s’attaque au problème d’affectation des canaux de services afin d’augmenter le débit. A cet effet, un nouveau mécanisme, appelé ASSCH, a été conçu. ASSCH collecte des informations sur les canaux en temps réel et les donne à un modèle stochastique afin de prédire leurs états dans l’avenir. Les canaux les moins encombrés sont sélectionnés pour être utilisés. Le dernier volet vise à proposer un modèle analytique pour examiner la performance du mécanisme EDCA de la norme IEEE 802.11p. Ce modèle tient en compte plusieurs facteurs, dont l’opportunité de transmission, non exploitée dans IEEE 802.11p.The fact that vehicular ad hoc network accommodates two types of communications, Vehicle-to-Vehicle and Vehicle-to-Infrastructure, has opened the door for a plethora of interesting applications to thrive. Some of these applications, known as infotainment applications, focus on enhancing the passengers' experience. They have rigid requirements in terms of delivery delay and throughput. Numerous approaches have been proposed, at medium access control and routing layers, to enhance the quality of service of such applications. However, existing schemes have several shortcomings. Subsequently, the design of new and efficient approaches is vital for the proper functioning of infotainment applications. This work proposes three schemes. The first is a novel routing protocol, labeled SCRP. It leverages real-time vehicular traffic information to create backbones over road segments and connect them at intersections using bridge nodes. These nodes are responsible for collecting connectivity and delay information, which are used to select routing paths with low end-to-end delay. The second is an altruistic service channel selection scheme, labeled ASSCH. It first collects real-time service channels information and feeds it to a stochastic model that predicts the state of these channels in the near future. The least congested channels are then selected to be used. The third is an analytical model for the performance of the IEEE 802.11p Enhanced Distributed Channel Access mechanism that considers various factors, including the transmission opportunity (TXOP), unexploited by IEEE 802.11p

Broadcasting Protocol for Effective Data Dissemination in Vehicular Ad Hoc Networks

VANET topology is very dynamic due to frequent movements of the nodes. Using beacon information connected dominated set are formed and nodes further enhanced with neighbor elimination scheme. With acknowledgement the inter section issues are solve. A modified Broadcast Conquest and Delay De-synchronization mechanism address the broadcasting storm issues. Although data dissemination is possible in all direction, the performance of data dissemination in the opposite direction is investigated and compared against the existing protocols

Design of an adaptive congestion control protocol for reliable vehicle safety communication

[no abstract

DESIGN OF EFFICIENT IN-NETWORK DATA PROCESSING AND DISSEMINATION FOR VANETS

By providing vehicle-to-vehicle and vehicle-to-infrastructure wireless communications, vehicular ad hoc networks (VANETs), also known as the “networks on wheels”, can greatly enhance traffic safety, traffic efficiency and driving experience for intelligent transportation system (ITS). However, the unique features of VANETs, such as high mobility and uneven distribution of vehicular nodes, impose critical challenges of high efficiency and reliability for the implementation of VANETs. This dissertation is motivated by the great application potentials of VANETs in the design of efficient in-network data processing and dissemination. Considering the significance of message aggregation, data dissemination and data collection, this dissertation research targets at enhancing the traffic safety and traffic efficiency, as well as developing novel commercial applications, based on VANETs, following four aspects: 1) accurate and efficient message aggregation to detect on-road safety relevant events, 2) reliable data dissemination to reliably notify remote vehicles, 3) efficient and reliable spatial data collection from vehicular sensors, and 4) novel promising applications to exploit the commercial potentials of VANETs. Specifically, to enable cooperative detection of safety relevant events on the roads, the structure-less message aggregation (SLMA) scheme is proposed to improve communication efficiency and message accuracy. The scheme of relative position based message dissemination (RPB-MD) is proposed to reliably and efficiently disseminate messages to all intended vehicles in the zone-of-relevance in varying traffic density. Due to numerous vehicular sensor data available based on VANETs, the scheme of compressive sampling based data collection (CS-DC) is proposed to efficiently collect the spatial relevance data in a large scale, especially in the dense traffic. In addition, with novel and efficient solutions proposed for the application specific issues of data dissemination and data collection, several appealing value-added applications for VANETs are developed to exploit the commercial potentials of VANETs, namely general purpose automatic survey (GPAS), VANET-based ambient ad dissemination (VAAD) and VANET based vehicle performance monitoring and analysis (VehicleView). Thus, by improving the efficiency and reliability in in-network data processing and dissemination, including message aggregation, data dissemination and data collection, together with the development of novel promising applications, this dissertation will help push VANETs further to the stage of massive deployment

Exploiting user contention to optimize proactive resource allocation in future networks

In order to provide ubiquitous communication, seamless connectivity is now required in all environments including highly mobile networks. By using vertical handover techniques it is possible to provide uninterrupted communication as connections are dynamically switched between wireless networks as users move around. However, in a highly mobile environment, traditional reactive approaches to handover are inadequate. Therefore, proactive handover techniques, in which mobile nodes attempt to determine the best time and place to handover to local networks, are actively being investigated in the context of next generation mobile networks. The Y-Comm Framework which looks at proactive handover techniques has de�fined two key parameters: Time Before Handover and the Network Dwell Time, for any given network topology. Using this approach, it is possible to enhance resource management in common networks using probabilistic mechanisms because it is now possible to express contention for resources in terms of: No Contention, Partial Contention and Full Contention. As network resources are shared between many users, resource management must be a key part of any communication system as it is needed to provide seamless communication and to ensure that applications and servers receive their required Quality-of-Service. In this thesis, the contention for channel resources being allocated to mobile nodes is analysed. The work presents a new methodology to support proactive resource allocation for emerging future networks such as Vehicular Ad-Hoc Networks (VANETs) by allowing us to calculate the probability of contention based on user demand of network resources. These results are veri�ed using simulation. In addition, this proactive approach is further enhanced by the use of a contention queue to detect contention between incoming requests and those waiting for service. This thesis also presents a new methodology to support proactive resource allocation for future networks such as Vehicular Ad-Hoc Networks. The proposed approach has been applied to a vehicular testbed and results are presented that show that this approach can improve overall network performance in mobile heterogeneous environments. The results show that the analysis of user contention does provide a proactive mechanism to improve the performance of resource allocation in mobile networks