• Title/Summary/Keyword: Vehicle safety message

Search Result 70, Processing Time 0.028 seconds

Algorithm Design and Implementation for Safe Left Turn at an Intersection Based on Vehicle-to-Vehicle Communications (교차로에서의 안전 좌회전을 위한 차량간 통신 기반 알고리즘 설계 및 구현)

  • Seo, Hyun-Soo;Kim, Hyo-Un;Noh, Dong-Gyu;Lee, Sang-Sun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.2
    • /
    • pp.165-171
    • /
    • 2013
  • WAVE(Wireless Access in Vehicular Environments) is a representative V2V communication protocol and its standards of MAC and PHY parts except for security were published. In order to control traffic flow and ensure driver's safety using V2V communication, various projects are conducting. In particular, safety application has been researched. Therefore, in this paper, we designed the safety application algorithm, which informs a driver of the dangerous status when driver tries to turn left in an intersection and we also implemented the algorithm. Proposed algorithm configures a model for a host vehicle and a vehicle coming in opposite lane and in case that there is collision hazard it provides warning message to driver by using HMI. In order to evaluate the proposed algorithm's performance, we configured the test bed using test vehicles and we tested the algorithm on proving ground with the composed test scenarios. As test results, our system showed excellent performance. If the infrastructures for V2I communications are constructed, we will optimize our system more precisely and stably.

Efficient Message Authentication Scheme for VANET (차량 애드혹 네트워크 환경에서 효율적인 메시지 인증 기법)

  • Yoo, Young-Jun;Lee, Jun-Ho;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.6
    • /
    • pp.37-47
    • /
    • 2009
  • In VANET, each vehicle can obtain traffic information from other vehicles or infrastructure, and they frequently exchange life-critical safety message. Therefore, it is necessary among vehicles to establish a secure channel for keeping the driver's safe and protecting the channel against several attack challenges. TSVC is a representative scheme which needs low communication and computation to be performed. But, there is a delay when verifying the messages because it is designed based on TESLA. Thus, it is not acceptable to use TSVC for sending the time-critical messages. In this paper, we propose a novel message authentication scheme which reduces a delay for the verification of messages. Therefore, the proposed scheme can be suitable to transmitting time-critical messages. Furthermore, the scheme supports to privacy preservation and can robust against DoS attacks.

A PERFORMANCE IMPROVEMENT OF ANEL SCHEME THROUGH MESSAGE MAPPING AND ELLIPTIC CURVE CRYPTOGRAPHY

  • Benyamina Ahmed;Benyamina Zakarya
    • 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

Securing Anonymous Authenticated Announcement Protocol for Group Signature in Internet of Vehicles

  • Amir, Nur Afiqah Suzelan;Malip, Amizah;Othman, Wan Ainun Mior
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.11
    • /
    • pp.4573-4594
    • /
    • 2020
  • Announcement protocol in Internet of Vehicles (IoV) is an intelligent application to enhance public safety, alleviate traffic jams and improve transportation quality. It requires communication between vehicles, roadside units and pedestrian to disseminate safety-related messages. However, as vehicles connected to internet, it makes them accessible globally to a potential adversary. Safety-related application requires a message to be reliable, however it may intrude the privacy of a vehicle. Contrarily, if some misbehaviour emerges, the malicious vehicles must be able to traceable and revoke from the network. This is a contradiction between privacy and accountability since the privacy of a user should be preserved. For a secure communication among intelligent entities, we propose a novel announcement protocol in IoV using group signature. To the best of our knowledge, our work is the first comprehensive construction of an announcement protocol in IoV that deploys group signature. We show that our protocol efficiently solves these conflicting security requirements of message reliability, privacy and accountability using 5G communication channel. The performance analysis and simulation results signify our work achieves performance efficiency in IoV communication.

A Study on Intelligent Railway Level Crossing System for Accident Prevention

  • Cho, Bong-Kwan;Jung, Jae-Il
    • International Journal of Railway
    • /
    • v.3 no.3
    • /
    • pp.106-112
    • /
    • 2010
  • Accidents at level crossing have large portion on train accidents, and causes economical loss by train delay and operational interruption. Various safety equipments are employed to reduce the accident at level crossing, but existing warning device, and crossing barrier are simple train-oriented protection equipments. In this paper, intelligent railway level crossing system is proposed to prevent and reduce accidents. For train driver's prompt action, image of level crossing and obstacle warning message are continuously provided to train driver through wireless communication in level crossing control zone. Obstacle warning messages, which are extracted by computer vision processing of captured image at level crossing, are recognized by train driver through message color, flickering and warning sound. It helps train driver to decide how to take an action. Meanwhile, for vehicle driver's attention, location and speed of approaching train are given to roadside equipments. We identified the effect of proposed system through test installation at Sea train and Airport level crossing of Yeong-dong line.

  • PDF

