• 제목/요약/키워드: Vehicular ad-hoc network

검색결과 184건 처리시간 0.029초

A Realistic Path Loss Model for Real-time Communication in the Urban Grid Environment for Vehicular Ad hoc Networks

  • Mostajeran, Ehsan;Noor, Rafidah Md;Anisi, Mohammad Hossein;Ahmedy, Ismail;Khan, Fawad Ali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권10호
    • /
    • pp.4698-4716
    • /
    • 2017
  • Wireless signal transmission is influenced by environmental effects. These effects have also been challenging for Vehicular Ad hoc Network (VANET) in real-time communication. More specifically, in an urban environment, with high mobility among vehicles, a vehicle's status from the transmitter can instantly trigger from line of sight to non-line of sight, which may cause loss of real-time communication. In order to overcome this, a deterministic signal propagation model is required, which has less complexity and more feasibility of implementation. Hence, we propose a realistic path loss model which adopts ray tracing technique for VANET in a grid urban environment with less computational complexity. To evaluate the model, it is applied to a vehicular simulation scenario. The results obtained are compared with different path loss models in the same scenario based on path loss value and application layer performance analysis. The proposed path loss model provides higher loss value in dB compared to other models. Nevertheless, the performance of vehicle-vehicle communication, which is evaluated by the packet delivery ratio with different vehicle transmitter density verifies improvement in real-time vehicle-vehicle communication. In conclusion, we present a realistic path loss model that improves vehicle-vehicle wireless real-time communication in the grid urban environment.

An Efficient Broadcast Technique for Vehicular Networks

  • Ho, Ai Hua;Ho, Yao H.;Hua, Kien A.;Villafane, Roy;Chao, Han-Chieh
    • Journal of Information Processing Systems
    • /
    • 제7권2호
    • /
    • pp.221-240
    • /
    • 2011
  • Vehicular networks are a promising application of mobile ad hoc networks. In this paper, we introduce an efficient broadcast technique, called CB-S (Cell Broadcast for Streets), for vehicular networks with occlusions such as skyscrapers. In this environment, the road network is fragmented into cells such that nodes in a cell can communicate with any node within a two cell distance. Each mobile node is equipped with a GPS (Global Positioning System) unit and a map of the cells. The cell map has information about the cells including their identifier and the coordinates of the upper-right and lower-left corner of each cell. CB-S has the following desirable property. Broadcast of a message is performed by rebroadcasting the message from every other cell in the terrain. This characteristic allows CB-S to achieve an efficient performance. Our simulation results indicate that messages always reach all nodes in the wireless network. This perfect coverage is achieved with minimal overhead. That is, CB-S uses a low number of nodes to disseminate the data packets as quickly as probabilistically possible. This efficiency gives it the advantage of low delay. To show these benefits, we give simulations results to compare CB-S with four other broadcast techniques. In practice, CB-S can be used for information dissemination, or to reduce the high cost of destination discovery in routing protocols. By also specify the radius of affected zone, CB-S is also more efficient when broadcast to a subset of the nodes is desirable.

VANETs의 보안을 위한 비정상 행위 탐지 방법 (An Anomaly Detection Method for the Security of VANETs)

  • 오선진
    • 한국인터넷방송통신학회논문지
    • /
    • 제10권2호
    • /
    • pp.77-83
    • /
    • 2010
  • 차량 애드 혹 망 (Vehicular Ad Hoc Networks: VANETs)은 일반적으로 이동성이 높은 차량 노드들로 구성되어 매우 짧은 시간 망 위상이 지속되므로 불안정한 통신 링크를 갖는 자기 조직화 P2P 망이다. VANETs은 고정된 인프라 구조나 중앙 통제 라우팅 장비 없이 자동적으로 망구조를 구성하고, 차량 노드들은 시간에 따라 고속으로 이동하며 망에 결합하거나 이탈하는 개방 망이므로 중앙 집중식 제어 없이 누구나 접속을 허용하기 때문에 망상에 해롭고 비정상 행위 노드들에 대한 침입에 매우 취약하다. 본 논문에서는 이러한 VANETs에서의 노드들의 활동에 대한 비정상 행위를 효율적으로 식별할 수 있는 러프집합기반 비정상 행위 탐지방법을 제안하고, 그 성능을 모의실험을 통해 임계 허용 오차에 대한 비정상 행위 탐지율과 거짓 경고율로 평가하였다.

