Secure Data Aggregation in Vehicular-Adhoc Networks: A Survey

AbstractVehicular ad hoc networks (VANETs) are an upcoming technology that is gaining momentum in recent years. That may be the reason that the network attracts more and more attention from both industry and academia. Due to the limited bandwidth of wireless communication medium, scalability is a major problem. Data aggregation is a solution to this. The goal of data aggregation is to combine the messages and disseminate this in larger region. While doing aggregation integrity of the information can not be easily verified and attacks may be possible. Hence aggregation must be secure. Although there are several surveys covering VANETs, they do not concentrate on security issues specifically on data aggregation. In this paper, we discuss and analyse various data aggregation techniques and their solutions

Supporting Protocols for Structuring and Intelligent Information Dissemination in Vehicular Ad Hoc Networks

The goal of this dissertation is the presentation of supporting protocols for structuring and intelligent data dissemination in vehicular ad hoc networks (VANETs). The protocols are intended to first introduce a structure in VANETs, and thus promote the spatial reuse of network resources. Segmenting a flat VANET in multiple cluster structures allows for more efficient use of the available bandwidth, which can effectively increase the capacity of the network. The cluster structures can also improve the scalability of the underlying communication protocols. The structuring and maintenance of the network introduces additional overhead. The aim is to provide a mechanism for creating stable cluster structures in VANETs, and to minimize this associated overhead. Further a hybrid overlay-based geocast protocol for VANETs is presented. The protocol utilizes a backbone overlay virtual infrastructure on top of the physical network to provide geocast support, which is crucial for intervehicle communications since many applications provide group-oriented and location-oriented services. The final contribution is a structureless information dissemination scheme which creates a layered view of road conditions with a diminishing resolution as the viewing distance increases. Namely, the scheme first provides a high-detail local view of a given vehicle\u27s neighbors and its immediate neighbors, which is further extended when information dissemination is employed. Each vehicle gets aggregated information for road conditions beyond this extended local view. The scheme allows for the preservation of unique reports within aggregated frames, such that safety critical notifications are kept in high detail, all for the benefit of the driver\u27s improved decision making during emergency scenarios

A Secure and Distributed Architecture for Vehicular Cloud and Protocols for Privacy-preserving Message Dissemination in Vehicular Ad Hoc Networks

Given the enormous interest in self-driving cars, Vehicular Ad hoc NETworks (VANETs) are likely to be widely deployed in the near future. Cloud computing is also gaining widespread deployment. Marriage between cloud computing and VANETs would help solve many of the needs of drivers, law enforcement agencies, traffic management, etc. The contributions of this dissertation are summarized as follows: A Secure and Distributed Architecture for Vehicular Cloud: Ensuring security and privacy is an important issue in the vehicular cloud; if information exchanged between entities is modified by a malicious vehicle, serious consequences such as traffic congestion and accidents can occur. In addition, sensitive data could be lost, and human lives also could be in danger. Hence, messages sent by vehicles must be authenticated and securely delivered to vehicles in the appropriate regions. In this dissertation, we present a secure and distributed architecture for the vehicular cloud which uses the capabilities of vehicles to provide various services such as parking management, accident alert, traffic updates, cooperative driving, etc. Our architecture ensures the privacy of vehicles and supports secure message dissemination using the vehicular infrastructure. A Low-Overhead Message Authentication and Secure Message Dissemination Scheme for VANETs: Efficient, authenticated message dissemination in VANETs are important for the timely delivery of authentic messages to vehicles in appropriate regions in the VANET. Many of the approaches proposed in the literature use Road Side Units (RSUs) to collect events (such as accidents, weather conditions, etc.) observed by vehicles in its region, authenticate them, and disseminate them to vehicles in appropriate regions. However, as the number of messages received by RSUs increases in the network, the computation and communication overhead for RSUs related to message authentication and dissemination also increases. We address this issue and present a low-overhead message authentication and dissemination scheme in this dissertation. On-Board Hardware Implementation in VANET: Design and Experimental Evaluation: Information collected by On Board Units (OBUs) located in vehicles can help in avoiding congestion, provide useful information to drivers, etc. However, not all drivers on the roads can benefit from OBU implementation because OBU is currently not available in all car models. Therefore, in this dissertation, we designed and built a hardware implementation for OBU that allows the dissemination of messages in VANET. This OBU implementation is simple, efficient, and low-cost. In addition, we present an On-Board hardware implementation of Ad hoc On-Demand Distance Vector (AODV) routing protocol for VANETs. Privacy-preserving approach for collection and dissemination of messages in VANETs: Several existing schemes need to consider safety message collection in areas where the density of vehicles is low and roadside infrastructure is sparse. These areas could also have hazardous road conditions and may have poor connectivity. In this dissertation, we present an improved method for securely collecting and disseminating safety messages in such areas which preserves the privacy of vehicles. We propose installing fixed OBUs along the roadside of dangerous roads (i.e., roads that are likely to have more ice, accidents, etc., but have a low density of vehicles and roadside infrastructure) to help collect data about the surrounding environment. This would help vehicles to be notified about the events on such roads (such as ice, accidents, etc.).Furthermore, to enhance the privacy of vehicles, our scheme allows vehicles to change their pseudo IDs in all traffic conditions. Therefore, regardless of whether the number of vehicles is low in the RSU or Group Leader GL region, it would be hard for an attacker to know the actual number of vehicles in the RSU/GL region

