• Title/Summary/Keyword: Vehicular ad hoc network(VANET)

Search Result 149, Processing Time 0.032 seconds

A Message Authentication Scheme for V2V message based on RSSI with anonymity (익명성을 제공하는 RSSI기반 V2V 메시지 인증기법)

  • Seo, Hwa-Jeong;Kim, Ho-Won
    • The KIPS Transactions:PartC
    • /
    • v.18C no.4
    • /
    • pp.207-212
    • /
    • 2011
  • Vehicular Ad Hoc Network(VANET) is a communication technology between vehicles and vehicles(V2V) or vehicles and infrastructures(V2I) for offering a number of practical applications. Considering the importance of communicated information through VANET, data authentication, confidentiality and integrity are fundamental security elements. Recently, to enhance a security of VANET in various circumstances, message authentication is widely researched by many laboratories. Among of them, Zhang. et. al. is an efficient method to authenticate the message with condition of anonymity in dense space. In the scheme, to obtain the vehicular ID with condition of anonymity, the k-anonymity is used. However it has a disadvantage, which conducts hash operations in case of determining the vehicular ID. In the paper, we present a location based algorithm using received signal strength for the location based authentication and encryption technique as well, and to enhance the accuracy of algorithm we apply a location determination technique over the 3-dimensional space.

Effect of the Black-Hole Attack in Vehicular Ad-Hoc Networks

  • Mohamed Anis Mastouri;Salem Hasnaoui
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.8
    • /
    • pp.139-144
    • /
    • 2024
  • VANETs have become one of the most attractive research areas in the world of wireless networks in recent years. Indeed, vehicular networks have become capable of optimizing road traffic, which significantly reduces the number of accidents through notifications exchanged between nearby vehicles. The routing function based on the opportunistic algorithm is a critical part of the vehicle's communication system and will therefore be an ideal target for attacks that could aim to prevent alert messages from reaching their destination, and thus endanger human lives. The black hole attack is a major threat to the security of VANETs. The main idea of this paper focuses on the analysis of this type of attack in VANETs using Discrete-Time Markov Chains (DTMC). and deduce at the end the effect of the number of malicious nodes on the delivery rate in the network.

A New Approach Towards Aggregation in VANET

  • Hussain, Rasheed;Abbas, Fizza;Son, Junggab;Kim, Sangjin;Oh, Heekuck
    • Annual Conference of KIPS
    • /
    • 2013.11a
    • /
    • pp.214-217
    • /
    • 2013
  • Advancements in automobile industries and the communication technologies caused VANET (Vehicular Ad Hoc NETwork) to evolve to VANET-based clouds before its deployment. It is more likely that VANET clouds will replace the traditional VANET in the deployment phase. It is to be noted that an abrupt deployment is out of question because it would require mass of resources and money to do so; instead incremental deployment is more ideal. In this paper, we aim at the incremental deployment phase of VANET clouds and focus on the well-established public transport networks. Data aggregation is one of the essential aspects in traditional VANET and has been researched for quite long time. However the previously proposed schemes are still controversial. Keeping in mind the time and space prediction of public buses, we leverage these buses as potential aggregators and MG (Mobile Gateways) in VANET clouds. Buses gather cooperative whereabouts information from neighbors, aggregate that information, disseminate it to the neighbor MGs and also send it to the cloud for storage and for services exchange. In our proposed scheme, we believe that the dissemination will be effective and cover most of the urban area since at any instant of time; buses cover most part of the urban areas. Besides, the effective transmission range is higher due to tall buses.

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.

Prediction-Based Reliable Data Forwarding Method in VANET (차량 네트워크에서 예측 기반의 안정적 데이터 포워딩 기법)

  • Kim, Minho;Joo, Changhee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.128-139
    • /
    • 2017
  • Vehicular Ad hoc Network (VANET) is one of technologies to realize various ITS services for safe driving and efficient traffic control. However, data delivery in VANETs is complicated due to high mobility and unreliable wireless transmission. In this paper, we develop a novel forwarding scheme to deliver packets in a reliable and timely manner. The proposed forwarding scheme uses traffic statistics to predict the encounter of two vehicles, and optimize its forwarding decision by taking into consideration the probability of successful transmission between them at the encounter place. We evaluate our scheme through simulations and show that our proposed scheme provides reliable data delivery in VANETs.

