Ring Selection for Ring Signature-Based Privacy Protection in VANETs

Fog computing for vehicular Ad-hoc networks: paradigms, scenarios, and issues

Past few decades have witnessed large increase in number of vehicles on roads due to which the traffic safety needs have also become complex and hence necessary to be taken care of. Vehicular ad hoc networks (VANETs) are becoming an asset for achieving all these goals. VANETs provide applications like driver assistance, passenger comfort and vehicle safety. Apart from its general characteristics due to the dynamic nature of road environments and traffic patterns, communication linkage among vehicles in VANETs suffers breakage problem hence requires a very reliable routing protocol. To manage the communication efficiently many routing protocols are already available for MANETs which can be further used for routing and communication among vehicles in VANETs, but characteristics of these two networks (VANET and MANET) are very different, so there is requirement to enhance these MANET routing protocols so that those can be used in VANETs. When we use some existing routing protocols in VANET then number of link breakage are surprisingly high because mobility is higher in VANETs as compared to MANETs. So this paper presents advanced version of an existing MANET routing protocol for better performance in VANET environment. The new routing protocol has removed problem of large number of routing error messages which was existing in AODV routing protocol. Protocol proposed in this paper has better results as compared to AODV and paper has also shown results of simulation and also elaborated the findings.

OF DISSERTATION Secure and Authenticated Message Dissemination in Vehicular ad hoc Networks and an Incentive-based Architecture for Vehicular Cloud Vehicular ad hoc Networks (VANETs) allow vehicles to form a self-organized network. VANETs are likely to be widely deployed in the future, given the interest shown by industry in self-driving cars and satisfying their customers various interests. Problems related to Mobile ad hoc Networks (MANETs) such as routing, security, etc. have been extensively studied. Even though VANETs are special type of MANETs, solutions proposed for MANETs cannot be directly applied to VANETs because all problems related to MANETs have been studied for small networks. Moreover, in MANETs, nodes can move randomly. On the other hand, movement of nodes in VANETs are constrained to roads and the number of nodes in VANETs is large and covers typically large area. The following are the contributions of the thesis. Secure, authenticated, privacy preserving message dissemination in VANETs: When vehicles in VANET observe phenomena such as accidents, icy road condition, etc., they need to disseminate this information to vehicles in appropriate areas so the drivers of those vehicles can take appropriate action. When such messages are disseminated, the authenticity of the vehicles disseminating such messages should be verified while at the same time the anonymity of the vehicles should be preserved. Moreover, to punish the vehicles spreading malicious messages, authorities should be able to trace such messages to their senders when necessary. For this, we present an efficient protocol for the dissemination of authenticated messages. Incentive-based architecture for vehicular cloud: Due to the advantages such as flexibility and availability, interest in cloud computing has gained lot of attention in recent years. Allowing vehicles in VANETs to store the collected information in the cloud would facilitate other vehicles to retrieve this information when they need. In this thesis, we present a secure incentive-based architecture for vehicular cloud. Our architecture allows vehicles to collect and store information in the cloud; it also provides a mechanism for rewarding vehicles that contributing to the cloud. Privacy preserving message dissemination in VANETs: Sometimes, it is sufficient to ensure the anonymity of the vehicles disseminating messages in VANETs. We present a privacy preserving message dissemination protocol for VANETs.

In modern days, vehicular ad hoc network (VANET) was one of the rapidly escalating research areas. There were previously numerous ideas expected in this area, but the driving force in VANET was not completed yet. The various routing protocols and clustering algorithms used in VANET were not effectively concentrated on contamination drop in the environment. The day-to-day life demands additional vehicles with protection, but the greater part of us had not been accepted the reality to utilize additional vehicles with less contamination. In this paper, the ReGrouping (RG) technique is proposed, which condensed the fuel utilization of assorted vehicles in VANET. The CO2 emissions and traffic level in the scrupulous direction were reduced. VANET representation was urbanized using finite automata (FA). With the assistance of the FA model, the VANET is constructed. The proportional result between with RG technique and without RG technique was shown.KeywordsFinite automata RG technique Comparative result

