• Title/Summary/Keyword: 차량 ad hoc 네트워크

Search Result 118, Processing Time 0.036 seconds

A Vehicular Authentication Security Mechanism Modeling using Petri Net (Petri Net을 이용한 차량 인증 보안 메커니즘 모델링)

  • Song, Yu-Jin;Lee, Jong-Kun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.04a
    • /
    • pp.364-367
    • /
    • 2014
  • 차량 애드혹 네트워크(VANET : Vehicular Ad-Hoc Network) 환경에서 차량들은 네트워크 인프라를 바탕으로 한 통신들을 통하여 서로의 안전이나 편리성을 도모하고자 많은 관심을 가지고 지금까지 연구되어 왔으며 앞으로도 활발히 연구될 것이다. 그러나 안전성이나 편리성을 도모하고자 연구되어왔던 여러 부분들이 보안문제에 직면하면서 새로운 국면으로 접어들고 있다. 이에 본 논문에서는 차량 애드혹 네트워크에서 차량 간 통신을 효율적이고 안전하게 전송하기 위해 우선되어야 하는 차량의 인증을 위한 보안 메커니즘을 제안하고 이를 패트리넷 모델링 기법을 통해 검증하고자 한다. 본 논문에서 제안하는 차량 인증 보안 메커니즘(VASM : Vehicular Authentication Security Mechanism)은 차량 인증 기능과 함께 패트리넷으로 모델링 함으로써 차량들의 많은 변화로 복잡할 수밖에 없는 VANET에서의 보안요구들을 정의하여 수행하는데 유연하게 대처할 수 있다.

The AODV Routing Protocol based on Location Information for Inter-Vehicle Communication (차량간 통신을 위한 위치 정보 기반의 AODV 라우팅 프로토콜)

  • Lee, Eun-Ju;Lee, Kwoun-Ig;Jwa, Jeong-Woo;Yang, Doo-Yeong
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.3
    • /
    • pp.47-54
    • /
    • 2008
  • In order to realize Intelligent Transport System (ITS) without any road facilities support, Inter-vehicle Communication (IVC) is increased attention. IVC makes it possible to exchange real-time information among vehicles without centralized infrastructure. The IVC systems use multi-hop broadcast to disseminate information. In this paper, we propose the improved AODV routing protocol based on location information. The proposed AODV routing protocol transmits Hello packet with location information to calculate the distance between nodes. Then it achieves fast link recovery. We confirm the throughput performance of the proposed AODV routing protocol compared with the AODV routing protocol using Qualnet ver.3.8 simulator.

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

Routing Algorithm for Urban Vehicular Ad hoc Networks (도시환경 VANET을 고려한 라우팅 알고리즘)

  • Jung, Hyun-Jae;Lee, Su-Kyoung
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.2
    • /
    • pp.157-161
    • /
    • 2010
  • Vehicular Ad-hoc NETworks (VANETs) suffer from frequent network disconnections due to obstacles such as buildings even in urban environments with high density of traffic. Thus, in this paper, we propose a routing algorithm that finds optimal end-to-end paths in terms of both traffic density and distance in the urban VANET and selects the next hop with the minimum distance, while maintaining the minimum hop counts over the path. The simulation results show that the proposed algorithm achieves higher throughput and smaller end-to-end delay than Greedy Perimeter Stateless Routing (GPSR) with message carrying.

Integration of Proximity-based Services with Vehicular Ad-hoc Networks (교통 기관 애드혹 네트워크 와 Proximity기반 서비스의 통합)

  • Diouf, Elhadji Makhtar
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.126-129
    • /
    • 2015
  • Device-to-device (D2D) communications, a subset of Proximity-based Services that enables direct communication between LTE network subscribers, is gaining popularity. It is well underway to be adopted in cellular communication systems for pedestrian and connected-vehicles alike. In this paper, we briefly present our model of an Evolved Packet Core Network-assisted device discovery simulator and show the applicability of Proximity-based Services for Vehicular Ad-hoc Networks. Through the performance evaluation based on the developed simulation environment, it is shown that in case when users gather in the same vicinity, as in public transportation, LTE network data can be efficiently offloaded and multicasted through Wi-Fi for e.g. delivering traffic-related information and for the benefit of infotainment service consumers.

  • PDF

