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

• 한국통신학회논문지
• /
• 제38C권7호
• /
• pp.605-611
• /
• 2013

본 논문은 차량이 사고가 발생하였을 때, 사고 차량이 가까이에 있는 주위 차량에 긴급메시지를 전파하여, 다른 차량의 운전자들이 사고지점을 인지하고 회피할 수 있도록 효과적이고 빠른 브로드캐스트 기법에 관하여 기술하였다. 본 논문에서는 GPS(Global Position System)가 장착된 도심환경의 차량 네트워크에서 긴급 메시지를 빠르게 전파하는 방법을 제안한다. 전송 차량은 연속적이고 효과적인 메시지 전파를 위해 가장 멀리 있는 차량을 다음 릴레이 차량으로 미리 선정하고 전파를 하는 기법을 제안한다. 그리고 RSU(Road Side Unit)의 도움 없이 교차로를 인식할 수 있는 알고리즘을 제안하며, 끊어진 네트워크 상황에 대처하기 위해 헬로 메시지를 이용한 SCF(Store-Carry-Forward) 기법을 제안한다.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.207-216
• /
• 2013

Vehicular ad-hoc networks (VANETs) are self-organizing, self-healing networks which provide wireless communication among vehicular and roadside devices. Applications in such networks can take advantage of the use of simultaneous connections, thereby maximizing the throughput and lowering latency. In order to take advantage of all radio interfaces of the vehicle and to provide good quality of service for vehicular applications, we developed a seamless flow mobility management architecture based on vehicular network application classes with network-based mobility management. Our goal is to minimize the time of flow connection exchange in order to comply with the minimum requirements of vehicular application classes, as well as to maximize their throughput. Network simulator (NS-3) simulations were performed to analyse the behaviour of our architecture by comparing it with other three scenarios. As a result of this work, we observed that the proposed architecture presented a low handover time, with lower packet loss and lower delay.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.122-131
• /
• 2013

We address the problem of effective vehicular routing in hostile scenarios where malicious nodes intend to jeopardize the delivery of messages. Compromised vehicles can severely affect the performance of the network by a number of attacks, such as selectively dropping messages, manipulating them on the fly, and the likes. One of the best performing solutions that has been used in static wireless sensor networks to deal with these attacks is based on the concept of watchdog nodes (also known as guard nodes) that collaborate to continue the forwarding of data packets in case a malicious behavior in a neighbor node is detected. In this work, we consider the beacon-less routing algorithm for vehicular environments routing protocol, which has been previously shown to perform very well in vehicular networks, and analyze whether a similar solution would be feasible for vehicular environments. Our simulation results in an urban scenario show that watchdog nodes are able to avoid up to a 50% of packet drops across different network densities and for different number of attackers, without introducing a significant increase in terms of control overhead. However, the overall performance of the routing protocol is still far from optimal. Thus, in the case of vehicular networks, watchdog nodes alone are not able to completely alleviate these security threats.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2010년도 한국컴퓨터종합학술대회논문집 Vol.37 No.1(D)
• /
• pp.190-195
• /
• 2010

Vehicular ad hoc networks (VANETs) have a number of interesting applications to preserve road safety, notify users about changed road/traffic condition, handling post accident hazards and moreover service oriented applications to make the travel convenient to the drivers. Use of common information format for diverse applications enables the application developers to easily design flexible information dissemination system for new applications or add new features to existing application. This paper introduces a common information format for various applications in VANETs. The main goal of the paper is to design generalized distributed architectures for vehicular networks, which considers diverse application development scenarios and uses common information format. The proposed architectures enable the application developers to flexibly disseminate information to affected or interested user. In this paper, we have given a detail description of each component of the architectures and how they communicate with each other. In future, we will implement the proposed architecture using suitable simulator.

• 한국통신학회논문지
• /
• 제37권8B호
• /
• pp.695-705
• /
• 2012

무선 단말과 자동차 산업의 발전으로 도로 위의 차량들이 데이터 전달의 주체가 되는 차량 애드 혹 네트워크(Vehicular Ad hoc Networks, VANET)에 대한 연구가 활발하다. 차량에 의해 전달되는 데이터는 승객/운전자의 안전 및 교통 혼잡에 영향을 주는 긴급한 정보를 포함하고 있으므로 빠르고 신뢰성 있게 전달되어야 하고, 이를 위한 라우팅 프로토콜은 VANET의 성능에 큰 영향을 미친다. 이에 본 논문에서는 데이터 전달에 참여하는 차량의 이동 방향이 성능이 미치는 영향을 살펴보고, 이를 기반으로 신호등이 있는 도로에서 빠르고 신뢰성 있게 메시지를 전파하기 위해 CBF(Contention-Based Forwarding)를 확장하는 방안을 제안한다. 제안하는 방안은 신호등이 있는 도로에서 메시지 전파의 신뢰성을 높이면서도 전달 차량 간의 위치 관계 변화에 의한 라우팅 루프와 메시지 전달이 중단되는 등의 문제를 발생시키지 않는다. 또한 시뮬레이션을 통하여 제안하는 방안을 적용한 CBF(R-CBF)와 기존 연구 중 메시지 전달의 신뢰성을 향상시키되 메시지 전파 방향과 반대로 이동하는 차량을 전달 차량으로 선택하는 G-SRMB의 성능을 비교하여 R-CBF가 G-SRMB에 비해 메시지 전파 지연 시간을 최대 38% 감소시키고, 불필요한 재전송 없이 동작함을 확인하였다.

