• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.507-513
• /
• 2007

In this paper, we propose an efficient authentication protocol based on certificateless signature scheme, which does not need anyinfrastructure to deal with certification of public keys, among the vehicles in Vehicular Ad-hoc Networks. Moreover, due to the characteristicsof VANET nodes (i.e., vehicles) that is fast and movement, the proposed protocol introduces the concept of interval signing key to overcome efficiently the problem of certificate revocation in traditional Public Key Infrastructure(PKI).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.882-888
• /
• 2010

Vehicular Ad-Hoc Networks (VANETs) using inter-vehicle communication can potentially enhance traffic safety and facilitate many vehicular applications. Therefore, this paper proposes an inter-vehicle routing protocol called Junction-Assisted Routing (JAR) that uses fixed junction nodes to create the routing paths for VANETs in city environments. JAR is a proactive routing protocol that uses the Expected Transmission Count (ETC) for the road segment between two neighbor junctions as the routing paths between junction nodes. Simulation results showed that the proposed JAR protocol could outperform existing routing protocols in terms of the packet delivery ratio and average packet delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1223-1236
• /
• 2014

With the extension of wireless technology, vehicular ad hoc networks provide important services for the dissemination of general data and emergency warnings. However, since, the vehicle topology frequently changes from a dense to a sparse network depending on the speed of the moving vehicles and the time of day, vehicular ad hoc networks require a protocol that can facilitate the efficient and reliable dissemination of emergency messages in a highly mobile environment under dense or intermittent vehicular connectivity. Therefore, this paper proposes a new vehicular broadcast protocol, called BL-CAST, that can operate effectively in both dense and sparse network scenarios. As a low overhead multi-hop broadcast protocol, BL-CAST does not rely on the periodic exchange of beacons for updating location information. Instead, the location information of a vehicle is included in a broadcast message to identify the last rebroadcasting vehicle in an intermittently connected network. Simulation results show that BL-CAST outperforms the DV-CAST protocol in terms of the end-to-end delay, message delivery ratio and network overhead.

• Convergence Security Journal
• /
• v.11 no.6
• /
• pp.37-44
• /
• 2011

VANET(Vehicular Ad-hoc Network) is a kind of ad hoc networks consist of intelligence vehicular ad nodes, and has become a hot emerging research project in many field. It provide traffic safety, cooperative driving and etc. but has also some security problems that can be occurred in general ad hoc networks. Also, in VANET, vehicles shoul d be able to authenticate each other to securely communicate with network-based infrastructure, and their locations and identifiers should not be exposed from the communication messages. This paper proposes V2I(Vehicular to Infra structure) authentication protocol that anonymity and untraceability of vehicular using Error Correcting Code that ge nerate encoding certification using generation matrix. The proposed scheme based on ECC resolves overhead problems of vehicular secure key management of KDC.

• Journal of Advanced Navigation Technology
• /
• v.12 no.6
• /
• pp.627-633
• /
• 2008

In the case of traffic accidents, the broadcasting methods used in the mobile ad hoc network (MANET) cannot applied to transmit reliable message since moving high-speed in vehicular ad hoc networks (VANET) environments. In this paper, in order to guarantee transmitting reliable messages, we propose a collision avoidance method based-on directional antenna in VANET. In order to reduce interference from omni-broadcasting and to avoid hidden node problem from moving high-speed, we employed a forward-handed and backward directional antenna. The authors simulated the proposed method based on directional antenna and showed that the proposed method has been improved in respect to network utilization compared to existing VANET protocols.

• The Journal of the Korea Contents Association
• /
• v.11 no.6
• /
• pp.26-32
• /
• 2011

Recently, in the U-health area, there are research related on monitoring brainwaves in real-time for coping with emergent situations like the fatigue driving, cerebral infarction or the heart attack of not only the patients but also the normal elderly folks by transmitting of the EEG(Electroencephalograph). This system could be applied to hospitals or sanatoriums. In this paper, it is applied for the vehicular ad-hoc network to prevent the car accident in advance by monitoring the brainwaves of a driver in real-time. In order to do this, I used mobile ad-hoc nodes supported in the Opnet simulator for the efficient EEG brainwave transmission in the VANET environment. The vehicular ad-hoc networks transmitting the brainwaves to the nearest road-side unit are designed and simulated to draw an efficient and proper vehicular ad-hoc network environment.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.190-192
• /
• 2012

Vehicular Ad hoc Networks (VANETs) is the new wireless networking concept of mobile ad hoc networks in research community. Routing in vehicular is a major challenge and research area. The majority of current routing algorithms for VANETs utilize indirect metrics to select the next hop and produce optimal node path. In this paper, we propose a distance and angle based routing algorithm for VANETs, which combines a distance approach with an angle based geographical strategy for selecting the next hop, with the purpose of using direct metrics to build a optimal node route. The proposed algorithm has better performance than the previous scheme.

• Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.28-40
• /
• 2008

Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1075-1082
• /
• 2008

A greedy forwarding algorithm is one of the most suitable solutions for routing in vehicular ad-hoc networks. Compared to conventional routing protocols for mobile ad-hoc networks, greedy forwarding based routing protocols maintain only local information of neighbors instead of per-destination routing entries, and thus they show better performance in highly-mobile vehicular ad-hoc networks. With greedy forwarding, each node learns its geographical position and periodically broadcasts a beacon message including its position information. Based on the position information, each node selects a neighbor node located closest to the destination node as the next forwarder. One of the most serious problems in greedy forwarding is the lost link problem due to the mobility of nodes. In this paper, we propose a new algorithm to reduce the lost link problem. The proposed algorithm aims to find an efficient and stable routing path by taking account of the position of neighbors and the last beacon reception time. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

• 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.