• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.201-203
• /
• 2009

In the VANET, density is a most important factor for reception rate of packet. So, we have to find solutions to reduce packet collision. There are two approaches. First, packet collision avoid by controlling transmission interval. Second, packet collision avoid by controlling transmission power. In this paper, we propose a simple method to reduce a packet collision by controlling transmission power. It uses the number of neighbors and adaptive controlling method. This method have better performance about packet reception rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.463-468
• /
• 2009

In VANET(Vheicle Ad hoc Network), the researches based on the wireless LAN are conducting and the method based on 802.11a is being adapted in IEEE 802.11p WAVE(Wireless Access in Vehicular Environments). However, wireless LAN which uses a single channel in a competition can cause transmission delays because of a frequent collision and a use of CSMA/CA to avoid competition in VANET requiring a fast access. In this paper, we designed CMMP (Clustering based Multi-channel MAC protocol) adequate to VANET and then confirmed the appropriate channel conditions in a V2V communication on the basis of this protocol. The simulation results showed that a packet collision and a transmission delay by the use of an existing single channel based on the contention decreased more than 60% by CMMP.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.4
• /
• pp.53-62
• /
• 2010

In VANETs (Vehicular Ad hoc NETwork), conditional anonymity must be provided to protect privacy of vehicles while enabling authorities to identify misbehaving vehicles. To this end, previous systems provide a mechanism to revoke the anonymity of individual messages. In VANET, if we can trace the movement path of vehicles, it can be useful in determining the liability of vehicles in car accidents and crime investigations. Although route tracing can be provided using previous message revocation techniques, they violate privacy of other vehicles. In this paper, we provide a route tracing technique that protects privacy of vehicles that are not targeted. The proposed method can be employed independently of the authentication mechanism used and includes a mechanism to prevent authorities from abusing this new function.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.4
• /
• pp.23-30
• /
• 2022

Recently, traffic congestion and environmental pollution have occurred due to population concentration and vehicle increase in large cities. Various studies are being conducted to solve these problems. Most of the traffic congestion in cities is caused by traffic signals at intersections. This paper proposes a dynamic traffic light control (DTLC) scheme to support safe vehicle operation and smooth traffic flow using real-time traffic information based on VANET. DTLC receives instantaneous speed and directional information of each vehicle through road side units (RSUs) to obtain the density and average speed of vehicles for each direction. RSUs deliver this information to traffic light controllers (TLCs), which utilize it to dynamically control traffic lights at intersections. To demonstrate the validity of DTLC, simulations were performed on average driving speed and average waiting time using the ns-2 simulator. Simulation results show that DTLC can provide smooth traffic flow by increasing average driving speed at dense intersections and reducing average waiting time.

• Journal of Korean Society of Transportation
• /
• v.28 no.4
• /
• pp.107-118
• /
• 2010

Wireless communication technologies including vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) enable the development of more sophisticated and effective traffic information systems. This study presents a method to estimate vehicular travel times in a vehicular ad hoc network (VANET) environment. A novel feature of the proposed method is estimating individual vehicle travel times through advanced on-board units in each vehicle, referred to as self-estimated travel time in this study. The method uses travel information including vehicle position and speed at each given time step transmitted through the V2V and V2I communications. Vehicle trajectory data obtained from the VISSIM simulator is used for evaluating the accuracy of estimated travel times. Relevant technical issues for successful field implementation are also discussed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.6
• /
• pp.1147-1157
• /
• 2014

Intelligent transportation system (ITS) is realized through a highly ephemeral network, i.e. vehicular ad hoc network (VANET) which is on its way towards the deployment stage, thanks to the advancements in the automobile and communication technologies. However, it has not been successful, at least to date, to install the technology in the mass of vehicles due to security and privacy challenges. Besides, the users of such technology do not want to put their privacy at stake as a result of communication with peer vehicles or with the infrastructure. Therefore serious privacy measures should be taken before bringing this technology to the roads. To date, privacy issues in ephemeral networks in general and in VANET in particular, have been dealt with through various approaches. So far, multiple pseudonymous approach is the most prominent approach. However, recently it has been found out that even multiple pseudonyms cannot protect the privacy of the user and profilation is still possible even if different pseudonym is used with every message. Therefore, another privacy-aware mechanism is essential in vehicular networks. In this paper, we propose a novel identity exchange mechanism to preserve conditional privacy of the users in VANET. Users exchange their pseudonyms with neighbors and then use neighbors' pseudonyms in their own messages. To this end, our proposed scheme conditionally preserves the privacy where the senders of the message can be revoked by the authorities in case of any dispute.