Information dissemination in vehicular ad hoc networks (VANETs) is inseparable from the interaction between vehicles and infrastructure. The trust authority (TA) often plays a pivotal role in VANETs and requires interaction with multiple vehicles. However, when the TA sends the same message to multiple vehicles, there are many redundancies, as it needs to negotiate with each vehicle and send them different ciphertexts. This greatly reduces the work efficiency of the TA. To the best of our knowledge, there is no research on the problem of redundancy that occurs when the same message is sent to multiple vehicles in VANETs. The proposed scheme adopts identity-based broadcast encryption (IBBE) technology, which is a secure data-sharing scheme suitable for the vehicle-to-infrastructure communication mode, in VANETs for the first time. Thus, with only one encryption, the TA can generate a fixed-length ciphertext for a group of vehicles. When there are new vehicles that subsequently request a service, the TA can assign encryption tasks to the proxy server. In terms of security, our scheme meets the particular requirements of VANETs. The encryption overhead of the sender and the length of the ciphertext were comparatively analyzed. The results demonstrated that the performance of the scheme improved significantly. Thus, our scheme can prevent redundancies and effectively improve the work efficiency of TA.

Clustering in vehicular ad hoc networks: Taxonomy, challenges and solutions

Vehicular Ad hoc Network (VANET) are the promising approach to provide safety and other beneficial applications to the drivers as well as passengers. It is recognized as an essential component of intelligent transport system. In this paper, we have discussed about some security attacks in vehicular Ad hoc Network. We have also discussed about some solutions that can be implemented against these attacks. Life saving characteristics of VANET has attracted the industry and researchers. In VANET vehicles are nodes so they have no fixed infrastructure. It serves safe and non safe application in wireless medium which makes it venerable to several attacks. Keywords: VANET characteristics, Overview of attacks, Solutions.

In Vehicular (Ad-hoc) Network (VANET), besides Vehicle-to-Vehicle communications (V2V), vehicles in VANET also exchange data with Road-Side-Units (RSUs) and Cellular Base Stations (Vehicle-to-Infrastructure communications (V2I)). With the introduction of Intelligent Transport Systems (ITS), VANETs possess a great potential in enabling surveillance services. The rapid development of wireless communication technologies recently results in empowering data exchange among vehicles, RSUs and Cellular Base Stations, improving various types of applications and services such as safety driving, route planning, traffic alert, and context-aware infotainment. However, the benefits offered by VANETs and ITS cannot be fully realized unless there is a mechanism to effectively defend against fake and erroneous information exchange from malicious or dysfunctional nodes to other vehicles and RSUs for their own purposes. In this regards, trust appears as one of the solutions for VANETs to establish secure connectivity and reliable services. The conceptual idea to tackle down this challenges is that only data from trusted vehicles is taken into account. Thus, the aim is to evaluate trust of a vehicle in exchanging high quality of information. This paper presents the trust concept, key characteristics, a trust evaluation model, and a prototype for trusted data exchange activities in VANETs.

A Vehicular Ad hoc NETwork (VANET) is a type of mobile Peer-To-Peer wireless network that allows providing communication among nearby vehicles and between vehicles and nearby fixed roadside equipment. The lack of centralized infrastructure, high node mobility and increasing number of vehicles in VANETs result in several problems discussed in this paper, such as interrupting connections, difficult routing, security of communications and scalability. Existing system for VANET communication is proved to have several drawbacks. We have proposed a mechanism in order to provide secure and efficient communication in VANET environment. We overcome the drawbacks of the existing system by using Malicious Vehicular Analyzer algorithm and Elliptic Curve Cryptography (ECC). Using these algorithms, malicious messages are identified. It also detects the accident and other problems in the path of the vehicles. Elliptic Curve Cryptography (ECC) algorithm is used for stronger security during communication.

The primary objective of a Medium Access Control (MAC) layer in Vehicular Ad hoc Networks (VANETs) is reliable and rapid broadcast of safety messages. Fast mobility of vehicles, hidden terminal problem, reliability, and congestion control of broadcast channel are challenging issues in VANETs. This paper proposes an R-ALOHA-based channel access mechanism that renders a broadcast channel capable of broadcast failure detection while at the same time maintaining congestion control. The proposal employs a combination of CSMA and TDMA techniques to mitigate the hidden terminal problem and combat fast mobility of vehicles in VANETs. Performance comparison of preexisting TDMA protocols and the proposed protocol - both analytical and in simulation - is also provided. Simulation results validate analytical models and demonstrate significantly improved reliability and increased channel assignment speed to manage the fast mobility of vehicles.

