• Title/Summary/Keyword: Density of Vehicular

Search Result 48, Processing Time 0.022 seconds

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.

A Zone based Routing algorithm for VANET (VANET 환경에서 구역 기반의 라우팅 알고리즘)

  • Lee, Seung-Hwan;Seok, Seung-Joon
    • Journal of Digital Convergence
    • /
    • v.10 no.9
    • /
    • pp.325-332
    • /
    • 2012
  • VANET(Vehicular Ad-hoc Network), which is a technology to create a network among vehicles, decides the route to the destination using information of neighbors within the transmission range as transmission nodes. The existing routing protocol which uses geographical information can cause delay and disconnection of the network when the density of nodes is not high enough to communicate because it only considers the distance of the relay nodes or destination nodes from the source nodes. To solve the problem, this dissertation suggests a routing algorithm based on zones for stable communications among vehicles in the environment of VANET. I minimize the packet loss rate by dividing the city environment into zones and taking into account not only the distance of the destination but also the density of vehicles to choose the best communications environment. This results in a better performance than the established research when the performance evaluation is implemented.

Measuring a Range of Information Dissemination in a Traffic Information System Based on a Vehicular ad hoc Network (Vehicular ad hoc network 기반 교통 정보 시스템에서 차량간 통신에 의한 정보 전달 범위 측정)

  • Kim, Hyoung-Soo;Shin, Min-Ho;Nam, Beom-Seok;Lovell, David J.
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.6
    • /
    • pp.12-20
    • /
    • 2008
  • Recent wireless communication technologies are envisioned as an innovative alternative to solve transportation problems. On ad hoc networks, as a wireless communication technology, nodes can communicate data without any infrastructure. In particular, vehicular ad hoc networks (VANETs), a specific ad hoc network applied to vehicles, enable vehicles equipped with a communication device to form decentralized traffic information systems in which vehicles share traffic information they experienced. This study investigated traffic information dissemination in a VANET-based traffic information system. For this study, an integrated transportation and communications simulation framework was developed, and experiments were conducted with real highway networks and traffic demands. The results showed that it took 3 minutes in the low traffic density situations (10 vehicle/lane.km) and 43 seconds in the high traffic density condition (40 vehicle/lane.km) to deliver traffic information of 5km away with 10% market penetration rate. In uncongested traffic conditions, information seems to be disseminated via equipped vehicles in the opposite direction. In congested traffic conditions, the sufficient availability of equipped vehicles traveling in the same direction reduces the chance to use vehicles in the opposing direction even though it is still possible.

  • PDF

A Message Broadcast Scheme using Contention Window in Vehicular Ad-hoc Network (차량 애드혹 네트워크에서 경쟁윈도우를 이용한 메시지 브로드캐스트 기법)

  • Kim, Tae-Hwan;Hong, Won-Kee;Kim, Hie-Cheol
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.423-434
    • /
    • 2007
  • Vehicular ad-hoc network (VANET), a kind of mobile ad-hoc network (MANET), is a key technology for building intelligent transportation system (ITS). VANET is automatically and temporarily established through vehicle-to-vehicle communication without network infrastructure. It has the characteristics that frequent changes of network topology and node density are occurred and messages are disseminated through several relay nodes in the network. Due to frequent change of network topology and node density, however, VANET requires an effective relay node selection scheme to disseminate messages through the multi-hop broadcast. In this paper, we propose a contention window based multi-hop broadcast scheme for VANET. Each node has an optimized contention window and competes with each other for a relay node. The experimental results show that the proposed scheme has a better performance than the distance-based deterministic broadcast scheme in terms of message propagation delay and network traffic.

Deep Reinforcement Learning-Based C-V2X Distributed Congestion Control for Real-Time Vehicle Density Response (실시간 차량 밀도에 대응하는 심층강화학습 기반 C-V2X 분산혼잡제어)

  • Byeong Cheol Jeon;Woo Yoel Yang;Han-Shin Jo
    • Journal of IKEEE
    • /
    • v.27 no.4
    • /
    • pp.379-385
    • /
    • 2023
  • Distributed congestion control (DCC) is a technology that mitigates channel congestion and improves communication performance in high-density vehicular networks. Traditional DCC techniques operate to reduce channel congestion without considering quality of service (QoS) requirements. Such design of DCC algorithms can lead to excessive DCC actions, potentially degrading other aspects of QoS. To address this issue, we propose a deep reinforcement learning-based QoS-adaptive DCC algorithm. The simulation was conducted using a quasi-real environment simulator, generating dynamic vehicular densities for evaluation. The simulation results indicate that our proposed DCC algorithm achieves results closer to the targeted QoS compared to existing DCC algorithms.

Design and evaluation of an alert message dissemination algorithm using fuzzy logic for VANETs

  • Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.4
    • /
    • pp.783-793
    • /
    • 2010
  • Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or propagate useful traffic information to other vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collisions at the link layer due to an excessive number of broadcast packets. We present a fuzzy alert message dissemination algorithm to improve performance for road safety alert application in Vehicular Ad-hoc Network (VANET). In the proposed algorithm, when a vehicle receives an alert message for the first time, the vehicle rebroadcasts the alert message according to the fuzzy control rules for rebroadcast degree, where the rebroadcast degree depends on the current traffic density of the road and the distance between source vehicle and destination vehicle. Also, the proposed algorithm is the hybrid algorithm that uses broadcast protocol together with token protocol according to traffic density. The performance of the proposed algorithm is evaluated through simulation and compared with that of other alert message dissemination algorithms.

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.

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.

CMS: Application Layer Cooperative Congestion Control for Safety Messages in Vehicular Networks

  • Lee, Kyu-haeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1152-1167
    • /
    • 2018
  • In this paper, I propose an application layer cooperative congestion control scheme for safety message broadcast in vehicular networks, called CMS, that adaptively controls a vehicle's safety message rate and transmit timing based on the channel congestion state. Motivated by the fact that all vehicles should transmit and receive an application layer safety message in a periodic manner, I directly exploit the message itself as a means of estimating the channel congestion state. In particular, vehicles can determine wider network conditions by appending their local channel estimation result onto safety message transmissions and sharing them with each other. In result CMS realizes cooperative congestion control without any modification of the existing MAC protocol. I present extensive NS-3 simulation results which show that CMS outperforms conventional congestion control schemes in terms of the packet collision rate and throughput, especially in a high-density traffic environment.

An Adaptive Relay Node Selection Scheme for Alert Message Propagation in Inter-vehicle Communication (차량간 통신에서 긴급 메시지 전파를 위한 적응적 릴레이 노드 선정기법)

  • Kim, Tae-Hwan;Kim, Hie-Cheol;Hong, Won-Kee
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.571-582
    • /
    • 2007
  • Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.