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

Search Result 149, Processing Time 0.025 seconds

Fuzzy Based Multi-Hop Broadcasting in High-Mobility VANETs

  • Basha, S. Karimulla;Shankar, T.N.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.165-171
    • /
    • 2021
  • Vehicular Ad hoc Network (VANET) is an extension paradigm of moving vehicles to communicate with wireless transmission devices within a certain geographical limit without any fixed infrastructure. The vehicles have most important participation in this model is usually positioned quite dimly within the certain radio range. Fuzzy based multi-hop broadcast protocol is better than conventional message dissemination techniques in high-mobility VANETs, is proposed in this research work. Generally, in a transmission range the existing number of nodes is obstacle for rebroadcasting that can be improved by reducing number of intermediate forwarding points. The proposed protocol stresses on transmission of emergency message projection by utilization subset of surrounding nodes with consideration of three metrics: inter-vehicle distance, node density and signal strength. The proposed protocol is fuzzy MHB. The method assessment is accomplished in OMNeT++, SUMO and MATLAB environment to prove the efficiency of it.

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

Secure and Efficient Traffic Information System Utilizing IPFS and Blockchain in Vehicular Ad-hoc Network (Vehicular Ad-hoc Network 환경에서 IPFS와 블록체인을 활용한 안전하고 효율적인 교통정보시스템)

  • Park, Hanwool;Heo, Gabin;Doh, Inshil
    • Annual Conference of KIPS
    • /
    • 2022.05a
    • /
    • pp.260-263
    • /
    • 2022
  • 현재의 교통정보시스템은 수집된 정보를 서버에서 가공하여 서비스하는 형태로 이루어져 있다. 이러한 형태는 네트워크 구성이 비교적 단순하고 유지관리 비용이 적게 든다는 장점이 있지만, 반면에 실시간성이 저하되고 보안이 제대로 보장되지 않을 수 있다는 문제가 있으며, 최근 많은 연구가 이루어지고 있는 VANET 환경에서의 교통정보시스템도 broadcast storm의 가능성을 안고 있다. 본 연구에서 제안하는 교통정보시스템은 자동차가 수집한 돌발 상황에 대한 데이터를 RSU(Road Side Unit)가 수신하고, 이후 메시지를 노드들에게 보낼 때 블록체인에 업로드함으로써 보안성과 broadcast storm 문제들을 해결할 수 있으며, raw data 를 IPFS 에 저장하여 시스템 고도화에 사용할 수 있어 참여자들이 교통 상황에 대해 신속하게 대응할 수 있도록 하는 장점을 갖는다.

Broadcasting Message Reduction Methods in VANET

  • Makhmadiyarov, Davron;Hur, Soojung;Park, Yongwan
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.4 no.1
    • /
    • pp.42-49
    • /
    • 2009
  • Most Vehicular Ad hoc Network (VANET) applications rely heavily on broadcast transmission of traffic related information to all reachable nodes within a certain geographical area. Among various broadcast approaches, flooding is the first broadcasting technique. Each node rebroadcasts the received message exactly once, which results in broadcast storm problems. Some mechanisms have been proposed to improve flooding in Mobile Ad hoc Networks (MANET), but they are not effective for VANET and only a few studies have addressed this issue. We propose two distance-based and timer-based broadcast suppression techniques: 15P(15percent) and slotted 15P. In the first (distance based) scheme, node's transmission range is divided into three ranges (80%,15%and5%). Only nodes within 15% range will rebroadcast received packet. Specific packet retransmission range (15%) is introduced to reduce the number of messages reforwarding nodes that will mitigate the broadcaststorm. In the second (timer-based) scheme, waiting time allocation for nodes within 15% range isused to significantly reduce the broadcaststorm. The proposed schemes are distributed and reliedon GPS information and do not requireany other prior knowledge about network topology. To analyze the performance of proposed schemes, statistics such as link load and the number of retransmitted nodes are presented. Our simulation results show that the proposed schemes can significantly reduce link load at high node densities up to 90 percent compared to a simple broadcast flooding technique.

  • PDF

MAC layer based cross-layer solutions for VANET routing: A review

  • Nigam, Ujjwal;Silakari, Sanjay
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12spc
    • /
    • pp.636-642
    • /
    • 2021
  • Vehicular Ad hoc Networks (VANET's) are gaining popularity in research community with every passing year due to the key role they play in Intelligent Transportation System. Their primary objective is to provide safety, but their potential to offer a variety of user-oriented services makes them more attractive. The biggest challenge in providing all these services is the inherent characteristics of VANET itself such as highly dynamic topology due to which maintaining continuous communication among vehicles is extremely difficult. Here comes the importance of routing solutions which traditionally are designed using strict layered architecture but fail to address stringent QoS requirements. The paradigm of cross-layer design for routing has shown remarkable performance improvements. This paper aims to highlight routing challenges in VANET, limitations of single-layer solutions and presents a survey of cross-layer routing solutions that utilize the information from the MAC layer to improve routing performance in VANET.

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)
    • /
    • v.11 no.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 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.

