On the design of efficient Vehicular Applications

International audienceVehicular communications attract the attention of many people in the networking research world. These networks present some special features, such as high mobility or specific topologies, which affect the performance of applications. In order to select the appropriate technologies, more effort should be directed to identify the final necessities of the network. Few works identify possible applications of vehicular networks, but none of them link application requirements which networking technologies available in the vehicular field. In this paper, we fill this gap, and propose an analysis of application requirements and study how to deal with them using communication technologies for the physical and network level. This study contains key factors which must be taken into account, especially, at the designing stage of the vehicular network

Efficient Data Collection in Multimedia Vehicular Sensing Platforms

Vehicles provide an ideal platform for urban sensing applications, as they can be equipped with all kinds of sensing devices that can continuously monitor the environment around the travelling vehicle. In this work we are particularly concerned with the use of vehicles as building blocks of a multimedia mobile sensor system able to capture camera snapshots of the streets to support traffic monitoring and urban surveillance tasks. However, cameras are high data-rate sensors while wireless infrastructures used for vehicular communications may face performance constraints. Thus, data redundancy mitigation is of paramount importance in such systems. To address this issue in this paper we exploit sub-modular optimisation techniques to design efficient and robust data collection schemes for multimedia vehicular sensor networks. We also explore an alternative approach for data collection that operates on longer time scales and relies only on localised decisions rather than centralised computations. We use network simulations with realistic vehicular mobility patterns to verify the performance gains of our proposed schemes compared to a baseline solution that ignores data redundancy. Simulation results show that our data collection techniques can ensure a more accurate coverage of the road network while significantly reducing the amount of transferred data

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

Energy-aware Graph Job Allocation in Software Defined Air-Ground Integrated Vehicular Networks

The software defined air-ground integrated vehicular (SD-AGV) networks have emerged as a promising paradigm, which realize the flexible on-ground resource sharing to support innovative applications for UAVs with heavy computational overhead. In this paper, we investigate a vehicular cloud-assisted graph job allocation problem in SD-AGV networks, where the computation-intensive jobs carried by UAVs, and the vehicular cloud are modeled as graphs. To map each component of the graph jobs to a feasible vehicle, while achieving the trade-off among minimizing UAVs' job completion time, energy consumption, and the data exchange cost among vehicles, we formulate the problem as a mixed-integer non-linear programming problem, which is Np-hard. Moreover, the constraint associated with preserving job structures poses addressing the subgraph isomorphism problem, that further complicates the algorithm design. Motivated by which, we propose an efficient decoupled approach by separating the template (feasible mappings between components and vehicles) searching from the transmission power allocation. For the former, we present an efficient algorithm of searching for all the subgraph isomorphisms with low computation complexity. For the latter, we introduce a power allocation algorithm by applying convex optimization techniques. Extensive simulations demonstrate that the proposed approach outperforms the benchmark methods considering various problem sizes.Comment: 14 pages, 7 figure

Optimised protocols for time-critical applications and internetworking in wehicular ad-hoc networks

Vehicular ad-hoc networks (VANETs) that enable communication among vehicles and between vehicles and unmanned aerial vehicles (UAVs) and cellular base stations have recently attracted significant interest from the research community, due to the wide range of practical applications they can facilitate (e.g., road safety, traffic management and rescue missions). Despite this increased research activity, the high vehicle mobility in a VANET raises concerns regarding the robustness and adaptiveness of such networks to support time-critical applications and internetworking. In this thesis, as a first step toward the design of efficient MAC protocol to support time-critical applications and internetworking, we show that it is indeed possible to follow the dynamics of a network and consequently adapt the transmission probability of the Aloha protocol to reduce the interference and maximise the single-hop throughput between adjacent nodes. Extensive simulation validates the proposed analytical model, which thus can serve as a promising tool to improve VANETs performance. By exploiting the parallel between the CSMA/CA and Aloha performance models, the optimal transmission probability for the Aloha protocol as a function of estimated vehicular density is derived. This probability is then used to obtain the optimal maximum CW that can be integrated in an amended CSMA/CA protocol to maximise the single-hop throughput among adjacent vehicles. We show by means of simulation that the beneficial impact the proposed protocol is increased channel throughput and reduced transmission delay when compared with the standardised protocol CSMA/CA in IEEE 802.11p. These results reveal the applicability of the new, optimised protocol to safety applications and clustering techniques with stringent performance requirements. Lastly, we propose a Stable Clustering Algorithm for vehicular ad-hoc networks (SCalE) internetworking. The exchange of the necessary status information to support the efficient clusters formation can firmly relay on the support of our optimised CSMA/CA protocol. The SCalE algorithm makes use of the knowledge of the vehicles behaviour (explained in Chapter 5) for efficient selection of CHs, and selects a backup CH on top of the CH to maintain the stability of cluster structures. The increased stability and improved performance of the SCalE algorithm is studied and compared with existing clustering algorithms.Open Acces

Real-vehicle integration of driver support application with IPv6 GeoNetworking

International audienceOne of the essential usage of Intelligent Trans- portation Systems (ITS) applications is to provide road traffic information to vehicle drivers for road safety and efficient drive. For this usage, it is necessary to integrate geographical routing mechanisms in vehicular ad hoc network (VANET) into ITS applications. In this paper, we design and implement an ITS application which relies on IPv6 GeoNetworking; a geographical addressing and routing mechanism developed in the GeoNet project. Our application supports realistic use case scenarios, therefore we integrated it into INRIA's vehicular platform. The system has publicly been demonstrated in realistic scenarios