• International Journal of Computer Science & Network Security
• /
• v.23 no.3
• /
• pp.169-176
• /
• 2023

The vehicular ad hoc network (VANET) is currently an important approach to improve personal safety and driving comfort. ANEL is a MAC-based authentication scheme that offers all the advantages of MAC-based authentication schemes and overcomes all their limitations at the same time. In addition, the given scheme, ANEL, can achieve the security objectives such as authentication, privacy preservation, non-repudiation, etc. In addition, our scheme provides effective bio-password login, system key update, bio-password update, and other security services. Additionally, in the proposed scheme, the Trusted Authority (TA) can disclose the source driver and vehicle of each malicious message. The heavy traffic congestion increases the number of messages transmitted, some of which need to be secretly transmitted between vehicles. Therefore, ANEL requires lightweight mechanisms to overcome security challenges. To ensure security in our ANEL scheme we can use cryptographic techniques such as elliptic curve technique, session key technique, shared key technique and message authentication code technique. This article proposes a new efficient and light authentication scheme (ANEL) which consists in the protection of texts transmitted between vehicles in order not to allow a third party to know the context of the information. A detail of the mapping from text passing to elliptic curve cryptography (ECC) to the inverse mapping operation is covered in detail. Finally, an example of application of the proposed steps with an illustration

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.574-588
• /
• 2009

Although much research has been conducted in the area of authentication in wireless networks, vehicular ad-hoc networks (VANETs) pose unique challenges, such as real-time constraints, processing limitations, memory constraints, frequently changing senders, requirements for interoperability with existing standards, extensibility and flexibility for future requirements, etc. No currently proposed technique addresses all of the requirements for message and entity authentication in VANETs. After analyzing the requirements for viable VANET message authentication, we propose a modified version of TESLA, TESLA++, which provides the same computationally efficient broadcast authentication as TESLA with reduced memory requirements. To address the range of needs within VANETs we propose a new hybrid authentication mechanism, VANET authentication using signatures and TESLA++ (VAST), that combines the advantages of ECDSA signatures and TESLA++. Elliptic curve digital signature algorithm (ECDSA) signatures provide fast authentication and non-repudiation, but are computationally expensive. TESLA++ prevents memory and computation-based denial of service attacks. We analyze the security of our mechanism and simulate VAST in realistic highway conditions under varying network and vehicular traffic scenarios. Simulation results show that VAST outperforms either signatures or TESLA on its own. Even under heavy loads VAST is able to authenticate 100% of the received messages within 107ms. VANETs use certificates to achieve entity authentication (i.e., validate senders). To reduce certificate bandwidth usage, we use Hu et al.'s strategy of broadcasting certificates at fixed intervals, independent of the arrival of new entities. We propose a new certificate verification strategy that prevents denial of service attacks while requiring zero additional sender overhead. Our analysis shows that these solutions introduce a small delay, but still allow drivers in a worst case scenario over 3 seconds to respond to a dangerous situation.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.571-582
• /
• 2007

Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.4
• /
• pp.105-114
• /
• 2009

Messages exchanged among vehicles must be authenticated in order to provide collision avoidance and cooperative driving services in VANET. However, digitally signing the messages can violate the privacy of users. Therefore, we require authentication systems that can provide conditional anonymity. Recently, Zhang et al. proposed conditionally anonymous authentication system for VANET using tamper-resistant hardware. In their system, vehicles can generate identity-based public keys by themselves and use them to sign messages. Moreover, they use batch verification to effectively verify signed messages. In this paper, we provide amelioration to Zhang et al.'s system in the following respects. First, we use a more efficient probabilistic signature scheme. Second, unlike Zhang et al., we use a security proven batch verification scheme. We also provide effective solutions for key revocation and anonymity revocation problems.