Benets of tight coupled architectures for the integration of GNSS receiver and Vanet transceiver

Vehicular adhoc networks (VANETs) are one emerging type of networks that will enable a broad range of applications such as public safety, traffic management, traveler information support and entertain ment. Whether wireless access may be asynchronous or synchronous (respectively as in the upcoming IEEE 8021.11p standard or in some alternative emerging solutions), a synchronization among nodes is required. Moreover, the information on position is needed to let vehicular services work and to correctly forward the messages. As a result, timing and positioning are a strong prerequisite of VANETs. Also the diffusion of enhanced GNSS Navigators paves the way to the integration between GNSS receivers and VANET transceiv ers. This position paper presents an analysis on potential benefits coming from a tightcoupling between the two: the dissertation is meant to show to what extent Intelligent Transportation System (ITS) services could benefit from the proposed architectur

Modeling In-Network Aggregation in VANETs

The multitude of applications envisioned for vehicular ad hoc networks requires efficient communication and dissemination mechanisms to prevent network congestion. In-network data aggregation promises to reduce bandwidth requirements and enable scalability in large vehicular networks. However, most existing aggregation schemes are tailored to specific applications and types of data. Proper comparative evaluation of different aggregation schemes is difficult. Yet, comparability is essential to properly measure accuracy, performance, and efficiency. We outline a modeling approach for VANET aggregation schemes to achieve objective comparability. Our modeling approach consists of three models, which provide different perspectives on an aggregation scheme. The generalized architecture model facilitates categorization of aggregation schemes. The aggregation information flow model supports analysis of where information is aggregated by a scheme. The aggregation state graph models how knowledge about the road network and its environment is represented by a scheme. Furthermore, it facilitates error estimation with respect to the ground truth. We apply each modeling approach to existing aggregation schemes from the literature and highlight strengths, as well as weaknesses, that can be used as a starting point for designing a more generic aggregation scheme

Time-Varying Graphs and Dynamic Networks

The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems -- delay-tolerant networks, opportunistic-mobility networks, social networks -- obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the formal models proposed so far to express some specific concepts are components of a larger formal description of this universe. The main contribution of this paper is to integrate the vast collection of concepts, formalisms, and results found in the literature into a unified framework, which we call TVG (for time-varying graphs). Using this framework, it is possible to express directly in the same formalism not only the concepts common to all those different areas, but also those specific to each. Based on this definitional work, employing both existing results and original observations, we present a hierarchical classification of TVGs; each class corresponds to a significant property examined in the distributed computing literature. We then examine how TVGs can be used to study the evolution of network properties, and propose different techniques, depending on whether the indicators for these properties are a-temporal (as in the majority of existing studies) or temporal. Finally, we briefly discuss the introduction of randomness in TVGs.Comment: A short version appeared in ADHOC-NOW'11. This version is to be published in Internation Journal of Parallel, Emergent and Distributed System

Improved Bounds on Information Dissemination by Manhattan Random Waypoint Model

With the popularity of portable wireless devices it is important to model and predict how information or contagions spread by natural human mobility -- for understanding the spreading of deadly infectious diseases and for improving delay tolerant communication schemes. Formally, we model this problem by considering $M$ moving agents, where each agent initially carries a \emph{distinct} bit of information. When two agents are at the same location or in close proximity to one another, they share all their information with each other. We would like to know the time it takes until all bits of information reach all agents, called the \textit{flood time}, and how it depends on the way agents move, the size and shape of the network and the number of agents moving in the network. We provide rigorous analysis for the \MRWP model (which takes paths with minimum number of turns), a convenient model used previously to analyze mobile agents, and find that with high probability the flood time is bounded by $O\big(N\log M\lceil(N/M) \log(NM)\rceil\big)$, where $M$ agents move on an $N\times N$ grid. In addition to extensive simulations, we use a data set of taxi trajectories to show that our method can successfully predict flood times in both experimental settings and the real world.Comment: 10 pages, ACM SIGSPATIAL 2018, Seattle, U