도심환경에서의 안정적 경로 설정을 위한 VANET 라우팅 프로토콜 (A Study of Stable Route Decision Based on VANET Routing Protocol in Urban Environment)

  • 함우형;장상우;이상선
    • 한국ITS학회 논문지
    • /
    • 제11권3호
    • /
    • pp.70-80
    • /
    • 2012
  • 차량 간 고정 인프라 없이 자체적으로 네트워크가 형성되는 차량 애드-혹 네트워크, VANET(Vehicular Ad-hoc Network)은 네트워크의 토폴로지가 빈번하게 발생되는 특징을 가지고 있다. 또한 도심환경에서는 건물 등과 같은 전파방해 요인으로 인해 통신 단절 현상이 발생한다. 그러므로 VANET 환경에서는 이러한 취약점을 보완할 수 있는 라우팅 프로토콜이 필요하다. 본 논문에서는 차량의 위치정보를 통해 거리기반 브로드캐스트 방식을 이용하여 안정적인 경로 설정과 교차로에서의 전송 성능을 향상시킬 수 있는 알고리즘을 제안한다. 차량의 상대속도를 이용하여 경로 설정의 안정성을 도모하고 교차로에서의 우선순위 차등화를 통하여 패킷의 충돌을 최소화하는 동시에 전송률을 높인다. 도심지 환경을 재현한 시뮬레이션 결과 제안된 알고리즘이 기존의 알고리즘에 비해 전송률에서 우수한 성능향상을 보였다.

An Air-Interface for Ad Hoc Networks Supporting High Mobility

  • Lott, Matthias;Ebner, Andre;Meincke, Michael;Halfmann, Rudiger;Wischhof, Lars;Schulz, Egon;Rohling,
    • Journal of Communications and Networks
    • /
    • 제6권4호
    • /
    • pp.295-306
    • /
    • 2004
  • In this paper, a novel air-interface is presented for Fleet-Net1, a self-organizing network for inter-vehicle and vehicle-toroadsidecommunication. The air-interface is based upon the lowchip-rate version of UMTS/TDD. To adapt the cellular UMTS standard to an air-interface for ad hoc networks, changes of the physical layer, medium access control sub-layer and radio resource management are required. An overview of the required modifications is given here. Particularly, a decentralized synchronization mechanism is presented and analyzed by means of simulations. Furthermore, changes for the medium access control are explained in detail, which allow for an efficient operation in partly meshed networks and prioritization. Performance results of the overall system considering throughput and delay are derived by means of analytical evaluations and event-driven simulations. Based on realistic mobility models, it is shown that the presented solution provides a robust communication platform even in vehicular environments. The proposed air-interface is a cost-effective solution not only for inter-vehicle communication, but also for ad hoc networking in general, benefiting from the mass-market of UMTS.

VANET환경에서의 라우팅 프로토콜 성능 실험에 관한 연구 (A Study of Experiment on Routing Protocols Performance for VANETs)

  • 정종범
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2012년도 춘계학술발표대회
    • /
    • pp.481-484
    • /
    • 2012
  • 차로에서 차량의 많은 증가는 안전과 무선통신의 가용성에 대한 필요성을 높여 왔다. Vehicular ad hoc networks(VANETs)은 다양한 차량 어플리케이션을 위한 용도와 상용분야로의 개발을 점차적으로 해오고 있다. 차량 간의 효과적인 통신범위를 제공하기 위해서 최적화된 라우팅 프로토콜이 필요하다. 지금까지 목적지까지 최적의 경로를 찾는 mobile ad hoc networks(MANETs)를 위한 많은 기존의 프로토콜들이 존재한다. 본 논문에서는 두 개의 라우팅 프로토콜들을 비교함으로써 VANET 환경을 위한 프로토콜 개선방향을 제시하였다. Multicast Ad-hoc On-Demand Distance Vector(MAODV)[1][2] 라우팅 프로토콜의 솔루션은 목적지 대상으로 최적의 경로를 탐색함으로써 더욱 향상된 결과를 보여준다. NS-2[3]는 라우팅 프로토콜 실험을 수행하고 결과를 도출하는데 사용되어 왔다. 실험을 통하여 최적의 라우팅 프로토콜에 대한 연구방향 및 개선될 사항을 찾고자 한다.

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

  • 김률;주양익
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제40권9호
    • /
    • pp.830-835
    • /
    • 2016
  • 미국을 중심으로 상업용 무인비행체에 대한 규제가 명시된 조건하에 완화되어 관련 산업의 발전이 예상된다. 이에 따라 2017년에 미국에서 약 60만대에 이르는 무인비행체가 운용될 것으로 예상되지만 안전사고의 문제로 무인비행체의 자율 비행에 제약이 따른다. 이러한 문제를 해결하기 위해서 무인비행체의 충돌을 방지하고 경로를 탐색하는 연구가 진행되었으나, 경로 탐색 과정에서 상황에 따른 동적인 대처가 불가능하고 효율적인 경로 유도가 되지 못하는 단점을 가지고 있다. 따라서 본 논문에서는 해당 문제를 해결하기 위하여 차량 네트워크를 이용한 중앙관리방식의 무인비행체 경로 유도 시스템을 제안하고자 한다. 제안된 방식은 차량 통신용 네트워크가 경로 탐색의 주체가 되어 무인비행체를 데이터 패킷과 같이 라우팅의 대상으로 처리하여, 무인비행체가 직접 처리할 경로 탐색 과정을 줄이기 때문에 무인비행체의 에너지 효율성을 증가시킬 수 있고, 동일한 네트워크 내 무인비행체들의 전체적인 비행 흐름을 미리 파악하여 갑작스런 혼잡현상을 미연에 대비할 수 있으므로 무인비행체 라우팅 효율을 개선할 수 있다.

