Search

The rapid advancements in computer systems and wireless sensor networks (WSNs) motivate many intelligent transportation systems (ITSs) applications in smart cities, such as vehicular ad hoc networks (VANETs). The WSN supports data exchange between mobile vehicles and servers to provide effective traffic control and smooth service for VANET users. However, the vehicle environment still faces many challenges. One of the VANET concerns is the privacy and security of data flows from heterogeneous systems. Therefore, we suggest a Provably Online/Offline Signcryption (POOSC) protocol for vehicular communication in VANET to preserve data confidentiality and ciphertext unforgeability. In this architecture, the transmitter registered in the Identity-Based Cryptosystems (IBC) environment can safely and efficiently communicate with the receiver in the Public-Key Infrastructure (PKI) environment despite the limitations and challenges of heterogeneous systems. In a Random Oracle Model (ROM), we show that our protocol is safe against Indistinguishability-Adaptive Chosen-Ciphertext Attacks (IND-CCA2) under the Computational Diffie–Hellman (CDH) assumption and Existential Unforgeability-Adaptive Chosen Message Attacks (EUF-CMA) under the Discret-Logarithm (DL) assumption. Moreover, the POOSC protocol overcomes the certificate authority burden. Besides, we designed the POOSC protocol with a free pairing that achieves low computation cost and better scalability for VANET environments. The POOSC effectively meets non-repudiation, integrity, and authentication in a logically single step. [ABSTRACT FROM AUTHOR]

As one of the essential components of Intelligent Transport Systems (ITS), Vehicular Ad Hoc Network (VANET) plays a significant role in enabling various on-road applications, most of which primarily rely on two-hop Vehicle-to-Infrastructure communications. To make such communications reliable and secure, it is significant to ensure that only the trustworthy vehicles are selected as relays. To tackle this challenge, this paper proposes a robust trust-based relay selection scheme, called PTRS, which, based on Dirichlet distribution, systematically integrates a set of unique features of VANET, e.g., hybrid architecture, high dynamics, into the traditional reputation system, with an objective to effectively differentiate the trust levels of the vehicles, meanwhile, preserving robustness. Besides, the location privacy of vehicles are preserved in our proposed scheme by using the technique of pseudonyms and trust levels instead of explicit reputation scores. Detailed security analysis is conducted, which shows that the proposed PTRS scheme is secure and robust against several sophisticated attacks in VANETs. In addition, a set of extensive simulations are carried out, demonstrating its effectiveness and accuracy. [ABSTRACT FROM AUTHOR]

Today's high-end vehicles are technologically more sophisticated and smarter than the 'old machines with engine and wheels'. These vehicles are anticipated to provide consumers with safe, reliable, and infotainment-rich driving experience through intelligent transportation system, realized through a technology referred to as vehicular ad hoc network (VANET). VANET offers a plethora of applications to the consumers ranging from safety to infotainment. Among other messages defined by the dedicated short range communication standard, cooperative awareness messages (CAMs) are of paramount importance for the VANET applications. In VANET, vehicles share their frequent mobility information in the form of CAMs with neighbors for cooperative awareness, traffic view construction, maneuver, and cruise control. In this work we target the CAM-based traffic information dissemination. VANET applications construct short-range local and long-range extend traffic views with the information contained in scheduled CAMs (also known as beacons). To construct aforementioned traffic views, naïve approach is multi-hop communication; however, historically multi-hop communication does not scale efficiently in dynamic VANET due to computational and communication overhead. Therefore another alternative approach is essential to address the problems of the multi-hop communication in highly ephemeral VANET and to achieve maximum degree of the information dissemination in VANET. To fill the gap, in this paper we propose a geocast-based abstract piggybacking mechanism for traffic information dissemination in VANET through single-hop CAMs. In the proposed scheme, vehicles compress their local traffic view constructed through single-hop CAMs. The compressed local traffic view is referred to as traffic data unit (TDU). Every vehicle broadcasts its own TDU along with a number of TDUs received from other vehicles in the next scheduled CAM, in order to construct a long-range extended traffic view, also known as compressed data word (CDW). In other words, CDW is encapsulated into normal CAM in order to share it with the neighbors in the vicinity. The receivers of CDW use the received TDUs to construct the desired length of the long-range extended traffic view. The proposed scheme leverages only single-hop beacons data to construct both local and extended traffic views. Our simulation results show that the extended traffic view up to 1 km can be constructed with only single-hop beacons at the expense of 10 % of extra information with the regular CAM. The results also show that the effect of the extra overhead is not phenomenal from overhead standpoint. The proposed virtual multi-hop communication paradigm with single-hop CAM will reduce the overall communication thereby saving the bandwidth for other important safety related communications. [ABSTRACT FROM AUTHOR]

In vehicular ad hoc networks, road traffic information can be used to support efficient routing. However, dissemination of up-to-date global road traffic information usually consumes considerable network resources and may also lead to the scalability issue. On the other hand, the highly dynamic nature of road traffic information makes it difficult to collect and disseminate such information in a timely fashion. Outdated information can lead to inefficient routing decisions and thus degraded routing performance. This paper proposes a distributed routing protocol using partial accurate routing information (RPPI). In RPPI, each node uses accurate local traffic information in its local zone and statistical traffic information in remote areas for route selection, which can significantly reduce the communication overhead. Simulation results show that RPPI can achieve better routing performance in terms of end-to-end packet delivery ratio and end-to-end packet delivery delay as compared with existing work. [ABSTRACT FROM AUTHOR]