• 전기전자학회논문지
• /
• 제21권2호
• /
• pp.115-122
• /
• 2017

In vehicular safety service, every vehicle broadcasts Basic Safety Message (BSM) periodically to inform neighbor vehicles of host vehicle information. However, this can cause network congestion in a region that is crowded with vehicles resulting in a reduction in the message delivery ratio and an increase in the end-to-end delay. Therefore, it could destabilize the vehicular safety service system. In this paper, in order to improve the congestion control and to consider the hidden node problem, we propose a congestion control scheme using entire network congestion level estimation combined with transmission power control, data rate control and time slot based transmission control algorithm. The performance of this scheme is evaluated using a Qualnet network simulator. The simulation result shows that our scheme mitigates network congestion in heavy traffic cases and enhances network capacity in light traffic cases, so that packet error rate is perfectly within 10% and entire network load level is maintained within 60~70%. Thus, it can be concluded that the proposed congestion control scheme has quite good performance.

• 디지털산업정보학회논문지
• /
• 제13권1호
• /
• pp.79-85
• /
• 2017

Vehicular ad-hoc networks (VANETs) cause link disconnection problems due to the rapid speed and the frequent moving direction change of vehicles. Link disconnection in vehicle-to-vehicle communication is an important issue that must be solved because it decreases the reliability of packet forwarding. From the characteristics of VANETs, greedy forwarding protocols using the position information based on the inter-vehicle distance have gained attention. However, greedy forwarding protocols do not perform well in the urban environment where the direction of the vehicle changes greatly. It is because greedy forwarding protocols select the neighbor vehicle that is closest to the destination vehicle as the next transmission vehicle. In this paper, we propose a greedy anycast forwarding (GAF) protocol to improve the reliability of the inter-vehicle communication. The proposed GAF protocol combines the greedy forwarding scheme and the anycast forwarding method. Simulation results show that the GAF protocol can provide a better packet delivery rate than existing greedy forwarding protocols.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권3호
• /
• pp.142-152
• /
• 2014

Vehicular Ad-hoc Networks (VANETs) are comprised of wireless mobile nodes characterized by a randomly changing topology, high mobility, availability of geographic position, and fewer power constraints. Orthogonal Frequency Division Multiplexing (OFDM) is a promising candidate for the physical layer of VANET because of the inherent characteristics of the spectral efficiency and robustness to channel impairments. The susceptibility of OFDM to Inter-Carrier Interference (ICI) is a challenging issue. The high mobility of nodes in VANET causes higher Doppler shifts, which results in ICI in the OFDM system. In this paper, a frequency domain com-btype channel estimation was used to cancel out ICI. The channel frequency response at the pilot tones was estimated using a Least Square (LS) estimator. An efficient interpolation technique is required to estimate the channel at the data tones with low interpolation error. This paper proposes a robust interpolation technique to estimate the channel frequency response at the data subcarriers. The channel induced noise tended to degrade the Bit Error Rate (BER) performance of the system. Parallel concatenated Convolutional codes were used for error correction. At the decoding end, different decoding algorithms were considered for the component decoders of the iterative Turbo decoder. A performance and complexity comparison among the various decoding algorithms was also carried out.

• Journal of Communications and Networks
• /
• 제11권6호
• /
• pp.607-614
• /
• 2009

Recently, Lu et al. proposed an efficient conditional privacy preservation protocol, named ECPP, based on group signature scheme for generating anonymous certificates from roadside units (RSUs). However, ECPP does not provide unlinkability and traceability when multiple RSUs are compromised. In this paper, we make up for the limitations and propose a robust and efficient anonymous authentication protocol without loss of efficiency as compared with ECPP. Furthermore, in the proposed protocol, RSUs can issue multiple anonymous certificates to an OBU to alleviate system overheads for mutual authentication between OBUs and RSUs. In order to achieve these goals, we consider a universal re-encryption scheme and identity-based key establishment scheme as our building blocks. Several simulations are conducted to verify the efficiency and effectiveness of the proposed protocol by comparing with those of the existing ECPP.