DTCF: A Distributed Trust Computing Framework for Vehicular Ad hoc Networks

  • Gazdar, Tahani;Belghith, Abdelfettah;AlMogren, Ahmad S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권3호
    • /
    • pp.1533-1556
    • /
    • 2017
  • The concept of trust in vehicular ad hoc networks (VANETs) is usually utilized to assess the trustworthiness of the received data as well as that of the sending entities. The quality of safety applications in VANETs largely depends on the trustworthiness of exchanged data. In this paper, we propose a self-organized distributed trust computing framework (DTCF) for VANETs to compute the trustworthiness of each vehicle, in order to filter out malicious nodes and recognize fully trusted nodes. The proposed framework is solely based on the investigation of the direct experience among vehicles without using any recommendation system. A tier-based dissemination technique for data messages is used to filter out non authentic messages and corresponding events before even going farther away from the source of the event. Extensive simulations are conducted using Omnet++/Sumo in order to investigate the efficiency of our framework and the consistency of the computed trust metrics in both urban and highway environments. Despite the high dynamics in such networks, our proposed DTCF is capable of detecting more than 85% of fully trusted vehicles, and filtering out virtually all malicious entities. The resulting average delay to detect malicious vehicles and fraudulent data is showed to be less than 1 second, and the computed trust metrics are shown to be highly consistent throughout the network.

Improved Paired Cluster-Based Routing Protocol in Vehicular Ad-Hoc Networks

  • Kim, Wu Woan
    • International journal of advanced smart convergence
    • /
    • 제7권2호
    • /
    • pp.22-32
    • /
    • 2018
  • In VANET, frequent movement of nodes causes dynamic changes of the network topology. Therefore the routing protocol, which is stable to effectively respond the changes of the network topology, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the frequent re-electing of the cluster header. In addition, the routing table of CBRP has only one hop distant neighbor nodes. PCBRP (Paired CBRP), proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. In the current CBRP, when the cluster header leaves the cluster the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster takes the role instead of the left cluster header. This means that this method reduces the routing delay. Concurrently, PCBRP reduces the delay when routing nodes in the paired cluster internally. Therefore PCBRP shows improved total delay of the network and improved performance due to the reduced routing overhead.

A Self-Authentication and Deniable Efficient Group Key Agreement Protocol for VANET

  • Han, Mu;Hua, Lei;Ma, Shidian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권7호
    • /
    • pp.3678-3698
    • /
    • 2017
  • With the rapid development of vehicular ad hoc Network (VANET), it has gained significant popularity and received increasing attentions from both academics and industry communities in aspects of security and efficiency. To address the security and efficiency issues, a self-authentication and deniable efficient group key agreement protocol is proposed in this paper. The scheme establishes a group between road side units (RSUs) and vehicles by using self-authentication without certification authority, and improves certification efficiency by using group key (GK) transmission method. At the same time, to avoid the attacker attacking the legal vehicle by RSUs, we adopt deniable group key agreement method to negotiation session key (sk) and use it to transmit GK between RSUs. In addition, vehicles not only broadcast messages to other vehicles, but also communicate with other members in the same group. Therefore, group communication is necessary in VANET. Finally, the performance analysis shows superiority of our scheme in security problems, meanwhile the verification delay, transmission overheard and message delay get significant improvement than other related schemes.