Centralized routing method of unmanned aerial vehicle using vehicular Ad Hoc networks (차량 네트워크 기반 중앙관리형 무인비행체 경로 유도 시스템)

  • Kim, Ryul;Joo, Yang-Ick
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.9
    • /
    • pp.830-835
    • /
    • 2016
  • With the relaxation of regulations on unmanned aerial vehicles (UAVs) in the USA, the development of related industries is expected. Hence, it is anticipated that the number the UAVs will reach approximately 600,000 in the USA in 2017. However, automated flights of commercial UAVs are restricted owing to concerns about accidents. To deal with the possibility of collisions, several studies on collision prevention and the routing of UAVs have been conducted. However, these studies do not deal with various situations dynamically or provide efficient solutions. Therefore, we propose a centralized routing method for the UAV that uses vehicular networks. In the proposed scheme, vehicular networks regard UAVs as data packets to be routed. Accordingly, the proposed method reduces UAV processing power required for route searches. In addition, the routing efficiency for UAV flight paths can be improved since congestion can be minimized by using a vehicular network.

CCN Implementation in Vehicle Ad-hoc Network (Vehicle Ad-hoc Network 환경에서의 CCN 적용)

  • Chae, Ye-Eun;Kim, Yun-A;Park, Se-Eun;Yu, Ji-Hyun;Joo, Mi-Sun;Hyeon, Seon-Mi;Kang, Seung-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.11a
    • /
    • pp.126-127
    • /
    • 2017
  • 사물인터넷 산업이 발전함으로써 차량 간의 통신이 주목 받고 있다. 네트워크 연결이 빈번하게 끊어지는 자동차 사이에서 무선으로 통신을 하기 위한 네트워킹에 대해 알아본다. 이를 위하여 차량이 노드 역할을 하는 VANET 환경에서 CCN을 적용하여 Data Packet 수를 살펴보았다.

An Adaptive Relay Node Selection Scheme for Alert Message Propagation in Inter-vehicle Communication (차량간 통신에서 긴급 메시지 전파를 위한 적응적 릴레이 노드 선정기법)

  • Kim, Tae-Hwan;Kim, Hie-Cheol;Hong, Won-Kee
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.571-582
    • /
    • 2007
  • Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

A study of design mechanism for the alerting car accident (차량 사고 위험인지를 위한 방안 설계연구)

  • Park, Sang-Joon;Kim, Kwan-Joong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.11
    • /
    • pp.5272-5277
    • /
    • 2011
  • By mobile technique and vehicle industry development, vehicle service industry based on Intelligent network as telematics service will be more raised. Most of countries expect its industrial market so that many researches and standardization are being advanced. For the telematics service, the vehicle safety technique will be very important so that its research should be expected. Hence, in this paper, we propose a design mechanism for the alerting car accident to identify or avoid dangerous accident by the network of cars.

Data Dissemination in LTE-D2D Based Vehicular Network (LTE-D2D 차량 네트워크에서 정보 전달 방법)

  • Shim, Yong-Hui;Kim, Young-Han
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.3
    • /
    • pp.602-612
    • /
    • 2015
  • Current IEEE 802.11p which is suggested for vehicle to vehicle communication supports one hop communication. Thus, it has a limitation to carry out efficient data dissemination. In this thesis, we suggest LTE-D2D based vehicle network to provide efficient data dissemination in the vehicle environment. In this network architecture, we use name based message with IP packet options and we put the intermediate vehicle node called 'super vehicle node' and each normal vehicle node in the cell requests data to the super vehicle node. The super vehicle node responses data to the normal vehicle node. Performance analysis is based mathematical modeling. We compare LTE cellular network to LTE-D2D based vehicle network about throughput according to packet delivery time.