• Title/Summary/Keyword: Vehicular ad Hoc Network

Search Result 187, Processing Time 0.03 seconds

Performance Analysis of Ad-Hoc Network Protocols under Vehicular Communication Environments (차량 통신 환경에서 애드혹 네트워크 프로토콜의 성능분석)

  • Shin, Sung-Kwon;Kim, Doo-Yong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.6
    • /
    • pp.2234-2239
    • /
    • 2010
  • In this paper, the performance of ad-hoc wireless network protocols is analyzed under the vehicular communication environments. We estimate the throughput and delay of the protocols with packet sizes and various data traffics in expressways and metropolis by using QualNet simulator. It turns out that the performance of DSR protocol is better in expressways and the performance of AODV works well in metropolitan areas. Therefore, it is necessary that the proper protocols should be selected to provide the better performance according to the vehicular communication environments.

A Clustering Mechanism based on Vehicle Local Information in the Vehicular Ad Hoc Network (차량 애드혹 네트워크에서 차량 자체 정보를 기반으로 한 클러스터링 기법)

  • Ahn, Sang-Hyun;Lim, Yu-Jin
    • The KIPS Transactions:PartC
    • /
    • v.18C no.6
    • /
    • pp.445-450
    • /
    • 2011
  • In the vehicular ad hoc network environment, the clustering mechanism is one of the efficient mechanisms to deliver broadcast messages. Most clustering mechanisms require message exchanges between vehicles to build stable clusters, which causes overhead. In order to reduce this overhead, CF-IVC [1] proposes the mechanism to construct clusters based on the vehicle speed. However, since CF-IVC does not consider the road traffic condition and the driver's behavior, it may result in inefficient clusters. Therefore, in this paper, we propose a mechanism to establish efficient clusters based on the vehicle local information with considering the road maximum speed limit and the road traffic condition. The performance of the proposed mechanism is validated by comparing with those of the simple flooding and CF-IVC through NS-2 simulations.

Designing a Simulation Framework for Vehicular Ad hoc Network Applications (애드혹 네트워크 기반 교통 시스템을 위한 컴퓨터 모의실험 환경 설계)

  • Kim, Hyoung-Soo;Shin, Min-Ho;Nam, Beom-Seok;Lovell, David J.
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.6
    • /
    • pp.93-101
    • /
    • 2008
  • With a spread of mobile devices, the growing trend of integrating wireless communications technologies into transportation systems is advanced. In particular, vehicular ad hoc networks (VANETs) enable vehicles to share traffic information that they have through intervehicle communications. This research focused on the design of an integrated transportation and communication simulation framework to build an environment that is more realistic than previous studies developed for studying VANETs. Developing a VANET-based information model, this research designed an integrated transportation and communication simulation framework in which these independent simulation tools not supporting High Level Architecture (HLA) were tightly coupled and finely synchronized. As a case study, a VANET-based traffic information system was demonstrated based on a real road network and real traffic data. The experiment results showed that the simulation framework was well integrated. The simulation framework designed in this study is expected to contribute to developing the environment to experiment a wide range of VANET applications.

Authentication Scheme based on Biometric Key for VANET(Vehicular Ad hoc Network) (차량 애드 혹 망을 위한 생체 키 기반의 인증 기법)

  • Lee, Keun-Ho
    • Journal of Digital Convergence
    • /
    • v.10 no.11
    • /
    • pp.365-369
    • /
    • 2012
  • M2M has shown the advantages of better coverage and lower network deployment cost. Intelligent vehicle section shows severe changes in position between vehicles and has numerous large scales of networks in its components, therefore, it is required to provide safety by exchanging information between vehicles equipped with wireless communication function via biometric information in VANET(Vehicular Ad hoc Network). This thesis is to propose scheme that mutually authenticates between vehicles by composing vehicle movement as biometric information.

OBPF: Opportunistic Beaconless Packet Forwarding Strategy for Vehicular Ad Hoc Networks

  • Qureshi, Kashif Naseer;Abdullah, Abdul Hanan;Lloret, Jaime;Altameem, Ayman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2144-2165
    • /
    • 2016
  • In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.

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.

