• 정보과학회지
• /
• 제27권9호
• /
• pp.48-57
• /
• 2009

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권1호
• /
• pp.233-262
• /
• 2024

Due to the rapid evolution of vehicular ad hoc networks (VANETs), effective communication and security are now essential components in providing secure and reliable vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. However, due to their dynamic nature and potential threats, VANETs need to have strong security mechanisms. This paper presents a novel approach to improve VANET security by combining the Vehicular Delay-Tolerant Network (VDTN) protocol with the Deep Reinforcement Learning (DRL) technique known as the Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm. A store-carry-forward method is used by the VDTN protocol to resolve the problems caused by inconsistent connectivity and disturbances in VANETs. The TD3 algorithm is employed for capturing and detecting Worm Hole Attack (WHA) behaviors in VANETs, thereby enhancing security measures. By combining these components, it is possible to create trustworthy and effective communication channels as well as successfully detect and stop rushing attacks inside the VANET. Extensive evaluations and simulations demonstrate the effectiveness of the proposed approach, enhancing both security and communication efficiency.

• 한국ITS학회 논문지
• /
• 제13권6호
• /
• pp.43-53
• /
• 2014

차량-인프라 간(V2I, Vehicle-to-Infrastructure) 통신 환경에서 도로 상의 차량 및 사용자들에게 보다 양질의 서비스를 제공하기 위해서는 차량이 기지국 간을 이동 시에도 데이터 흐름이 끊어지지 않도록 하는 핸드오버 기능의 제공이 필요하다. WAVE(Wireless Access in Vehicular Environments) 표준은 차량 환경에서 장치 간에 보다 효과적인 통신을 하기 위한 여러 기능들을 정의하고 있지만, V2I 서비스의 품질을 향상시키기 위한 핸드오버 기능은 포함하고 있지 않다. 본 논문에서는 WAVE 통신 시스템에 기반을 둔 핸드오버 메커니즘을 소개하고, 실제 도로 상에서 해당 메커니즘이 구현된 기지국 및 단말기를 이용한 실험을 통해 도출된 성능 분석 결과를 보인다.

• 대한임베디드공학회논문지
• /
• 제5권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.

• 전자공학회논문지
• /
• 제51권6호
• /
• pp.183-189
• /
• 2014

최근 자동차에 불고 있는 스마트 바람은 더 이상 차량을 운송도구가 아닌 스마트 이동수단으로 만들어 놓았다. 스마트 자동차는 여러기술이 복합화되는 것이어야 하지만, 그중에서도 자동차의 통신 인프라로 자주 거론되는 것은 바로 WAVE(Wireless Access in Vehicular Environment)이다. 현재 국내의 현실은 WAVE를 활용하여 차량용 통신을 지원하기에는 어려운 상황이다. 가장 근본적인 이유는 주파수가 할당되어 있지 않기 때문인데, 본 논문에서는 WAVE관련 표준화 상황을 살펴보고 더불어 관련 전문가들의 설문에 근거하여 WAVE용 주파수의 할당이 어떤 식으로 이뤄져야 하는가에 대해서 살펴보도록 한다

• 한국IT서비스학회지
• /
• 제11권4호
• /
• pp.195-213
• /
• 2012

In ubiquitous environments, the Intelligent Transportation System (ITS) protocol is a typical service used to improve the quality of life for humans. The Vehicular Ad-hoc Network (VANET) protocol, a part of ITS, needs further study with regards to its support for high reliability, high speed mobility, data transmission efficiency, and so on. The IEEE 802.11 standard provides a high data rate channel, but it was designed for peer-to-peer network protocols. IEEE 802.11p also provides a high data rate channel, however, it only facilitates communication between roadside and on-board equipment. A VANET has characteristics that enable its topology to change rapidly; it can also be expanded to a multi-hop range network during communication. Therefore, the VANET protocol needs a way to infer the current topology information relating to VANET equipped vehicles. In this paper, we present the Multi-Beacon MAC Protocol, and propose a method to resolve the problem of beacon collisions in VANET through the use of this Multi-Beacon MAC protocol. Evaluation of the performance of Multi-Beacon MAC protocol by means of both mathematical analyses and simulation experiments indicate that the proposed method can effectively reduce beacon collisions and improve the throughput and the delay between vehicles in VANET systems.

