An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks

Sun, Jianhua; Zhang, Chi; Zhang, Yanchao; Fang, Yuguang

doi:10.1109/tpds.2010.14

Cited by 305 publications

(26 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [23][24] describes another security association process among the nodes which uses asymmetric cryptography where any node in the network can issue certificate for new nodes. This is a strong approach in sense of that it does not have any single point failure in the network.…”

Section: Key Acquisitionmentioning

confidence: 99%

A Key Exchange Approach for Proficient and Secure Routing in Mobile Adhoc Networks

Raju¹,

Reddy

2017

Int. J. Interact. Mob. Technol.

View full text Add to dashboard Cite

Abstract-Mobile ad hoc networks (MANETs) are a collection of wireless mobile devices with restricted broadcast range and resources. Communication is achieved by relaying data along appropriate routes that are dynamically discovered and maintained through collaboration between the nodes. Discovery of such routes is a major task, both from efficiency and security point of view. This paper presents a proficient and secure routing, based on asymmetric authentication using key exchange approach (KEA). The proposed mechanism ensures secure routing and quality of service in MANETs and minimizes the network overhead. The KEA mechanism can be effectively used to develop a new routing protocol for Mobile Adhoc Networks which will provide maximum security against all kinds of attacks. In this paper, KEA is compared with other secure routing protocols like EEACK, AODV, and ARIADANE, to evaluate the efficiency of KEA in Ad Hoc Networks. The empirical results show that there is an increase of 20% packet delivery ratio and a reduction of 10% routing overhead.

show abstract

Section: Key Acquisitionmentioning

confidence: 99%

A Key Exchange Approach for Proficient and Secure Routing in Mobile Adhoc Networks

Raju¹,

Reddy

2017

Int. J. Interact. Mob. Technol.

View full text Add to dashboard Cite

show abstract

“…Ad Hoc On Demand Distance Vector (AODV) [14] is an reactive routing protocol which capable of both unicast and multicast. In AODV, like all reactive protocols, topology information is only transmitted by nodes on-demand.…”

Section: Reactive Routingmentioning

confidence: 99%

“…Sun et al [14] they propose a security system for VANETs to achieve privacy desired by vehicles and traceability required by law enforcement authorities, in addition to satisfying fundamental security requirements including authentication, non repudiation, message integrity, and confidentiality. Moreover, they propose a privacypreserving defense technique for network authorities to handle misbehavior in VANET access, considering the challenge that privacy provides avenue for misbehavior.…”

Section: Related Workmentioning

confidence: 99%

A Novel Region Based Multipath Routing Algorithm for Vehicular Ad-hoc Networks

2017

IJARCSSE

View full text Add to dashboard Cite

Multimedia communication is a desirable medium to provide traffic information, news, advertisements, etc. to people on-the-road. Due to the high mobility and dynamic topology of Vehicular Ad-hoc Network (VANET) an open question is whether it is feasible to support video streaming services using license-free wireless communications between vehicles and road-side-units. In VANET, safety application and user Internet accessing related application are expected to be supported. VANET is an enhanced form of Mobile Ad-hoc Network (MANET), where communicating nodes are replaced by moving vehicles. VANETs promise many improvements in terms of accident avoidance and in better utilization of roads and resources such as fuel and time. In this paper, propose Region based Multipath using clustering routing algorithm (RMCRA) for inter cluster communications that is clustering-based scheme is applied for data transmission in VANET in which a cluster head (CH) selection and static cluster server taking density of road-network and traffic as the parameter. In this paper RMCRA proposed technique compare with existing technique Locations based Multipath Flooding (LMF) using four parameters i.e traffic sent and received, throughput, packet delay variation and packet dropped. Nodes of vehicular ad hoc network do not pose power challenges as posed by nodes of mobile ad hoc network. Hence, new clustering algorithms are developed for vehicular ad hoc network which aim for stable and effective clusters in the network.Keywords-VANET, RMCRA, LMF, Clustering, throughput, packet delay variation and packet dropped. I. INTRODUCTIONMany people lose their life and/or are injured due to accidents or unexpected events taking place on road networks. Besides traffic jams, these accidents generate a tremendous waste of time and fuel. Undoubtedly, if the vehicles are provided with timely and dynamic information related to road traffic conditions, any unexpected events or accidents, the safety and efficiency of the transportation system with respect to time, distance, fuel consumption and environmentally destructive emissions can be improved. VANETs are self-organizing networks established among vehicles equipped with communication facilities. The equipped vehicles are network nodes so that each node can act as the source of data, destination for data and a network router [1]. Vehicular Ad Hoc Networks have recently emerged as an effective tool for improving road safety through propagation of warning messages among the vehicles in the network about potential obstacles on the road ahead. VANETs and MANETs have some similar characteristics such as short range of transmission low bandwidth, omnidirectional broadcast and low storage capacity. Fast changing network topology and varying communication conditions pose a great challenge for routing protocols being used in VANETs. For using routing protocols in VANET they should be robust, reliable, minimize latency and network load. For achieving more realistic results, we developed mobility models th...

show abstract

“…It was recently argued that even if several pseudonyms are used, detecting the true identity of the driver, and the attendant loss of privacy, appears hard to prevent [27,28,29,30].…”

Section: Several Recent Us Department Of Transportation (Us-dot) and mentioning

confidence: 99%

“…One can interpret (29) cars, then the probability that there is no end-to-end connectivity between them is precisely (29). For example, if there were 12 co-directional cars in the window, the probability of no end-to-end connectivity between them would be about 86%.…”

Section: Theorem 435mentioning

confidence: 99%

Friend: A cyber-physical system for traffic flow related information aggregation and dissemination

El-Tawab

Olariu

Almalag

2012

2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)

