• Title/Summary/Keyword: RSU(Road Side Unit)

Search Result 36, Processing Time 0.027 seconds

Clustering Algorithm with using Road Side Unit(RSU) for Cluster Head(CH) Selection in VANET (차량 네트워크 환경에서 도로 기반 시설을 이용한 클러스터 헤드 선택 알고리즘)

  • Kwon, Hyuk-joon;Kwon, Yong-ho;Rhee, Byung-ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.620-623
    • /
    • 2014
  • Network topology for communication between vehicles are quickly changing because vehicles have a special movement pattern, especially character which is quickly changed by velocity and situation of road. Because of these feature, it is not easy to apply reliable routing on VANET(Vehicular Ad-hoc Network). Clustering method is one of the alternatives which are suggested for overcoming weakness of routing algorithm. Clustering is the way to communicate and manage vehicles by binding them around cluster head. Therefore choosing certain cluster head among vehicles has a decisive effect on decreasing overhead in relevant clustering and determining stability and efficiency of the network. This paper introduces new cluster head selection algorithm using RSU(Road Side Unit) different from existing algorithms. We suggest a more stable and efficient algorithm which decides a priority of cluster head by calculating vehicles' velocity and distance through RSU than existing algorithms.

  • PDF

Performance Analysis of RSUs in Probability-Based Data Delivery Strategy for Energy-Constrained V2I Systems (제한된 에너지원을 갖는 V2I 시스템의 확률 기반의 데이터 전달 기법에서 RSU의 성능 분석)

  • Suh, Bongsue
    • The Journal of Korean Institute of Information Technology
    • /
    • v.16 no.11
    • /
    • pp.69-76
    • /
    • 2018
  • As for V2I(Vehicle-to-Infrastructure) systems with energy-constrained RSUs(Road Side Units), the previous data delivery strategies have not considered the aspect of energy usage at RSUs. A new data delivery strategy has been proposed to determine the RSU's participation in data delivery based on the probability dependent on the RSU's remaining energy, and it showed the lower data delivery time than the previous approaches. In this paper, we propose methods to analyze the number of RSUs participating in data delivery and the variations of RSUs' energy value for the consecutive data deliveries. As a numerical result, compared with the previous strategy, the probability-based data delivery strategy shows the lower number of participating RSUs and the increased average energy value of all RSUs. In addition, from the analytical results, we propose considerations for the real implementations of the similar systems.

Development of Location based Broadcast System Model for Real-time Traffic Information (실시간 교통 정보 제공을 위한 LBI 시스템 모델 개발)

  • Park, Hyun-Moon;Park, Woo-Chool;Park, Soo-Huyn
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.2
    • /
    • pp.137-145
    • /
    • 2010
  • This study presents an RTS(Real-time Traffic System) based on an LBS(Location Based Service) using 5.8~5.9GHz RSU(Road Side Unit). The proposed LBI(Location based Broadcast system on ITS) is a local information-based service supported by RSU for drivers, which has a feature of convergence between T-DMB system and ITS-based RTS. The convergence of local broadcasting station and ITS is realized by two-way communication and supports LBS(Location Based Service) by identifying of vehicle's location using RSU. Real-time information delivery and various services could be provided by information exchanges between LMM and local broadcasting stations. Furthermore, conventional technical limitations have been solved mutually such as transmission area limitation in RTS and one-way communication problem in T-DMB. This support real-time two-way communication to each driver. Therefore, it can be expected that traffic dispersion effects and services expansion for drivers by RTS and LBI. Finally, it is proposed to built and implement test-bed around institute.

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

An Efficient Group Key Management Scheme using Counting Bloom Filter in VANET (VANET에서 카운팅 블룸 필터를 사용한 효율적인 그룹 키 관리 기법)

  • Lee, SuYoun;Ahn, HyoBeom
    • Convergence Security Journal
    • /
    • v.13 no.4
    • /
    • pp.47-52
    • /
    • 2013
  • VANET(Vehicular Ad-hoc Network) is a kind of ad hoc networks which is consist of intelligence vehicular ad nodes, and has become a hot emerging research project in many fields. It provides traffic safety, cooperative driving and etc. but has also some security problems that can be occurred in general ad hoc networks. In VANET, it has been studies that group signature method for user privacy. However, among a group of group key generation phase and group key update phase, RSU(Road-Side Unit) and the computational overhead of the vehicle occur. In this paper, we propose an efficient group key management techniques with CBF(Counting Bloom Filter). Our group key management method is reduced to the computational overhead of RSU and vehicles at the group key generation and renewal stage. In addition, our method is a technique to update group key itself.