Forwarding Protocol Along with Angle Priority in Vehicular Networks (차량 통신망에서 Angle 우선순위를 가진 Forwarding 프로토콜)

  • Yu, Suk-Dea;Lee, Dong-Chun
    • Convergence Security Journal
    • /
    • v.10 no.1
    • /
    • pp.41-48
    • /
    • 2010
  • Greedy protocols show good performance in Vehicular Ad-hoc Networks (VANETs) environment in general. But they make longer routes causing by surroundings or turn out routing failures in some cases when there are many traffic signals which generate empty streets temporary, or there is no merge roads after a road divide into two roads. When a node selects the next node simply using the distance to the destination node, the longer route is made by traditional greedy protocols in some cases and sometimes the route ends up routing failure. Most of traditional greedy protocols just take into account the distance to the destination to select a next node. Each node needs to consider not only the distance to the destination node but also the direction to the destination while routing a packet because of geographical environment. The proposed routing scheme considers both of the distance and the direction for forwarding packets to make a stable route. And the protocol can configure as the surrounding environment. We evaluate the performance of the protocol using two mobility models and network simulations. Most of network performances are improved rather than in compared with traditional greedy protocols.

A Secure Mobile Message Authentication Over VANET (VANET 상에서의 이동성을 고려한 안전한 메시지 인증기법)

  • Seo, Hwa-Jeong;Kim, Ho-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.5
    • /
    • pp.1087-1096
    • /
    • 2011
  • Vehicular Ad Hoc Network(VANET) using wireless network is offering the communications between vehicle and vehicle(V2V) or vehicle and infrastructure(V2I). VANET is being actively researched from industry field and university because of the rapid developments of the industry and vehicular automation. Information, collected from VANET, of velocity, acceleration, condition of road and environments provides various services related with safe drive to the drivers, so security over network is the inevitable factor. For the secure message authentication, a number of authentication proposals have been proposed. Among of them, a scheme, proposed by Jung, applying database search algorithm, Bloom filter, to RAISE scheme, is efficient authentication algorithm in a dense space. However, k-anonymity used for obtaining the accurate vehicular identification in the paper has a weak point. Whenever requesting the righteous identification, all hash value of messages are calculated. For this reason, as the number of car increases, a amount of hash operation increases exponentially. Moreover the paper does not provide a complete key exchange algorithm while the hand-over operation. In this paper, we use a Received Signal Strength Indicator(RSSI) based velocity and distance estimation algorithm to localize the identification and provide the secure and efficient algorithm in which the problem of hand-over algorithm is corrected.

Deciding Priority of Safety Messages using Decision Tree in IEEE 802.11p/1609.4 Vehicular Network (802.11p/1609 차량네트워크에서 Decision Tree를 이용한 안전메세지 우선순위 결정 기법)

  • Baik, Hyein;Kwon, YongHo;Rhee, Byung Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.794-797
    • /
    • 2015
  • As the interest in VANET is increased, a study on the beacon message transmission between vehicles is actively being made. IEEE 802.11p/1609.4 standard is based on a multichannel system consisting of multiple service channels (SCH) and a control channel (CCH). Multiple SCHs are defined for nonsafety data transfer, while the CCH is used to broadcast safety messages called beacons and control messages (i.e., service advertisement messages). However, most messages broadcast in the only one CCH belong to safety application that must be contested in dense vehicular network. This paper suggests safety message transfer algorithm in dense vehicular congestion. The proposed algorithm is that the priority of safety messages is decided by decision tree and messages are stored in proper queues according to their priorities. Then, safety messages with higher priorities are sent in turn by CCH in the assigned time. The proposed algorithm decreases the beacon transmission delay and increase on the probability of a successful beacon reception in an IEEE 802.11p/1609.4-based network.

  • PDF

A Range-based Relay Node Selecting Algorithm for Vehicular Ad-hoc Network (차량 애드혹 네트워크를 위한 영역 기반 릴레이 노드 선택 알고리즘)

  • Kim Tae-Hwan;Kim Hie-Cheol;Hong Won-Kee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.9 s.351
    • /
    • pp.88-98
    • /
    • 2006
  • VANET has several different characteristics from MANET such as high mobility of nodes and frequent change of node density and network topology. Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message broadcast protocol using range based relay node selecting algorithm which determines the minimal waiting time spent by a given node before rebroadcasting the received warning message. Because the time is randomly calculated based on the distance between sender node and receiver node, a node chosen as a relay node is assured to have a minimal waiting time, even though it is not located at the border of radio transmission range. The proposed emergency warning message broadcast protocol has low network traffic because it does not need to exchange control messages for message broadcasting. In addition, it can reduce End-to-End delay under circumstances of low node density and short transmission range in VANET.

Position-based Routing Algorithm for Improving Reliability of Inter-Vehicle Communication

  • Ryu, Min-Woo;Cha, Si-Ho;Koh, Jin-Gwang;Kang, Seok-Joong;Cho, Kuk-Hyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.8
    • /
    • pp.1388-1403
    • /
    • 2011
  • A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.