View full text Add to dashboard Cite

A cyber-physical system for traffic Flow-Related Information aggrEgatioN and Dissemination. By integrating resources and capabilities at the nexus between the cyber and physical worlds, FRIEND will contribute to aggregating traffic flow data collected by the huge fleet of vehicles on our roads into a comprehensive, near real-time synopsis of traffic flow conditions. We anticipate providing drivers with a meaningful, color-coded, at-a-glance view of flow conditions ahead, alerting them to congested traffic.FRIEND can be used to provide accurate information about traffic flow and can be used to propagate this information. The workhorse of FRIEND is the ubiquitous lane delimiters (a.k.a. cat's eyes) on our roadways that, at the moment, are used simply as dumb reflectors.Our main vision is that by endowing cat's eyes with a modest power source, detection and communication capabilities they will play an important role in collecting, aggregating and disseminating traffic flow conditions to the driving public. We envision the cat's eyes system to be supplemented by road-side units (RSU) deployed at regular intervals (e.g. every kilometer or so). The RSUs placed on opposite sides of the roadway constitute a logical unit and are connected by optical fiber under the median. Unlike inductive loop detectors, adjacent RSUs along the roadway are not connected with each other, thus avoiding the huge cost of optical fiber. Each RSU contains a GPS device (for time synchronization), an active Radio Frequency Identification (RFID) tag for communication with passing cars, a radio transceiver for RSU to RSU communication and a laptop-class computing device.The physical components of FRIEND collect traffic flow-related data from passing vehicles. The collected data is used by FRIEND's inference engine to build beliefs about the state of the traffic, to detect traffic trends, and to disseminate relevant traffic flow-related information along the roadway. The second contribution of this thesis is the development of an incident classification and detection algorithm that can be used to classify different types of traffic incident. Then, it can notify the necessary target of the incident. We also compare our incident detection technique with other VANET techniques.Our third contribution is a novel strategy for information dissemination on highways. First, we aim to prevent secondary accidents. Second, we notify drivers far away from the accident of an expected delay that gives them the option to continue or exit before reaching the incident location. A new mechanism tracks the source of the incident while notifying drivers away from the accident. The more time the incident stays, the further the information needs to be propagated. Furthermore, the denser the traffic, the faster it will backup. In high density highways, an incident may form a backup of vehicles faster than low density highways. In order to satisfy this point, we need to propagate information as a function of density and time.iv

show abstract

An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks

Cited by 305 publications

References 36 publications

A Key Exchange Approach for Proficient and Secure Routing in Mobile Adhoc Networks

A Key Exchange Approach for Proficient and Secure Routing in Mobile Adhoc Networks

A Novel Region Based Multipath Routing Algorithm for Vehicular Ad-hoc Networks

Friend: A cyber-physical system for traffic flow related information aggregation and dissemination

Contact Info

Product

Resources

About