The Design and Implementation of Tracking the Vehicle over the GPS system (GPS를 이용한 차량 추적 시스템의 설계 및 구현)

  • Lee, Yong Kwon;Lee, Dae Sik;Jang, Chung Ryong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.4
    • /
    • pp.69-79
    • /
    • 2013
  • A system of tracking a vehicle collects the vehicle location and then transmits the data into a GIS server in order to provide several service areas. An ODU built in the vehicle savesa GPS information data and communicates with the RSU installed in the road over the wave technology. The collected data in RSU is transmitted into the GIS serverand is stored. The system based on the collected GPS data in each vehicle is providing useful and various services between RSU and OBU. In this paper indicates that the system is designed in 2 phasesbased on the collected GPS data. The result comparing to process of GPS data created in 1 phase and 2 phase over the Web GIS service indicates that the capability of process of the GPS data in 2 phase is enhanced in "50.88% ~ 51.81%". Therefore, when the accident is happened the system of tracking the vehicle over GPS tech not only receives the information properly but also provides the emergence rescue services.

An Efficient Signature Batch Verification System for VANET (VANET를 위한 효율적인 서명 일괄 확인 시스템)

  • Lim, Ji-Hwan;Oh, Hee-Kuck;Kim, Sang-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.1
    • /
    • pp.17-31
    • /
    • 2010
  • In VANET (Vehicular Ad hoc NETwork), vehicles can efficiently verify a large number of signatures efficiently using batch verification techniques. However, batch verification performed independently in each vehicle raises many redundant verification cost. Although, an RSU (Road Side Unit) can perform the batch verification as a proxy to reduce this cost, it additionally requires an efficient method to identify invalid signatures when the batch verification fails. In this paper, we analyze several ways of constructing a distributed batch verification system, and propose an efficient distributed batch verification system in which participating vehicles perform batch verification in a distributive manner for a small size signature set. In our proposed system, each node can report the batch verification result or the identified invalid signatures list and the RSU who received these reports can identify the invalid signatures and efficiently exclude them.

Development of WAVE Networking Service Protocol for RSU(Road-side Unit) (RSU를 위한 WAVE 네트워킹 서비스 프로토콜 개발)

  • Ju, Hong-Taek;Ko, Kang-Min;Kwon, Dong-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5B
    • /
    • pp.395-404
    • /
    • 2012
  • In this paper, we analyze and develop standard protocols for WAVE Networking Services described by IEEE 1609.3 which is one of standards for Intelligent Transportation Systems. In particular, we develop 'WAVE Management Entity(WME)' and 'WAVE Short Message Protocol(WSMP)'. For verification of development, we also develop Traffic Management System and RSU Manager, then we present results of verification by Traffic Management System in the car accident scenario.

Cluster Management Scheme for Safety Message Dissemination in a VANET Environment (VANET 환경에서 안전 메시지 배포를 위한 클러스터 관리 기법)

  • Pyun, Do-Woong;Lim, Jongtae;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.5
    • /
    • pp.26-36
    • /
    • 2022
  • Recently, studies have been conducted to cluster vehicles and disseminate safety messages in a VANET environment for driver safety and smoothy traffic. This paper proposes cluster management scheme for safety message dissemination through V2V communication and V2I communication in a VANET environment with high vehicle density and mobility. The proposed scheme reduces packet loss by selecting CH considering reception quality, total data owned by vehicles, moving speed, and connected vehicles, and maintaining cluster head candidates, which are the main agents of message dissemination, considering frequent cluster departures and subscriptions. In addition, the proposed scheme reduces duplicate messages by utilizing clusters by collaborating with a Road side unit(RSU). To prove the excellence of the proposed scheme, various performance evaluations are performed in terms of message packet loss and the number of RSU processing requests. As a result of performance evaluation, the cluster management scheme proposed in this paper shows better performance than the existing scheme.

An Efficient Anonymous Authentication Protocol Based on Multiple Anonymous Certificates in VANET (VANET에서 다중 익명 인증서 기반 효율적인 익명 인증 프로토콜)

  • Jung, Chae-Duk;Sur, Chul;Park, Young-Ho;Rhee, Kyung-Hyune
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.589-596
    • /
    • 2009
  • Until now, some protocols have been presented to provide vehicle's anonymity and unlinkability in VANET by means of issuing multiple anonymous certificates to each vehicle from the trust authority, or shot-time anonymous certificate to a vehicle after mutual authentication between a Roadside Unit (RSU) and the vehicle. However, these protocols have high overheads of the trust authority, RSUs and vehicles for generating anonymous certificate. In this paper, we propose an efficient anonymous authentication protocol, in which RSUs can issue multiple shot-time anonymous certificates to a vehicle to alleviate system overheads for mutual authentication between vehicles and RSUs. Several simulations are conducted to verify the efficiency of the proposed protocol in terms of RSU valid serve ratio and vehicle's computational costs. Moreover, the proposed protocol provides unlinkability and traceability when multiple RSUs are compromised, whereas previous protocols do not provide unlinkability and traceability.