Contention Based Single‐Server Queuing Model for Efficient Data Transmission in <scp>VANETs</scp> Using Stochastic Process

ABSTRACT VANETs act as the central nervous system of the ITS. VANETs provides on‐the‐go wireless network services thereby supporting a wide variant of applications such as traffic safety and monitoring, environment and pollution management, emergency and disaster management and comfortainment based applications. VANETs are highly distinguished by the dynamic nature of nodes with varying speeds leading to frequent disconnections causing delay during data transmission. Therefore ensuring the connectivity between vehicles is a major problem which is needed to be addressed. This work attempts to alleviate the problem of delay in VANET communication by proposing a stochastic model to ensure multi‐hop connectivity between the nodes. The major novelty of the proposed model involves a contention based queuing model. The problem of congestion among cars to use RSUs for data transmission has been simulated to measure the network's efficiency. The simulation framework considers a highway environment to evaluate traffic flow. Collision between any two vehicles on the highway lanes causes a serious congestion leading to traffic jams, delays which deceases the operating efficiency of VANETs. To address this issue and enhance VANET performance, the M/M/1 queuing model is employed and assessed using metrics like end‐to‐end delay (E2E), waiting time, and the number of vehicles competing for multi‐hop connectivity. The performance analysis of the proposed system is analyzed using a scenario with 1000 vehicles per hour by varying traffic arrival rates (10, 20, 30, 50, and 100 vehicles/s), and a transmission rate of 10 Mbps. The Poisson Probability Distribution (PPD) and Binomial Distribution (BD) are utilized to validate the vehicle arrival and service rates. The result gives a significant reduction in E2E delay with the proposed method, achieving up to 30% improvement when compared with other existing systems under huge traffic. The waiting time distribution and queue length also demonstrated that minimizing the service rates based on traffic flow could further decrease delays. These improvements validate the efficiency of the contention‐based M/M/1 queuing model for multi‐hop communication in VANETs.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-11-20
DOI
https://doi.org/10.1002/cpe.70454
Primary Topic
Vehicular Ad Hoc Networks (VANETs)
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Contention Based Single‐Server Queuing Model for Efficient Data Transmission in VANETs Using Stochastic Process

P. Manoj Kumar, E Ismailkhan, R. Jeyachandhiran, S. Jayashree et al.
Concurrency and Computation Practice and Experience
Vehicular Ad Hoc Networks (VANETs)
article

Contention Based Single‐Server Queuing Model for Efficient Data Transmission in VANETs Using Stochastic Process

P. Manoj Kumar, E Ismailkhan, R. Jeyachandhiran, S. Jayashree, Y. Rajkumar
article en

Abstract

ABSTRACT VANETs act as the central nervous system of the ITS. VANETs provides on‐the‐go wireless network services thereby supporting a wide variant of applications such as traffic safety and monitoring, environment and pollution management, emergency and disaster management and comfortainment based applications. VANETs are highly distinguished by the dynamic nature of nodes with varying speeds leading to frequent disconnections causing delay during data transmission. Therefore ensuring the connectivity between vehicles is a major problem which is needed to be addressed. This work attempts to alleviate the problem of delay in VANET communication by proposing a stochastic model to ensure multi‐hop connectivity between the nodes. The major novelty of the proposed model involves a contention based queuing model. The problem of congestion among cars to use RSUs for data transmission has been simulated to measure the network's efficiency. The simulation framework considers a highway environment to evaluate traffic flow. Collision between any two vehicles on the highway lanes causes a serious congestion leading to traffic jams, delays which deceases the operating efficiency of VANETs. To address this issue and enhance VANET performance, the M/M/1 queuing model is employed and assessed using metrics like end‐to‐end delay (E2E), waiting time, and the number of vehicles competing for multi‐hop connectivity. The performance analysis of the proposed system is analyzed using a scenario with 1000 vehicles per hour by varying traffic arrival rates (10, 20, 30, 50, and 100 vehicles/s), and a transmission rate of 10 Mbps. The Poisson Probability Distribution (PPD) and Binomial Distribution (BD) are utilized to validate the vehicle arrival and service rates. The result gives a significant reduction in E2E delay with the proposed method, achieving up to 30% improvement when compared with other existing systems under huge traffic. The waiting time distribution and queue length also demonstrated that minimizing the service rates based on traffic flow could further decrease delays. These improvements validate the efficiency of the contention‐based M/M/1 queuing model for multi‐hop communication in VANETs.

Concurrency and Computation Practice and ExperienceVol. 37(27-28)
Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology (IN), Advanced Numerical Research and Analysis Group (IN), SRM University (IN), Saveetha University (IN)
Openalex Percentile: Top 65%
Vehicular Ad Hoc Networks (VANETs)
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.