Multihop Vehicle-to-Infrastructure Routing Based on the Prediction of Valid Vertices for Vehicular Ad Hoc Networks

  • Shrestha, Raj K.;Moh, Sangman;Chung, IlYong;Shin, Heewook
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.5 no.4
    • /
    • pp.243-253
    • /
    • 2010
  • Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

A Interval Distance Calculation and Forward Collision Warning Algorithm for Vehicle Safety Communications on a Highway (고속도로에서 차량 안전 통신을 위한 거리 계산과 전방충돌사고경보 알고리즘)

  • Oh, Sang Yeob
    • Journal of Digital Convergence
    • /
    • v.10 no.10
    • /
    • pp.295-300
    • /
    • 2012
  • Various forward collision warning algorithms have studied in order to protect a car accident. For this, in general, algorithms using an external device such as a camera and sensor generate a forward collision warning. However, if using the external device, it can occur errors due to device characteristics when there is rain or fog. Also, the prevention of a chain-reaction collision is insufficient because the system generates a warning in case of only vehicle having a forward collision danger. If it combines the vehicle safety communications, the method becomes a solution to protect a chain-reaction collision. So, In this paper, we proposes a improved forward collision warning algorithm using the wireless communication technique, driver's information, breaking distance, and velocity. And we compare and analyze our algorithm and previous algorithms.

Distance and Random-based Broadcast Scheme for Vehicle Safety Communication (차량 안전 통신을 위한 거리와 랜덤 기반 브로드캐스트 기법)

  • You, Jong-Duck;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.11
    • /
    • pp.69-76
    • /
    • 2008
  • Safety-related messages are propagated in form of broadcasting among vehicles in vehicle safety communication. There is the broadcast storm problem in high density vehicle environments. To solve this problem, a distance-based broadcast scheme has been proposed. It causes a serious problem such as retransmission delay in low density vehicle environments since it requires additional defer time to rebroadcast messages. This paper proposes a distance and random-based broadcast scheme. The proposed scheme selects a random time from zero to the defer time that estimated depending on the distance between sending and receiving vehicles. Simulation results show that the proposed scheme requires shorter defer time and less rebroadcasting message than existing schemes.

Dynamic Channel Allocation Using SJF Scheduling in IEEE 802.11p/1609 Vehicular Network (IEEE 802.11p/1609 차량 네트워크에서 SJF(Shortest Job First) 스케쥴링을 이용한 동적 채널 할당 기법)

  • Jang, Hyun-Jun;Kwon, Yong-Ho;Rhee, Byung-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.624-627
    • /
    • 2014
  • In vehicular network, the basic goal is to provide vehicle safety service and commercial service such as ITS(Intelligent Transportation System) or video, etc on the road. And most research concentrated on transportation of safety message in congestion situation. It is important to allocate channel for safety message in congestion situation, but providing suitable service is also important problem in vehicular network. For this reason, IEEE 1609.4 allocate 4 multiple service channels (SCHs) for non-safety data transfer. But, in congestion situation with many vehicles, the contention for channel acquisition between services becomes more severe. So services are provided improperly because of lack of service channel. This paper suggests dynamic channel allocation algorithm. The proposed algorithm is that RSU(RaodSide Unit) maintain and manage the information about service and status of channels. On based of the SJF(Shortest Job First) scheduling using those information, RSU selects the most appropriate channel among the 4 SCHs allocated by IEEE 1609.4 in network congestion situation.

  • PDF

Random Backoff Scheme of Emergency Warning Message for Vehicle-to-Vehicle Communications (차량 간 통신에서 충돌을 완화하기 위한 랜덤 백오프 방안)

  • Byun, Jae-Uk;Kwon, Sung-Oh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3B
    • /
    • pp.165-173
    • /
    • 2012
  • In this paper, we propose a random backoff scheme for Emergency Warning Messages (EWMs) in the vehicle-to-vehicle environment. The EWMs are disseminated from a vehicle that detects an emergency situation to other vehicles in a multi-hop fashion. Since the vehicle-to-vehicle communication based on IEEE 802.11 adapts CSMA/CA, the density of vehicles increase the probability of collisions between transmissions. Moreover, in the presence of background traffic, the EWM should have a higher priority than that of other messages in neighboring vehicles. To that end, we propose the Distant-Dependent Adaptive Backoff (DDAB) scheme, which set a different contention window for random backoff depending on the distance from the sender to the receiver. In the case when a vehicle is expected to located in the outskirts of the communication boundary, the proposed scheme makes the contention window size small in order to compete the background traffic transmission. Otherwise the contention window is set to a large number to reduce the collision possibility among the EWM transmissions. Via simulations, we show that the proposed scheme performs better than the previous schemes for EWM.