• Title/Summary/Keyword: Vehicular Ad-hoc Networks

Search Result 143, Processing Time 0.021 seconds

An Efficient Broadcast Scheme for Disseminating Emergency Message in Urban Vehicular Ad-Hoc Networks (도심의 차량 네트워크에서 긴급 메시지 전파를 위한 효율적인 브로드캐스트 기법)

  • Lee, Kyu-Chang;Han, Ki-Jun;Cho, Keu-Chul;Baek, Young-Mi;Kim, Jun-Hyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.7
    • /
    • pp.605-611
    • /
    • 2013
  • If an accident vehicle propagates emergency messages to other vehicles close to it, the other drivers may realize and avoid the accident spot. In this letter, we propose a broadcast scheme to propagate emergency messages fast in urban VANETs (Vehicular Ad-Hoc Networks) with the help of GPS (Global Position System). In our scheme, a transmitting vehicle chooses the farthest node as the next relay vehicle to propagate emergency messages. And, we suggest an algorithm for intersection recognition and SCF (Store-Carry-Forward) task by taking advantage of periodic hello packets to reduce the propagation time and enhance the delivery ratio.

Delay-Optimized Adaptive Multichannel Backoff Mechanism for VANET (VANET을 위한 지연 최적화 적응적 멀티 채널 백오프 메카니즘)

  • Lee, Jung-Jae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.837-844
    • /
    • 2019
  • In this paper, we propose the AMBM(: Adaptive Multi-channel Backoff Machisum) -Mac protocol to provide high throughput for non-safety applications in VANET(: Vehicular Ad Hoc Networks) environment. The proposed protocol guarantees the quality of service of non-safety packets by dynamically adjusting CW(: Channel Window) of WSA(: WAVE Service Advertisement) to maximize throughput between non-safety packets of different priority. It also shows that allocating a large amount of time for channel coordination and time slot reservation for SC and dynamically adjusting CW and CCI as nodes increase to reduces transmission delay than IEEE 1609.9, C-MAC(: Coordinated multi-channel MAC, and Q-VCI(: QoS Variable CCH Interval) protocols.

An Efficient Anonymous Authentication Scheme with Secure Communication in Intelligent Vehicular Ad-hoc Networks

  • Zhang, Xiaojun;Mu, Liming;Zhao, Jie;Xu, Chunxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3280-3298
    • /
    • 2019
  • Vehicular ad-hoc networks (VANETs) have become increasingly significant in intelligent transportation systems, they play a great role in improving traffic safety and efficiency. In the deployment of intelligent VANETs, intelligent vehicles can efficiently exchange important or urgent traffic information and make driving decisions. Meanwhile, secure data communication and vehicle's identity privacy have been highlighted. To cope with these security issues, in this paper, we construct an efficient anonymous authentication scheme with secure communication in intelligent VANETs. Combing the ElGamal encryption technique with a modified Schnorr signature technique, the proposed scheme provides secure anonymous authentication process for encrypted message in the vehicle-to-infrastructure communication model, and achieves identity privacy, forward security, and reply attack resistance simultaneously. Moreover, except the trusted authority (TA), any outside entity cannot trace the real identity of an intelligent vehicle. The proposed scheme is designed on an identity-based system, which can remove the costs of establishing public key infrastructure (PKI) and certificates management. Compared with existing authentication schemes, the proposed scheme is much more practical in intelligent VANETs.

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.

Advanced AODV Routing Performance Evaluation in Vehicular Ad Hoc Networks (VANET에서 Advanced AODV 라우팅 성능평가)

  • Lee, Jung-Jae;Lee, Jung-Jai
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.6
    • /
    • pp.1011-1016
    • /
    • 2020
  • Rapid change in network topology in high-speed VANET(: Vehicular Ad Hoc Network) is an important task for routing protocol design. Selecting the next hop relay node that affects the performance of the routing protocol is a difficult process. The disadvantages of AODV(: Ad Hoc On-Demand Distance Vector) related to VANET are end-to-end delay and packet loss. This paper proposes the AAODV (Advanced AODV) technique to reduce the number of RREQ (: Route Request) and RREP (: Route Reply) messages by modifying the AODV routing protocol and adding direction parameters and 2-step filtering. It can be seen that the proposed AAODV reduces packet loss and minimizes the effect of direction parameters, thereby increasing packet delivery rate and reducing end-to-end delay.

Performance Evaluation for a Unicast Vehicular Delay Tolerant Routing Protocol Networks

  • Abdalla, Ahmed Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.2
    • /
    • pp.167-174
    • /
    • 2022
  • Vehicular Ad hoc Networks are considered as special kind of Mobile Ad Hoc Networks. VANETs are a new emerging recently developed, advanced technology that allows a wide set of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). Delay Tolerant Networks (DTN) are networks that allow communication in the event of connection problems, such as delays, intermittent connections, high error rates, and so on. Moreover, these are used in areas that may not have end-to-end connectivity. The expansion from DTN to VANET resulted in Vehicle Delay Tolerant Networks (VDTN). In this approach, a vehicle stores and carries a message in its buffer, and when the opportunity arises, it forwards the message to another node. Carry-store-forward mechanisms, packets in VDTNs can be delivered to the destination without clear connection between the transmitter and the receiver. The primary goals of routing protocols in VDTNs is to maximize the probability of delivery ratio to the destination node, while minimizing the total end-to-end delay. DTNs are used in a variety of operating environments, including those that are subject to failures and interruptions, and those with high delay, such as vehicle ad hoc networks (VANETs). This paper discusses DTN routing protocols belonging to unicast delay tolerant position based. The comparison was implemented using the NS2 simulator. Simulation of the three DTN routing protocols GeOpps, GeoSpray, and MaxProp is recorded, and the results are presented.

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

Traffic Congestion Management on Urban Roads using Vehicular Ad-hoc Network-based V2V and V2I Communications (차량 애드혹 네트워크 기반 V2V와 V2I 통신을 사용한 시내 도로에서의 교통 체증 관리)

  • Ryu, Minwoo;Cha, Si-Ho
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.18 no.2
    • /
    • pp.9-16
    • /
    • 2022
  • The nodes constituting the vehicle ad hoc network (VANET) are vehicles moving along the road and road side units (RSUs) installed around the road. The vehicle ad hoc network is used to collect the status, speed, and location information of vehicles driving on the road, and to communicate with vehicles, vehicles, and RSUs. Today, as the number of vehicles continues to increase, urban roads are suffering from traffic jams, which cause various problems such as time, fuel, and the environment. In this paper, we propose a method to solve traffic congestion problems on urban roads and demonstrate that the method can be applied to solve traffic congestion problems through performance evaluation using two typical protocols of vehicle ad hoc networks, AODV and GPSR. The performance evaluation used ns-2 simulator, and the average number of traffic jams and the waiting time due to the average traffic congestion were measured. Through this, we demonstrate that the vehicle ad hoc-based traffic congestion management technique proposed in this paper can be applied to urban roads in smart cities.

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.