• 한국전자통신학회논문지
• /
• 제14권5호
• /
• pp.837-844
• /
• 2019

본 논문에서는 VANET(: Vehicular Ad Hoc Networks)환경에서 비-안전 애플리케이션을 위한 낮은 지연을 제공하기 위해 AMBM(: Adaptive Multi-channel Backoff Machisum)-MAC 프로토콜을 제안한다. 제안된 프로토콜은 우선 순위가 다른 비-안전 패킷간의 처리량의 극대화를 위해 WSA(: WAVE Service Advertisement)의 CW(: C hannel window)를 동적으로 조정하여 비-안전 패킷의 서비스품질을 보장한다. 또한 SC(: Service Channel)를 위한 채널조정 및 타임슬롯예약을 하기 위해 많은시간을 할당하고 CW 및 최적 CCI(: CC Interval)를 동적으로 조정함으로서 IEEE 1609.9, C-MAC(: Coordinated multi-channel MAC), Q-VCI(QoS Variable CCH Interval) 프로토콜보다 노드가 증가할 때 전송지연이 감소됨을 보인다.

• 한국전자통신학회논문지
• /
• 제15권6호
• /
• pp.1011-1016
• /
• 2020

고속 VANET(: Vehicular Ad Hoc Network)에서 네트워크 토폴로지의 급속한 변화는 라우팅 프로토콜 설계에 중요한 과제이다. 라우팅 프로토콜의 성능에 영향을 미치는 다음 홉 릴레이 노드를 선택하는 작업은 어려운 과정이다. VANET과 관련된 AODV(: Ad Hoc On-Demand Distance Vector)의 단점은 종단 간 지연 및 패킷 손실이다. 본 논문은 AODV 라우팅 프로토콜을 수정하여 방향 매개 변수와 2단계 필터링을 추가하여 RREQ(: Route Request) 및 RREP(: Route Reply) 메시지 수를 줄이는 AAODV(: Advanced AODV)기법을 제안한다. 제안된 AAODV는 패킷 손실을 줄이고 방향 매개 변수의 영향을 최소화 함으로서 패킷전달율이 증가하고, 종단 간 지연이 감소됨을 알 수 있다.

• International Journal of Computer Science & Network Security
• /
• 제21권11호
• /
• pp.105-110
• /
• 2021

Contact between Vehicle-to-vehicle and vehicle-to-infrastructural is becoming increasingly popular in recent years due to their crucial role in the field of intelligent transportation. Vehicular Ad-hoc networks (VANETs) security and privacy are of the highest value since a transparent wireless communication tool allows an intruder to intercept, tamper, reply and erase messages in plain text. The security of a VANET based intelligent transport system may therefore be compromised. There is a strong likelihood. Securing and maintaining message exchange in VANETs is currently the focal point of several security testing teams, as it is reflected in the number of authentication schemes. However, these systems have not fulfilled all aspects of security and privacy criteria. This study is an attempt to provide a detailed history of VANETs and their components; different kinds of attacks and all protection and privacy criteria for VANETs. This paper contributed to the existing literature by systematically analyzes and compares existing authentication and confidentiality systems based on all security needs, the cost of information and communication as well as the level of resistance to different types of attacks. This paper may be used as a guide and reference for any new VANET protection and privacy technologies in the design and development.

• International journal of advanced smart convergence
• /
• 제8권4호
• /
• pp.179-187
• /
• 2019

Vehicular density is usually low in a highway environment. Consequently, connectivity of the vehicular ad hoc networks (VANETs) might be poor. We are investigating the problem of deploying the approximation optimal roadside units (RSUs) on the highway covered by VANETs, which employs VANETs to provide excellent connectivity. The goal is to estimate the minimal number of deployed RSUs to guarantee the connectivity probability of the VANET within a given threshold considering that RSUs are to be allocated equidistantly. We apply an approximation algorithm to distribute RSUs locations in the VANETs. Thereafter, performance of the proposed scheme is evaluated by calculating the connectivity probability of the VANET. The simulation results show that there is the threshold value M of implemented RSUs corresponding to each vehicular network with N vehicles. The connectivity probability increases slowly with the number of RSUs getting larger.