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

Search Result 184, Processing Time 0.029 seconds

Artificial neural network for safety information dissemination in vehicle-to-internet networks

  • Ramesh B. Koti;Mahabaleshwar S. Kakkasageri;Rajani S. Pujar
    • ETRI Journal
    • /
    • v.45 no.6
    • /
    • pp.1065-1078
    • /
    • 2023
  • In vehicular networks, diverse safety information can be shared among vehicles through internet connections. In vehicle-to-internet communications, vehicles on the road are wirelessly connected to different cloud networks, thereby accelerating safety information exchange. Onboard sensors acquire traffic-related information, and reliable intermediate nodes and network services, such as navigational facilities, allow to transmit safety information to distant target vehicles and stations. Using vehicle-to-network communications, we minimize delays and achieve high accuracy through consistent connectivity links. Our proposed approach uses intermediate nodes with two-hop separation to forward information. Target vehicle detection and routing of safety information are performed using machine learning algorithms. Compared with existing vehicle-to-internet solutions, our approach provides substantial improvements by reducing latency, packet drop, and overhead.

A Receiver-Driven Loss Recovery Mechanism for Video Dissemination over Information-Centric VANET

  • Han, Longzhe;Bao, Xuecai;Wang, Wenfeng;Feng, Xiangsheng;Liu, Zuhan;Tan, Wenqun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3465-3479
    • /
    • 2017
  • Information-Centric Vehicular Ad Hoc Network (IC-VANET) is a promising network architecture for the future intelligent transport system. Video streaming applications over IC-VANET not only enrich infotainment services, but also provide the drivers and pedestrians real-time visual information to make proper decisions. However, due to the characteristics of wireless link and frequent change of the network topology, the packet loss seriously affects the quality of video streaming applications. In this paper, we propose a REceiver-Driven loss reCOvery Mechanism (REDCOM) to enhance video dissemination over IC-VANET. A Markov chain based estimation model is introduced to capture the real-time network condition. Based on the estimation result, the proposed REDCOM recovers the lost packets by requesting additional forward error correction packets. The REDCOM follows the receiver-driven model of IC-VANET and does not require the infrastructure support to efficiently overcome packet losses. Experimental results demonstrate that the proposed REDCOM improves video quality under various network conditions.

A congestion control scheme estimating global channel busy ratio in VANETs

  • Kim, Tae-won;Jung, Jae-il;Lee, Joo-young
    • Journal of IKEEE
    • /
    • v.21 no.2
    • /
    • pp.115-122
    • /
    • 2017
  • In vehicular safety service, every vehicle broadcasts Basic Safety Message (BSM) periodically to inform neighbor vehicles of host vehicle information. However, this can cause network congestion in a region that is crowded with vehicles resulting in a reduction in the message delivery ratio and an increase in the end-to-end delay. Therefore, it could destabilize the vehicular safety service system. In this paper, in order to improve the congestion control and to consider the hidden node problem, we propose a congestion control scheme using entire network congestion level estimation combined with transmission power control, data rate control and time slot based transmission control algorithm. The performance of this scheme is evaluated using a Qualnet network simulator. The simulation result shows that our scheme mitigates network congestion in heavy traffic cases and enhances network capacity in light traffic cases, so that packet error rate is perfectly within 10% and entire network load level is maintained within 60~70%. Thus, it can be concluded that the proposed congestion control scheme has quite good performance.

Design of MAC Algorithm Supporting Adaptive Transmission Rate on VANET (VANET에서 적정 전송속도를 지원하는 MAC 설계)

  • Park, Sanghyun;Kim, Nam-Il
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.11
    • /
    • pp.132-138
    • /
    • 2012
  • VANET(Vehicular Ad-hoc Network), standardization of IEEE 802.11p specification is in process. 802.11 MAC protocol grants all nodes equal opportunity to acquire channel without regard to their bit-rates, making it possible for lower bit-rate nodes to occupy communication channel for a fair amount of time thus keeping the higher bit-rate nodes from acquiring connection channel which downward-equalize the overall network performance. Also with the 802.11p MAC protocol, the probability of collision occurring increases as the number of nodes grow. The proposed algorithm is a new MAC protocol that guarantees nodes with acquired channel a firm priority over other nodes for a fixed amount of time with TXOP concept added to 'packet burst' according to the current transmitting speed. This newly designed algorithm allows the construction of wireless network with enhanced network throughput, decreased probability of collisions as well as providing the means to grant each node a fair chance of acquiring connection according to their channel conditions. The algorithm sets the CW's (Contention Window) width wider than the standard's and modulates the continuous transmitting threshold value depending on channel acquired time, thus improving the overall performance of the network.

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 Competition-based Algorithm for Routing Discovery and Repair in Large-scale VANET

  • Wu, Cheng;Wang, Lujie;Wang, Yiming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5729-5744
    • /
    • 2017
  • Vehicular Ad Hoc Networks (VANET) in the large-scale road section usually have typical characteristics of large number of vehicles and unevenly distribution over geographic spaces. These two inherent characteristics lead to the unsatisfactory performance of VANETs. This poor performance is mainly due to fragile communication link and low dissemination efficiency. We propose a novel routing mechanism to address the issue in the paper, which includes a competition-based routing discovery with priority metrics and a local routing repair strategy. In the routing discovery stage, the algorithm uses adaptive scheme to select a stable route by the priorities of routing metrics, which are the length of each hop, as well as the residual lifetime of each link. Comparisons of different ratios over link length and link stability further show outstanding improvements. In the routing repair process, upstream and downstream nodes also compete for the right to establish repair process and to remain as a member of the active route after repair. Our simulation results confirm the improved performance of the proposed algorithm.