A Survey on Security Schemes based on Conditional Privacy-Preserving in Vehicular Ad Hoc Networks

  • Al-Mekhlafi, Zeyad Ghaleb;Mohammed, Badiea Abdulkarem
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.11
    • /
    • pp.105-110
    • /
    • 2021
  • Contact between Vehicle-to-vehicle and vehicle-to-infrastructural is becoming increasingly popular in recent years due to their crucial role in the field of intelligent transportation. Vehicular Ad-hoc networks (VANETs) security and privacy are of the highest value since a transparent wireless communication tool allows an intruder to intercept, tamper, reply and erase messages in plain text. The security of a VANET based intelligent transport system may therefore be compromised. There is a strong likelihood. Securing and maintaining message exchange in VANETs is currently the focal point of several security testing teams, as it is reflected in the number of authentication schemes. However, these systems have not fulfilled all aspects of security and privacy criteria. This study is an attempt to provide a detailed history of VANETs and their components; different kinds of attacks and all protection and privacy criteria for VANETs. This paper contributed to the existing literature by systematically analyzes and compares existing authentication and confidentiality systems based on all security needs, the cost of information and communication as well as the level of resistance to different types of attacks. This paper may be used as a guide and reference for any new VANET protection and privacy technologies in the design and development.

THERA: Two-level Hierarchical Hybrid Road-Aware Routing for Vehicular Networks

  • Abbas, Muhammad Tahir;SONG, Wang-Cheol
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3369-3385
    • /
    • 2019
  • There are various research challenges in vehicular ad hoc networks (VANETs) that need to be focused until an extensive deployment of it becomes conceivable. Design and development of a scalable routing algorithm for VANETs is one of the critical issue due to frequent path disruptions caused by the vehicle's mobility. This study aims to provide a novel road-aware routing protocol for vehicular networks named as Two-level hierarchical Hybrid Road-Aware (THERA) routing for vehicular ad hoc networks. The proposed protocol is designed explicitly for inter-vehicle communication. In THERA, roads are distributed into non-overlapping road segments to reduce the routing overhead. Unlike other protocols, discovery process does not flood the network with packet broadcasts. Instead, THERA uses the concept of Gateway Vehicles (GV) for the discovery process. In addition, a route between source and destination is flexible to changing topology, as THERA only requires road segment ID and destination ID for the communication. Furthermore, Road-Aware routing reduces the traffic congestion, bypasses the single point of failure, and facilitates the network management. Finally yet importantly, this paper also proposes a probabilistical model to estimate a path duration for each road segment using the highway mobility model. The flexibility of the proposed protocol is evaluated by performing extensive simulations in NS3. We have used SUMO simulator to generate real time vehicular traffic on the roads of Gangnam, South Korea. Comparative analysis of the results confirm that routing overhead for maintaining the network topology is smaller than few previously proposed routing algorithms.

An Efficient Algorithm to Reduce the Broadcast Storm in VANETS

  • Aziz Hanifi;Robab Hamlbarani Haghi
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.9
    • /
    • pp.162-168
    • /
    • 2024
  • VANET (vehicular ad hoc network) refers to the case networks designed for vehicles. Such networks are established among the vehicles which are equipped with communication tools. Within these networks, vehicles are regarded as the network nodes. On time and on schedule transmission of data is of high significance for these networks. In order to accomplish the objective of on-time data transmission, specific electronic equipment is embedded in each vehicle which maintains ad hoc communications among the passengers. Information about traffic, road signs and on-line observation of traffic status can be transmitted via these networks; such data makes it possible for the driver to select the best route to reach his destination. If there are not any infrastructures, two broadcasting approaches can be considered: overflowing and rebroadcasting. The overflowing approach leads to heavy traffic. Hence, the challenge we face is to avoid the broadcasting flood. In this paper, an approach for the management of the broadcasting flood is proposed based on fuzzy theory. The proposed method is assumed to have better performance and efficiency than any other approaches in terms of crash rate, the rate of message success and delay

A Study on Performance of Content Store Replacement Algorithms over Vehicular CCN (VCCN에서 Content Store 교체 알고리즘의 성능에 관한 연구)

  • Choi, Jong-In;Kang, Seung-Seok
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.1
    • /
    • pp.495-500
    • /
    • 2020
  • VANET (Vehicular Ad Hoc Network), an example of an ad hoc vehicular networks, becomes one of the popular research areas together with the self-driving cars and the connected cars. In terms of the VANET implementation, the traditional TCP/IP protocol stack could be applied to VANET. Recently, CCN (Content Centric Networking) shows better possibility to apply to VANET, called VCCN (VANET over CCN). CCN maintains several data tables including CS (Content Store) which keeps track of the currently requested content segments. When the CS becomes full and new content should be stored in CS, a replacement algorithm is needed. This paper compares and contrasts four replacement algorithms. In addition, it analyzes the transmission characteristics in diverse network conditions. According to the simulation results, LRU replacement algorithm shows better performances than the remaining three algorithms. In addition, even the size of CS is small, the network maintains a reasonable transmission performance. As the CS size becomes larger, the transmission rate increases proportionally. The transmission performance decreases when the network is crowded as well as the number of transmission hops becomes large.