• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3257-3274
• /
• 2012

Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet delivery rate by two mechanisms based on the forwarding features of ODAM. The first distance-based mechanism reduces the possibility of packet loss by considering the angles between source nodes, forwarding nodes and receiving nodes. The second mechanism increases the redundancy of forwarding nodes to guarantee the packet success delivery ratio. We show by analysis and simulations that the proposed algorithm can improve packet delivery rate for vehicular networks compared against two widely-used existing protocols.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.77-83
• /
• 2010

Vehicular Ad Hoc Networks are self-organizing Peer-to-Peer networks that typically have highly mobile vehicle nodes, moving at high speeds, very short-lasting and unstable communication links. VANETs are formed without fixed infrastructure, central administration, and dedicated routing equipment, and network nodes are mobile, joining and leaving the network over time. So, VANET-security is very vulnerable for the intrusion of malicious and misbehaving nodes in the network, since VANETs are mostly open networks, allowing everyone connect, without centralized control. In this paper, we propose a rough set based anomaly detection method that efficiently identify malicious behavior of vehicle node activities in these VANETs, and the performance of a proposed scheme is evaluated by a simulation in terms of anomaly detection rate and false alarm rate for the threshold ${\epsilon}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1533-1556
• /
• 2017

The concept of trust in vehicular ad hoc networks (VANETs) is usually utilized to assess the trustworthiness of the received data as well as that of the sending entities. The quality of safety applications in VANETs largely depends on the trustworthiness of exchanged data. In this paper, we propose a self-organized distributed trust computing framework (DTCF) for VANETs to compute the trustworthiness of each vehicle, in order to filter out malicious nodes and recognize fully trusted nodes. The proposed framework is solely based on the investigation of the direct experience among vehicles without using any recommendation system. A tier-based dissemination technique for data messages is used to filter out non authentic messages and corresponding events before even going farther away from the source of the event. Extensive simulations are conducted using Omnet++/Sumo in order to investigate the efficiency of our framework and the consistency of the computed trust metrics in both urban and highway environments. Despite the high dynamics in such networks, our proposed DTCF is capable of detecting more than 85% of fully trusted vehicles, and filtering out virtually all malicious entities. The resulting average delay to detect malicious vehicles and fraudulent data is showed to be less than 1 second, and the computed trust metrics are shown to be highly consistent throughout the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2044-2062
• /
• 2018

Information theory progression along with the advancements being made in the field of Vehicular Ad hoc NETworks (VANETs) supports the use of coding-aware opportunistic routing for efficient data forwarding. In this work, we propose and investigate an adaptive coding-aware routing scheme in a specific VANET scenario known as a vehicular platoon. Availability of coding opportunities may vary with time and therefore, the accurate identification of available coding opportunities at a specific time is a quite challenging task in the highly dynamic scenario of VANETs. In the proposed approach, while estimating the topology of the network at any time instance, a forwarding vehicle contemplates the composition of multiple unicast data flows to encode the correct data packets that can be decoded successfully at destinations. The results obtained by using OMNeT++ simulator reveal that higher throughput can be achieved with minimum possible packet transmissions through the proposed adaptive coding-aware routing approach. In addition, the proposed adaptive scheme outperforms static transmissions of the encoded packets in terms of coding gain, transmission percentage, and encoded packet transmission. To the best of our knowledge, the use of coding-aware opportunistic routing has not been exploited extensively in available literature with reference to its implications in VANETs.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.175-181
• /
• 2014

With rapid growth of the wireless mobile computing network technologies, various mobile ad hoc network applications converged with other related technologies are rapidly disseminated nowadays. Vehicular Ad Hoc Networks are self-organizing mobile ad hoc networks that typically have moving vehicle nodes with high speeds and maintaining its topology very short with unstable communication links. Therefore, VANETs are very vulnerable for the malicious noise of sensors and anomalies of the nodes in the network system. In this paper, we propose an anomaly detection method by using big data techniques that efficiently identify malicious behaviors or noises of sensors and anomalies of vehicle node activities in these VANETs, and the performance of the proposed scheme is evaluated by a simulation study in terms of anomaly detection rate and false alarm rate for the threshold ${\epsilon}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.748-766
• /
• 2013