• IEIE Transactions on Smart Processing and Computing
• /
• 제2권2호
• /
• pp.45-56
• /
• 2013

The precise identification of vehicle positions, known as the vehicle localization problem, is an important requirement for building intelligent vehicle ad-hoc networks (VANETs). To solve this problem, two categories of solutions are proposed: stand-alone and data fusion approaches. Compared to stand-alone approaches, which use single information including the global positioning system (GPS) and sensor-based navigation systems with differential corrections, data fusion approaches analyze the position information of several vehicles from GPS and sensor-based navigation systems, etc. Therefore, data fusion approaches show high accuracy. With the position information on a set of vehicles in the preprocessing stage, data fusion approaches is used to estimate the precise vehicular location in the local map building stage. This paper proposes an efficient local map building scheme, which increases the accuracy of the estimated vehicle positions via V2V communications. Even under the low ratio of vehicles with communication modules on the road, the proposed local map building scheme showed high accuracy when estimating the vehicle positions. From the experimental results based on the parameters of the practical vehicular environments, the accuracy of the proposed localization system approached the single lane-level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권10호
• /
• pp.3438-3457
• /
• 2022

As location-based services (LBS) are widely used in vehicular ad-hoc networks (VANETs), location privacy has become an utmost concern. Spatial cloaking is a popular location privacy protection approach, which uses a cloaking area containing k-1 collaborative vehicles (CVs) to replace the real location of the requested vehicle (RV). However, all CVs are assumed as honest in k-anonymity, and thus giving opportunities for dishonest CVs to submit false location information during the cloaking area construction. Attackers could exploit dishonest CVs' false location information to speculate the real location of RV. To suppress this threat, an edge-assisted Trusted Collaborative Anonymity construction scheme called TCA is proposed with trust mechanism. From the design idea of trusted observations within variable radius r, the trust value is not only utilized to select honest CVs to construct a cloaking area by restricting r's search range but also used to verify false location information from dishonest CVs. In order to obtain the variable radius r of searching CVs, a multiple linear regression model is established based on the privacy level and service quality of RV. By using the above approaches, the trust relationship among vehicles can be predicted, and the most suitable CVs can be selected according to RV's preference, so as to construct the trusted cloaking area. Moreover, to deal with the massive trust value calculation brought by large quantities of LBS requests, edge computing is employed during the trust evaluation. The performance analysis indicates that the malicious response of TCA is only 22% of the collaborative anonymity construction scheme without trust mechanism, and the location privacy leakage is about 32% of the traditional Enhanced Location Privacy Preserving (ELPP) scheme.

• 문화기술의 융합
• /
• 제8권4호
• /
• pp.367-373
• /
• 2022

VANET은 애드 혹 네트워크의 한 종류로 네트워크 인프라 없이 도로를 운행하는 자동차 노드들 사이에서 혹은 자동차들과 RSU 사이에서 운전자에게 주변의 교통 정보를 제공하고 탑승자에게 다양한 부가 정보를 제공하기 위해 생성되는 네트워크이다. VANET을 구성할 때 CCN을 기반으로 하는 경우 사용자는 필요한 자료를 저장하는 서버 주소를 지정하지 않고 키워드 등으로 주변 교통 콘텐츠를 조회할 수 있고 네트워크에 참여하는 주변 노드들의 캐시 정보를 즉시 사용할 수 있으며 멀티캐스트 전송으로 다른 노드들과 쉽게 정보를 공유할 수 있다. 본 논문은 VCCN에 참여하는 노드들이 다양한 무선 채널을 사용하는 경우 각 무선 채널에 대해 데이터 전송 성능을 측정하고 평가하였다. 모의실험 결과 802.11a 무선 채널이 다른 채널에 비해 전반적으로 전송 성능이 우수하였다. 또한 채널의 데이터 전송 용량이 허용하는 범위 내에서 CCN의 멀티캐스트 통신 속성에 의해 동시에 여러 노드가 데이터를 수신하는 경우 물리적으로 제공하는 네트워크 대역폭 이상으로 데이터를 전송할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.41-60
• /
• 2018