• 한국멀티미디어학회논문지
• /
• 제19권8호
• /
• pp.1597-1608
• /
• 2016

Recently, a number of solutions were proposed to address the challenges and issues of vehicular networks. Vehicular Cloud Computing (VCC) is one of the solutions. The vehicular cloud computing is a new hybrid technology that has a remarkable impact on traffic management and road safety by instantly using vehicular resources. In this paper, we study an important vehicular cloud service, content-based delivery, that allows future vehicular cloud applications to store, share and search data totally within the cloud. We design a VCC-based system architecture for efficient sharing of vehicular contents, and propose a Hierarchical Hybrid Content Delivery scheme using Bloom Filter (H2CDBF) for efficient vehicular content delivery in Vehicular Ad-hoc Networks (VANETs). The performance of the proposed H2CDBF is evaluated through an analytical model, and is compared to the proactive content discovery scheme, Bloom-Filter Routing (BFR).

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 추계학술발표대회
• /
• pp.1053-1056
• /
• 2012

Location information is considered to be of prime importance in Vehicular Ad Hoc NETworks (VANETs) because important decisions are made based on accurate and sound location information. Vehicles exchange their whereabouts in the form of scheduled beacon messages with their neighbors. These messages contain location, speed, time, and lane information etc. In this paper we aim at the location security in VANET and emphasize on the confidentiality and integrity of location information in case of Nonline-of-Sight (NLoS). For location confidentiality we propose a geolock-based mechanism whereas for location integrity we leverage cooperation among neighbors. In case of NLoS, the verifier vehicle asks its one-hop neighbors in an efficient way to verify the claimed location of the node on his behalf. On the basis of trust values and weightage assigned to neighbors, it is decided whether the verification is sound.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2018년도 춘계학술대회
• /
• pp.419-421
• /
• 2018

Cloud vehicular networks are a promising paradigm to improve vehicular through distributing computation tasks between remote clouds and local vehicular terminals. Software-Defined Network(SDN) can bring advantages to Intelligent Transportation System(ITS) through its ability to provide flexibility and programmability through a logically centralized controlled cluster that has a full comprehension of view of the network. However, as the SDN paradigm is currently studied in vehicular ad hoc networks(VANETs), adapting it to work on cloud-based vehicular network requires some changes to address particular computation features such as task computation of applications of cloud-based vehicular networks. There has been initial work on briging SDN concepts to vehicular networks to reduce the latency by using the fog computing technology, but most of these studies do not directly tackle the issue of task computation. This paper proposes a Software-Defined Cloud-based vehicular Network called SDCVN framework. In this framework, we study the effectiveness of task computation of applications of cloud-based vehicular networks with vehicular cloud and roadside edge cloud. Considering the edge cloud service migration due to the vehicle mobility, we present an efficient roadside cloud based controller entity scheme where the tasks are adaptively computed through vehicular cloud mode or roadside computing predictive trajectory decision mode. Simulation results show that our proposal demonstrates a stable and low route setup time in case of installing the forwarding rules of the routing applications because the source node needs to contact the controller once to setup the route.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2018년도 춘계학술대회
• /
• pp.238-240
• /
• 2018

Cloud vehicular networks are a promising paradigm to improve vehicular through distributing computation tasks between remote clouds and local vehicular terminals. Software-Defined Network(SDN) can bring advantages to Intelligent Transportation System(ITS) through its ability to provide flexibility and programmability through a logically centralized controlled cluster that has a full comprehension of view of the network. However, as the SDN paradigm is currently studied in vehicular ad hoc networks(VANETs), adapting it to work on cloud-based vehicular network requires some changes to address particular computation features such as task computation of applications of cloud-based vehicular networks. There has been initial work on briging SDN concepts to vehicular networks to reduce the latency by using the fog computing technology, but most of these studies do not directly tackle the issue of task computation. This paper proposes a Software-Defined Cloud-based vehicular Network called SDCVN framework. In this framework, we study the effectiveness of task computation of applications of cloud-based vehicular networks with vehicular cloud and roadside edge cloud. Considering the edge cloud service migration due to the vehicle mobility, we present an efficient roadside cloud based controller entity scheme where the tasks are adaptively computed through vehicular cloud mode or roadside computing predictive trajectory decision mode. Simulation results show that our proposal demonstrates a stable and low route setup time in case of installing the forwarding rules of the routing applications because the source node needs to contact the controller once to setup the route.