In this paper, we consider an infrastructure-vehicle-vehicle (I2V2V) based Vehicle Ad-hoc Networks (VANETs), where one base station multicasts data to d vehicular users with the assistance of r vehicular users. A Distributed Luby Transform (DLT) codes based transmission scheme is proposed over lossy VANETs to reduce transmission latency. Furthermore, focusing on the degree distribution of DLT codes, a Modified Deconvolved Soliton Distribution (MDSD) is designed to further reduce the transmission latency and improve the transmission reliability. We investigate the network behavior of the transmission scheme with MDSD, called MDLT based scheme. Closed-form expressions of the transmission latency of the proposed schemes are derived. Performance simulation results show that DLT based scheme can reduce transmission latency significantly compared with traditional Automatic Repeat Request (ARQ) and Luby Transform (LT) codes based schemes. In contrast to DLT based scheme, the MDLT based scheme can further reduce transmission latency and improve FER performance substantially, when both the source-to-relay and relay-to-sink channels are erasure channels.

• The Journal of the Korea Contents Association
• /
• v.20 no.8
• /
• pp.637-644
• /
• 2020

VANET (Vehicular Ad Hoc Networks) is a network between vehicles and between vehicles and infrastructure. VANET-specific characteristics such as high mobility, movement limitation, and signal interference by obstacles make it difficult to provide stable VANET services. To solve this problem, this paper proposes a vehicle type-based priority clustering method that improves the existing bus-based clustering. The proposed algorithm constructs a cluster by evaluating the priority, link quality, and connectivity based on the vehicle type, expected communication lifetime, and link degree of neighbor nodes. It tries to simplify the process of selecting a cluster head and increase cluster coverage by utilizing a predetermined priority based on the type of vehicle. The proposed algorithm is expected to become the basis for activating various services by contributing to providing stable services in a connected car environment.

• Journal of Korean Society of Transportation
• /
• v.26 no.6
• /
• pp.93-101
• /
• 2008

With a spread of mobile devices, the growing trend of integrating wireless communications technologies into transportation systems is advanced. In particular, vehicular ad hoc networks (VANETs) enable vehicles to share traffic information that they have through intervehicle communications. This research focused on the design of an integrated transportation and communication simulation framework to build an environment that is more realistic than previous studies developed for studying VANETs. Developing a VANET-based information model, this research designed an integrated transportation and communication simulation framework in which these independent simulation tools not supporting High Level Architecture (HLA) were tightly coupled and finely synchronized. As a case study, a VANET-based traffic information system was demonstrated based on a real road network and real traffic data. The experiment results showed that the simulation framework was well integrated. The simulation framework designed in this study is expected to contribute to developing the environment to experiment a wide range of VANET applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6121-6144
• /
• 2019

Numerous privacy-preserving authentication schemes have been proposed but vehicular ad hoc networks (VANETs) still suffer from security and privacy issues as well as computation and communication overheads. In this paper, we proposed a robust conditional privacy-preserving authentication scheme based on pseudonym root with cuckoo filter to meet security and privacy requirements and reduce computation and communication overheads. In our proposed scheme, we used a new idea to generate pseudonyms for vehicles where each on-board unit (OBU) saves one pseudonym, named as "pseudonym root," and generates all pseudonyms from the same pseudonym. Therefore, OBU does not need to enlarge its storage. In addition, the scheme does not use bilinear pairing operation that causes computation overhead and has no certification revocation list that leads to computation and communication overheads. The proposed scheme has lightweight mutual authentication among all parties and just for once. Moreover, it provides strong anonymity to preserve privacy and resists ordinary attacks. We analyzed our proposed scheme and showed that it meets security and privacy requirements of VANETs and is more efficient than traditional schemes. The communication and computation overheads were also discussed to show the cost-effectiveness of the proposed scheme.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.165-171
• /
• 2021

Vehicular Ad hoc Network (VANET) is an extension paradigm of moving vehicles to communicate with wireless transmission devices within a certain geographical limit without any fixed infrastructure. The vehicles have most important participation in this model is usually positioned quite dimly within the certain radio range. Fuzzy based multi-hop broadcast protocol is better than conventional message dissemination techniques in high-mobility VANETs, is proposed in this research work. Generally, in a transmission range the existing number of nodes is obstacle for rebroadcasting that can be improved by reducing number of intermediate forwarding points. The proposed protocol stresses on transmission of emergency message projection by utilization subset of surrounding nodes with consideration of three metrics: inter-vehicle distance, node density and signal strength. The proposed protocol is fuzzy MHB. The method assessment is accomplished in OMNeT++, SUMO and MATLAB environment to prove the efficiency of it.