Operation and Analysis of WAVE-based Multi-Channel MAC Protocol (WAVE 기반 멀티채널 MAC 프로토콜의 동작원리 분석)

  • Jung, Jin-Uk;Kang, Woo-Sung;Jin, Kyo-Hong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.54-57
    • /
    • 2010
  • Vehicular Ad-hoc Network the core technology of ITS supports safety service or information service to driver and passenger on the roads utilizing V2V and V2I communication. WAVE, the standard of the vehicular ad hoc networks, adopts IEEE 802.11p as MAC protocol and includes the channel coordination algorithm to utilize multiple channels. However, this standard shows the problem related with QoS guarantee of urgent data for driver's safety and the limitation of the performance improvement. In this paper, we introduce WAVE-based Multi-channel MAC protocols that have proposed to resolve above problems and describe their features.

  • PDF

A Vehicle Communication Routing Algorithm Considering Road Characteristics and 2-Hop Neighbors in Urban Areas (도심 환경에서 도로의 특성과 2-홉 이웃 노드를 고려한 차량 통신 라우팅 알고리즘)

  • Ryu, Min-Woo;Cha, Si-Ho;Cho, Kuk-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.5B
    • /
    • pp.464-470
    • /
    • 2011
  • V2V (Vehicle-to-Vehicle) is a special kind of VANET (Vehicular Ad-hoc Network), which has high mobility and frequent topology changes and causes the link breakage problem. To resolve this problem, geographic routing protocols such as greedy forwarding are proposed. However, the greedy forwarding approach selects the node closest to the destination node as the transfer node within the transmission range so that it may cause many problems owing to many intersections and many changes in vehicular traffic in urban areas. The paper proposes a greedy perimeter urban routing (GPUR) algorithm considering the presence of 2-hop neighbor nodes and the road characteristics. Simulation results using ns-2 reveal that the proposed GPUR algorithm significantly reduces the routing error problem and the probability of local maximum than the existing routing protocols.

Clustering Technique of Intelligent Distance Estimation for Mobile Ad-hoc Network (이동 Ad-hoc 통신을 위한 지능형 거리추정 클러스터방식)

  • Park, Ki-Hong;Shin, Seong-Yoon;Rhee, Yang-Won;Lee, Jong-Chan;Lee, Jin-Kwan;Jang, Hye-Sook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.105-111
    • /
    • 2009
  • The study aims to propose the intelligent clustering technique that calculates the distance by improving the problems of multi-hop clustering technique for inter-vehicular secure communications. After calculating the distance between vehicles with no connection for rapid transit and clustering it, the connection between nodes is created through a set distance vale. Header is selected by the distance value between nodes that become the identical members, and the information within a group is transmitted to the member nodes. After selecting the header, when the header is separated due to its mobility, the urgent situation may occur. At this time, the information transfer is prepared to select the new cluster header and transmit it through using the intelligent cluster provided from node by the execution of programs included in packet. The study proposes the cluster technique of the intelligent distance estimation for the mobile Ad-hoc network that calculates the cluster with the Store-Compute-Forward method that adds computing ability to the existing Store-and-Forward routing scheme. The cluster technique of intelligent distance estimation for the mobile Ad-hoc network suggested in the study is the active and intelligent multi-hop cluster routing protocol to make secure communications.

An LV-CAST algorithm for emergency message dissemination in vehicular networks (차량 망에서 긴급 메시지 전파를 위한 LV-CAST 알고리즘)

  • Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.6
    • /
    • pp.1297-1307
    • /
    • 2013
  • Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet 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 collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.