Routing Protocols for VANETs: An Approach based on Genetic Algorithms

  • Wille, Emilio C. G.;Del Monego, Hermes I.;Coutinho, Bruno V.;Basilio, Giovanna G.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.542-558
    • /
    • 2016
  • Vehicular Ad Hoc Networks (VANETs) are self-configuring networks where the nodes are vehicles equipped with wireless communication technologies. In such networks, limitation of signal coverage and fast topology changes impose difficulties to the proper functioning of the routing protocols. Traditional Mobile Ad Hoc Networks (MANET) routing protocols lose their performance, when communicating between vehicles, compromising information exchange. Obviously, most applications critically rely on routing protocols. Thus, in this work, we propose a methodology for investigating the performance of well-established protocols for MANETs in the VANET arena and, at the same time, we introduce a routing protocol, called Genetic Network Protocol (G-NET). It is based in part on Dynamic Source Routing Protocol (DSR) and on the use of Genetic Algorithms (GAs) for maintenance and route optimization. As G-NET update routes periodically, this work investigates its performance compared to DSR and Ad Hoc on demand Distance Vector (AODV). For more realistic simulation of vehicle movement in urban environments, an analysis was performed by using the VanetMobiSim mobility generator and the Network Simulator (NS-3). Experiments were conducted with different number of vehicles and the results show that, despite the increased routing overhead with respect to DSR, G-NET is better than AODV and provides comparable data delivery rate to the other protocols in the analyzed scenarios.

Robust Conditional Privacy-Preserving Authentication based on Pseudonym Root with Cuckoo Filter in Vehicular Ad Hoc Networks

  • Alazzawi, Murtadha A.;Lu, Hongwei;Yassin, Ali A.;Chen, Kai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6121-6144
    • /
    • 2019
  • Numerous privacy-preserving authentication schemes have been proposed but vehicular ad hoc networks (VANETs) still suffer from security and privacy issues as well as computation and communication overheads. In this paper, we proposed a robust conditional privacy-preserving authentication scheme based on pseudonym root with cuckoo filter to meet security and privacy requirements and reduce computation and communication overheads. In our proposed scheme, we used a new idea to generate pseudonyms for vehicles where each on-board unit (OBU) saves one pseudonym, named as "pseudonym root," and generates all pseudonyms from the same pseudonym. Therefore, OBU does not need to enlarge its storage. In addition, the scheme does not use bilinear pairing operation that causes computation overhead and has no certification revocation list that leads to computation and communication overheads. The proposed scheme has lightweight mutual authentication among all parties and just for once. Moreover, it provides strong anonymity to preserve privacy and resists ordinary attacks. We analyzed our proposed scheme and showed that it meets security and privacy requirements of VANETs and is more efficient than traditional schemes. The communication and computation overheads were also discussed to show the cost-effectiveness of the proposed scheme.

EZR: Expansive Search Zone Routing Protocol for Ship Ad Hoc Networks (선박 애드 혹 네트워크를 위한 확장탐색구역 경로배정 프로토콜)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.32 no.8
    • /
    • pp.1269-1277
    • /
    • 2008
  • Ships at sea cannot exchange data among them easily so far. Basically voice-oriented communication systems are the main methods, some of them utilize the HF radio systems at lower bit rates, and for higher bit rates, the Inmarsat or VSAT are adopted. None of them are used widely because of lower qualities and higher costs. There exist many technical and economical limits to have the Internet service just like on land such as the WWW service. In order to achieve the improved transmission rates of the maritime communication networks at farther sea, MANET(Mobile Ad Hoc Network) is one of the most practical models. In this paper, a new routing protocol named EZR (Expansive Search Zone Routing Protocol) is proposed, which is based on SANET (Ship Ad Hoc Network) model that has some different features from MANET and VANET (Vehicular Ad Hoc Network). The search zone for the shortest path is firstly found by EZR. If no path is searched in the zone, the zone is expanded according to the rule of EZR. The zone-expanding and path-searching procedures are repeated until the path is found out. The performance of EZR is evaluated and compared with LAR protocol which is one of the most typical routing protocols based on geographical information. The simulated results show that EZR is much better than LAR at sea environments in terms of routing success rate, route optimality, and a single index of performance combined the previous two metrics.