Recently, road traffic congestion is becoming a serious urban phenomenon, leading to massive adverse impacts on the ecology and economy. Therefore, solving this problem has drawn public attention throughout the world. One new promising solution is to take full advantage of vehicular ad hoc networks (VANETs). In this study, we propose a new traffic congestion detection and quantification method based on vehicle clustering and fuzzy assessment in VANET environment. To enhance real-time performance, this method collects traffic information by vehicle clustering. The average speed, road density, and average stop delay are selected as the characteristic parameters for traffic state identification. We use a comprehensive fuzzy assessment based on the three indicators to determine the road congestion condition. Simulation results show that the proposed method can precisely reflect the road condition and is more accurate and stable compared to existing algorithms.

• Journal of the Korean Data and Information Science Society
• /
• 제22권6호
• /
• pp.1153-1166
• /
• 2011

차량 네트워크에서 부정행위를 탐지하는 것은 안전 관련 응용 및 혼잡 완화 응용을 포함하는 광범위한 영향을 갖는 매우 중요한 문제이다. 대부분 부정행위 탐지 방법들은 악의적인 노드들의 탐지와 관련이 있다. 대부분 상황들에서, 차량들은 운전자의 이기적인 이유 때문에 틀린 정보를 보낼 수 있다. 합리적인 행위 때문에 부정행위를 하는 노드를 식별하는 것보다 거짓 경보 정보를 탐지하는 것이 더 중요하다. 이 논문에서, 우리는 경보 메시지를 전송한 후, 부정행위를 한 노드들의 행위를 관찰하여 거짓 경보 메시지를 탐지하는 가변 정밀도 러프집합 기반 부정행위 탐지 방법을 제안한다. 차량 네트워크에서 이동하는 노드의 타당한 행위들로부터 경보 프로파일인 경보 정보 시스템이 먼저 구축되어진다. 어떤 이동하는 차량이 다른 차량으로부터 경보 메시지를 받으면, 수신차량은 그 메시지로부터 경보종류를 알아낸다. 경과시간 후, 수신차량이 경보 전송차량으로부터 비콘을 받으면, 수신차량은 경보 정보 시스템으로부터 가변 정밀도 러프집합을 사용하여 상대적 분류 오차를 계산한다. 만일 그 상대적 분류 오차가 그 경보종류의 최대 허용 가능한 분류 오차보다 크면, 수신 차량은 그 메시지를 거짓 경보 메시지로 결정한다. 제안하는 방법의 성능은 모의실험을 통하여 2가지 척도, 즉 정확률과 부정확률로 평가되어진다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권8호
• /
• pp.1933-1954
• /
• 2013

Multiple wireless devices are being widely deployed in Intelligent Transportation System (ITS) services on the road to establish end-to-end connection between vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) networks. Vehicular ad hoc networks (VANETs) play an important role in supporting V2V and V2I communications (also called V2X communications) in a variety of urban environments with distinct topological characteristics. In fact, obstacles such as big buildings, moving vehicles, trees, advertisement boards, traffic lights, etc. may block the radio signals in V2X communications. Their impact has been neglected in VANET research. In this paper, we present a realistic and efficient radio propagation model to handle different sizes of static and moving obstacles for V2X communications. In the proposed model, buildings and large moving vehicles are modeled as static and moving obstacles, and taken into account their impact on the packet reception rate, Line-of-sight (LOS) obstruction, and received signal power. We use unsymmetrical city map which has many dead-end roads and open faces. Each dead-end road and open faces are joined to the nearest edge making a polygon to model realistic obstacles. The simulation results of proposed model demonstrates better performance compared to some existing models, that shows proposed model can reflect more realistic simulation environments.