Vehicular Ad hoc Networks (VANETs) that are considered as a subset of Mobile Ad hoc Networks (MANETs) can be applied in the field of transportation especially in Intelligent Transportation Systems (ITS). The routing process in these networks is a challenging task due to rapid topology changes, high vehicle mobility and frequent disconnection of links. Therefore, developing an efficient routing protocol that satisfies restriction of delay and minimum overhead is faced with many difficulties and limitations. Also, the detection of malicious vehicles is a significant task in VANETs. To address these issues, using Unmanned Aerial Vehicles (UAVs) can be helpful to cope with these limitations. In this paper, operation of UAVs in ad hoc mode and their cooperation with vehicles in VANETs are studied to help in the process of routing and detection of malicious vehicles. A routing protocol named VRU is proposed that includes two distinct ways of routing of data: (1) delivering packets of data between vehicles with the help of UAVs using a protocol named VRU_vu, and (2) routing packet of data between UAVs using a protocol named VRU_u. The NS-2.35 simulator under Linux Ubuntu 12.04 is utilized in order to appraise the performance of VRU routing components in an urban scenario. Also, VanetMobiSim generator of mobility and MobiSim are used to produce the motions of vehicles and to produce the motions of UAVs, respectively. The performance analysis displays that VRU protocol can improve the packet delivery ratio by 16% and detection ratio by 7% compared to other reviewed routing protocol. Also, VRU protocol decreases end-to-end delay by an average of 13% and overhead by 40%.

Vehicular ad-hoc networks (VANET) are a mobile adhoc networking technology to facilitate vehicle-to-vehicle and vehicle-to-roadside communication. A vehicle in VANET is considered to be an intelligent mobile node capable of communicating with its neighbors and other vehicles in the network. As in a mobile ad-hoc network (MANET) it is necessary to identify or address each vehicle in the vehicular ad-hoc network with a unique address. The current addressing mechanisms in VANET do not succeed in configuring the vehicle with a unique address. Furthermore, there is a need for address reconfigurations depending on the mobility patterns. In order to deal with these problems, we have presented a centralized addressing scheme for VANET using DHCP (Dynamic Host Configuration Protocol). Results obtained in our approach are compared against the results presented in one of the existing addressing mechanism in VANET. It is observed that our approach is efficient and feasible for vehicular ad-hoc networks.

Highly dynamic geographical topology, two-direction mobility, and varying traffic density can lead to fairness issues in Vehicular Ad-hoc Networks (VANETs). The Medium Access Control (MAC) protocol plays a vital role in sharing the common wireless channel efficiently between vehicles in a VANET system. However, ensuring fairness between vehicles can be a challenge in designing MAC protocols for VANET systems. The existing protocol, IEEE 802.11 DCF, ensures that the packet transmission rate for a particular vehicle is directly proportional to the amount of time a vehicle spends within a service area, but it does not guarantee that faster vehicles will be able to send the minimum number of packets. Other existing MAC protocols based on IEEE 802.11 are able to provide a minimum amount of data transmission regardless of velocity, but are unable to provide an amount of data transmission that is more proportionate to the time a vehicle spends in the service area. To address the above limitations, we propose a Speed Aware Fairness Enabled MAC (SAFE-MAC) protocol that calculates the residence time of a vehicle in a service area by using mobility metrics such as position, direction, and speed to synthesize the transmission probability of each individual vehicle with respect to its residence time. This is achieved by dynamically altering the values of parameters such as minimum contention window, maximum backoff stage, and retransmission limit in the MAC protocol. We then develop an analytical model to compare the performance of our proposed protocol with contemporary MAC protocols. Numerical analysis results show that our proposed protocol significantly improves fairness among the speed-varying vehicles in VANET.

A survey on authentication schemes in VANETs for secured communication

For the problems of non-extensibility of preset access control policy in vehicular ad-hoc networks, considering the high mobility of its topology, this paper proposes an attribute-based and fine-grained access control scheme to protect vehicular resources from invalid access of the malicious node. Firstly, according to the dynamic mobility properties of the vehicles and the road condition, we make a dynamically generated access policy to form the access constraints of the access requestors. Secondly, we propose a trust evaluation method based on the existing scheme. The method defines several trust attributes to calculate the requestor's trust value synthetically. Then the resource provider decides whether to grant the permission or not according to the threshold value. Finally, a dynamic access control scheme for the anonymous vehicles in vehicular ad-hoc networks is established. Results show that our scheme preserves several security requirements, meanwhile, the time computation of policy generation show that our scheme will be applicable for vehicular ad-hoc networks.