You are currently viewing a new version of our website. To view the old version click .
Sensors
  • Article
  • Open Access

9 January 2023

A Novel Markov Model-Based Traffic Density Estimation Technique for Intelligent Transportation System

,
,
,
,
and
1
Faculty of Engineering Sciences & Technology, Hamdard University, Karachi 74600, Pakistan
2
College of Computing and Information Science, Karachi Institute of Economics and Technology, Karachi 75190, Pakistan
3
School of Computing, National University of Computer and Engineering Science (FAST-NUCES), Karachi 75030, Pakistan
4
Faculty of Computing & Informatics, Universiti Malaysia Sabah, Jalan UMS, Kota Kinabalu 88400, Sabah, Malaysia
This article belongs to the Special Issue Machine Learning Methods for Intelligent Transportation Infrastructure (ITI) Systems for Urban Environments

Abstract

An intelligent transportation system (ITS) aims to improve traffic efficiency by integrating innovative sensing, control, and communications technologies. The industrial Internet of things (IIoT) and Industrial Revolution 4.0 recently merged to design the industrial Internet of things–intelligent transportation system (IIoT-ITS). IIoT sensing technologies play a significant role in acquiring raw data. The application continuously performs the complex task of managing traffic flows effectively based on several parameters, including the number of vehicles in the system, their location, and time. Traffic density estimation (TDE) is another important derived parameter desirable to keep track of the dynamic state of traffic volume. The expanding number of vehicles based on wireless connectivity provides new potential to predict traffic density more accurately and in real time as previously used methodologies. We explore the topic of assessing traffic density by using only a few simple metrics, such as the number of surrounding vehicles and disseminating beacons to roadside units and vice versa. This research paper investigates TDE techniques and presents a novel Markov model-based TDE technique for ITS. Finally, an OMNET++-based approach with an implementation of a significant modification of a traffic model combined with mathematical modeling of the Markov model is presented. It is intended for the study of real-world traffic traces, the identification of model parameters, and the development of simulated traffic.

1. Introduction

Transportation plays a vital role in the daily lives of people. According to a prediction [1], by 2030 the amount of traffic in the world is going to increase by 60%. Significant research has been done in the area of intelligent transportation systems in recent years. By deploying advanced data communication technologies, ITS integrates information, communications, and other technologies and applies them in the field of transportation to develop an integrated system of people, roads, and vehicles. It is capable of establishing a huge, fully operational, real-time, accurate, and efficient transportation management system. Traffic flow, traffic density estimates, and traffic volume are the three main data investigation components in ITS. An intelligent transportation system needs real-time information, such as journey time, traffic density, and other factors, in order to make effective control decisions and provide reliable information to users. Figure 1 illustrates the three primary input data that ITS needs: traffic volume, traffic flow, and traffic density. Although the intelligent transportation technologies for various communication systems vary, all of them enable information to be sent based on the vehicle’s data in terms of various data-gathering aspects from the various sources, i.e., traffic flow, traffic volume, and traffic density methods, as shown in Figure 1. When people must spend a lot of time on the road due to traffic congestion, everyone’s lives are impacted. Researchers have been working on categorizing and evaluating traffic circumstances to find solutions to these traffic problems. Traditional traffic-management techniques, such as controlling traffic with wireless sensors, vehicle speed guns, roadside radars, and infrared counters, are ineffective at controlling congestion. The traffic density estimate, in contrast to traditional traffic systems, offers useful information in ITS, such as traffic control, traffic condition, and early prediction, to ease the problem of traffic congestion. Researchers proposed a framework based on these constraints, i.e., vehicles, people, and their external environments connected with associated sensors [2]. There are various simulation tools available for the processing and analysis of these attributes. Modern simulation tools were recommended by research work along with their features. The safety parameters of various commercially available simulation frameworks were discussed by the authors and are also covered in Table 1 of this paper. The authors concluded that a safety microsimulation model is required in heterogeneous traffic circumstances, especially in developing nations after discussing the tools’ advantages and disadvantages [3]. In intelligent transportation systems for traffic management and control, traffic density estimation is used as a form of automated measurement. ITS employs those metrics for the route planning, smart road transportation, proactive traffic regulation, street traffic control, network traffic synchronization, routing, and distribution. For the generation of early warning and autonomous signaling systems, precise measurements of traffic density are required. Intelligent transportation systems use three major classifications: microscopic, mesoscopic, and macroscopic. All these categories are further connected by two continuous and discrete approaches. Mesoscopic models combine both macroscopic and microscopic aspects, i.e., macroscopic and microscopic models. Data for these models are collected via one of three methods, as shown in the Figure 1.
Figure 1. Data-collection aspects of intelligent transportation system.
Table 1. Assessment of Simulation tools of TDE.

1.1. Traffic Flow

Traffic flow is the intersection between roadside units, travelers, and vehicles. This information will impact the intelligent transportation system. Road networks become intelligent when they can predict traffic flow over time, and this resonates with how we live our daily lives. This information attracts researchers from a wide range of domains, including science, statistics, engineering, and machine learning.

1.2. Traffic Density

Due to its inclusion in microscopic models, traffic density is a measurement that is frequently utilized in ITS. To improve the effectiveness of intelligent transportation systems, the computation of traffic density is a crucial component of predictions used for warnings of systems, roadside networks, and people. The capacity of the driver to choose routes is enhanced by this knowledge. Consequently, a variety of strategies are employed in TDE, as shown in Table 2. By using these methods, we evaluated the aforementioned dimension as shown in Figure 2. The procedures used in those methods were also described in Table 3, along with connected urban and highway scenarios, data-collection strategies, and the algorithms they had implemented for vehicles, which are more concentrated in urban areas with a higher population density than in highway areas with a dense population.
Table 2. Traffic density estimation techniques.
Figure 2. Taxonomy of Traffic density estimation techniques.
Table 3. Assessment of TDE methods.
Figure 3 illustrates how these methods for estimating traffic density are based on three different proportions: conventional methods, mathematical models, and machine learning models. It shows how various TDE methods are distributed. The TDE approaches, which were based on the method used to estimate traffic density, are further explained in the Figure 3. However, these methods were created to estimate traffic density for a number of purposes and applications. Applications that employ density estimation techniques fall into three categories: conventional, mathematical, and machine learning methods.
Figure 3. Distribution of TDE Techniques.

1.3. Traffic Volume

Traffic volume is a way by which the volume of traffic or number of cars traveling on a road section at a specific period of time can be found. There are numerous volumes studied in traffic engineering, including daily volume, hourly volume, and peak hour volume. Additionally, the volume of a day or hour might change significantly based on the day of the week or the hour of the day.

1.4. Research Questions

The following is how the research questions for the studies are put together.
  • What are the dimensions used for identifying traffic density estimations?
  • What evaluation tools are available for analyzing suggested methods?
  • How do TDE algorithms analyze various traffic behaviors to process the road network?
  • How to choose a suitable approach to investigate an efficient traffic analysis technique?
There are several ways by which to estimate traffic; however the techniques employed nowadays are more useful and frequently involve ML-recognized algorithms, which are typically used for real-time estimations. The Background section of Table 1, Table 2 and Table 3 includes a full explanation of the answers to the aforementioned questions.
We present the concept of a Markov approach for estimating traffic density in the road model and mathematical explanation, which illustrates the behavior of a single vehicle and depicts the traffic on the entire road network. We use the microscopic traffic simulator SUMO to build a traffic network with stochastic traffic demand and real values for traffic density in order to assess the effectiveness of the Markov traffic model. The SUMO-generated traffic demand is provided to the Markov traffic model, and the link state will change to the mode with the highest transition probability on each iteration. Because traffic conditions might fluctuate from day to day, it is highly convenient to estimate future traffic conditions based on initial traffic conditions. Due to the simplicity of this model, once it has been expanded, the public can use it to investigate traffic estimation on their local road network. The counts of each type of vehicle accessing a road segment are also shown as nodes 0, 1, 2, 3, and 4. The study’s main goal was to create an effective traffic analysis model that could be used to simulate traffic in a system of roads. To depict the traffic system, mathematical traffic flow models are also typically utilized. They are mathematical descriptions of the complicated traffic systems used to characterize and predict traffic behavior in the future. This research aims to develop a Markov-based mathematical method for estimating density in mixed traffic conditions.

1.5. Motivation and Contribution

Vehicles increased traffic in cities enormously. These produce traffic bottlenecks, which cause air pollution, personal health issues, lost productive labor time, and economic losses. Because of this, and considering the inconvenience that traffic causes, managing traffic with intelligent systems and technology is necessary. As traffic density on a route is an excellent indicator, quick and reliable real-time estimation of traffic density is critical for traffic control. This research is being carried out by employing intelligent technologies to estimate traffic density. By utilizing the current traffic state as well as mathematical modeling based on the Markov process to predict the future traffic state while taking into consideration a predetermined road structure with a minimum of 0–4 vehicles and a length of 1 km that is connected to a distinctive roadside unit. In contrast to statistical analysis, these systems use artificial intelligence to determine traffic density. These are equipped with traffic data and used to estimate the traffic in real time. In this research, different types of conventional methods are compared, and a novel framework is proposed to examine the usefulness, appropriateness, and robustness of the proposed framework, which is analyzed through simulations.
The structure of this essay is as follows: The backdrop of the research findings is presented in Section 2. In Section 3, a model for estimating traffic densities by using mathematical modeling was proposed. In Section 4, model simulations are carried out. We established a vehicle tracking in Section 5, and the results of such tracking are shown in Section 6. Section 7 presents the findings and related discussion. Future research directions are presented in Section 8 as the paper’s conclusion.

3. Proposed Model

The development of the IIoT and the use of ITS necessitate a series of procedures for architectural communication. This model depicts the V2X architecture in its entirety. Each vehicle has an onboard unit (OBU) equipped with wireless communication capabilities. The OBU, in particular, provides the interfaces required to estimate vehicle density by using data obtained via node to infrastructure communications. Infrastructure equipment, such as RSUs, is necessary to implement the V2I component of our system. Vehicles will benefit from RSUs in particular by receiving updated services. Additionally, the location of RSUs enables the cars to communicate with one another. A block diagram of the proposed model is shown in Figure 4. In this schematic block diagram, we have two communication modes i.e., V2I and V2V. That is the reason we have two blocks of vehicle in the diagram. Figure 4 depicts the vehicles’ behavior by using a flowchart. The data collected from the actuators and sensors is sent to the vehicle, and the vehicle transfers this information to the RSU for further processing and to other cars within the range. Through V2I and V2V communication, vehicles will transmit and receive messages or beacons with the same event ID from the roadside unit and neighboring vehicles.
Figure 4. Schematic block diagram of proposed model.
Figure 5 shows the proposed ITS system’s components: transportation management centers (i.e., control units (CU), field equipment (e.g., radio towers, wifi connectivity, and mobile equipment connected to vehicle movement), vehicles equipped with ITS equipment (e.g., buses, commuter trains, and cars all represent logistics in industrial 4.0), and traveler equipment (e.g., mobile devices) that meets the stakeholder needs. The phones transmit their location data to the mobile phone network regularly. As the car moves, the mobile phone signal acts as a probe. The probe data is provided by the onboard mobile unit, which is connected to the sensors and actuators. Roadside units (RSU) collect data from each vehicle, including traffic congestion and the vehicle’s location. This information will be sent by the RSU to the control unit, which calculates the estimation. A RSU is a transceiver for dedicated short-range communications (DSRC) positioned across a road. This model enables V2V and V2I communication, as well as the collection and exchange of data between vehicles and roadside infrastructure. Vehicles, on the other hand, can be aware of the number of vehicles in their vicinity, because although RSUs can supplement their information on traffic distribution with density information given by vehicles.
Figure 5. Proposed model with V2I communication.

Markov-Based Mathematical Modeling

Markov is a mathematical model for understanding the process of creating evaluation state sequences at random. Currently, Markov acts as a very robust and heuristic for matching state sequences that are consistent with the randomness, uncertainty, and complexity of actual transportation systems. This is owing to the increasing expansion of big data and machine learning. The Markov is an illustration of a discrete-time stochastic process. In such processes, the probability of every future event depends only on the current state and is independent of the states that came before. Markov chains are used in a wide range of scenarios because they can be built to model various real-world processes. For their useful properties such as states, i.e., state transitions. It consists of a set of states and the conditional probabilities of their transitions from one state to another state. Markov provides a long-run probability for traffic estimation. In a Markov model, the system’s future behavior is based only on the present. Therefore, it is highly appropriate for us to predict the traffic condition with Markov. Many authors worked on Markov for the future prediction as [1,47,48,49,50]. This is due to the fact that the Markov model predicts that the conditional probability does not change over the passage of time. This model is the only stationary vehicle distribution on the road network. The model’s significance is that it can estimate the probability of a state being in a given traffic congestion state depends only on the current state. The model provided successfully calculates the probabilities of a specific road section being in a given state of traffic congestion for traffic density. As benchmarks, some stochastic process models have been proposed. The authors of paper [48] suggested an analytical method for estimating traffic delays at unsignalized intersections with Markov process. Coupled HMMs were deployed by the authors of [1] to simulate freeway traffic and estimate the traffic speed.
A hidden Markov model based method also used to address the density estimation on a multilane road segment in [49,50]. In another study, the authors overcome the limitations of adaptive K-means clustering and use the pattern by using regression models. In this study, the Markov model was employed to identify traffic patterns to predict the congestion [51,52]. We proposed the Markov approach because it does not require a lot of data, and it can predict the future state by using only the data from the current state. Whenever one event’s occurrence has no effect on the probability of the other event occurring, two events are said to be independent. This model’s aim is to predict when and where there will be heavy traffic in a traffic network. The model’s reliance is on specific traffic segments rather than specific vehicles or traffic flow. Suppose that the probability of the transition for the state i to the state j is the transition probability from the state i at the time n to state j at the time n + 1 for every pair of states i and j is represented as. X i is the observed variable for present and future states and describes the system’s dynamic behavior.
P n , i , j = P r ( X ( n + 1 ) = j | X ( n ) = 1 )
Here, the Markov states with respect to time can be stated as follows:
X ( t 1 ) X ( t 2 ) X ( t 3 ) X ( t 4 )
Equation (2) represents the current and future states. The movement of time t 1 to time t 2 , is only dependent on the last previous state, i.e., only the current connected state. Therefore, the state equation for traffic density for projected vs. actual traffic conditions also provides the real time information, as shown in Equation (3).
T D ( i , j ) = X ( t ) + X ( t + 1 ) X ( t + 2 )
We designed a scenario that calculates the traffic density with its location and mobility as well as traffic flow. Due to the mobility path loss model that is also used in it, in Equation (4), a communication link is defined for one vehicle. We have
T D ( p l ) = 1 , p l p 0 0 , p l p 0
where T D ( p l ) represents the probability of connection between the cars, and p l is the path loss from the measured data. Path loss can be calculated based on the distance between the vehicle and the roadside unit, p 0 is a benchmark for path loss. If p l is less than p 0 , connections are established successfully; otherwise, connections are unsuccessful. The relationship between T D a v g and traffic flow T D f is shown in Equation (5) for 1 km of road length. We have
T D a v g ( 1 km ) = T D f 1 T D m i n T D m a x
where T D a v g is the average speed of traffic, T D f is the flow of traffic, and T D m a x is threshold density, which is assuming 25 vehicles per km. To develop the Markov-based traffic density equation, we assumed that the flow (volume) of traffic on the road is 25 vehicles per unit time. This assumption enabled the development of the model to calculate traffic density in terms of the Markov approach. The minimal value, or T D m i n , is the least possible value. The density of estimation T D a v g is subject to Bernoulli distribution as shown in Equation (6):
T D a v g = 1 P T D f 1 T D m i n T D m a x .
The mutual exclusion of a few vehicle types is also done in this modeling; we have excluded bikes from the traffic density calculation from the range of 1 km as shown in the Equation (7):
T D a v g b = P b i k b | T D a v g b = ( 1 T D m i n ) b i k b 1 T D m a x
T D a v g b is the mutually exclusive event of the bike, and is the probability of the bike over T D a v g b .
The probability of TD with discrete time Markov chain with interval indexes is t = 0 , 1 , 2 , 3 , n . Consequently, the Markov property is shown in Equation (8):
P ( T D ( t n ) ) = x n | X ( t n 1 ) = X n 1
The multistep transition probability of the Markov chain model is shown in Equation (9):
P ( X n + 2 | X n + 1 ) ) P ( X n + 1 | X n ) ) d X n + 1
According to the Markov chain property for the finite state is shown in Equation (10):
π = π p
Finally, calculating the traffic density using a Markov chain model can be calculated by using Equation (11).
T D a v g = T D f × π
Equations (1)–(3) and (8)–(10) are the general description of Markov property and Equations (4)–(7) are derived for traffic density.

4. Model Simulation

OMNET (Available at https://omnetpp.org, accessed on 30 October 2022) is used in a V2I environment in conjunction with the simulation of urban mobility (SUMO), available at https://www.eclipse.org/sumo, accessed on 30 October 2022) to establish communication. The map is selected initially, and is followed by the number of vehicles as well as the route. The network is imported from the OpenStreetMap (OSM) database. This map covers an approximate area. This dataset is exported to SUMO and then imported into Omnet++ to the Cologne map. The display and storage of map data is supported by a simple and powerful idea. We used the road traffic simulator SUMO to generate vehicular traces, and then we examine the connectedness of the vehicular network. The network is then populated with random traffic. We assume the conception of a “node”, by considering any vehicle as the general vehicle in which communication passes from RSU to node, node to RSU, and from one node to another node. However, associating vehicle detection with a sequence of consecutive frames is achievable. Vehicles start moving immediately and can stop by any traffic light triggered at a particular position from where the RSU transmits a message to vehicles regarding the traffic jam.
According to the proposed model in Section 3, various IoT devices are interconnected with each other in a simulation environment, as shown in Figure 6a–c, vehicles communicate messages to other vehicles shown in Figure 6b, as well as to RSU Figure 6c. The RSU can send a message to all vehicles in his zone as shown in Figure 6a. Based on RSU analysis, Signals are transferred to the control unit for data transmission. The control unit receives information from different RSUs and sends it to other RSUs in its region, e.g., RSU to node, node to node, node to RSU, and RSU to CU as mentioned in Figure 6a–c. These Figure 6a–c are based on the vehicle’s ability to interact with the infrastructure and conversely. Communication takes place between vehicles dependent on whether they are within or beyond the coverage area of which roadside equipment. RSUs based on LTE are considered fixed units, whereas cars are considered dynamic modules. In these figures, each vehicle can communicate with RSU throughout its given traveling time.
Figure 6. Communication modes. (a) Communication from RSU to node. (b) Communication from node to node. (c) Communication from node to RSU.
Figure 7 shows the imported map interface with SUMO for vehicles’ routes. A map can be generated to create an environment simulating road traffic in a real-world route by using the OpenStreetMap (OSM) (available at https://www.openstreetmap.org, accessed on 30 October 2022) is a collaborative initiative that allows anyone to contribute to the creation of a free map of the world. The data is made available under the terms of the Open Data Commons Open Database License (ODbL) (available at https://opendatacommons.org/licenses/odbl, accessed on 30 October 2022). A simple yet powerful concept underpins the display and storage of map data. We started with the OSM map from Porto (Porto is the second largest city in Portugal), and created a graph which used the same region of interest as the dataset filtered. The nodes in the graph are specific nodes from the OSM file. Only certain sorts of way nodes could be collected after we ran a filter on the OSM dataset, because only needed nodes that could be reached by vehicle.
Figure 7. Imported map interface with SUMO for vehicles’ routes.
Figure 8 shows the simulation scenario environment in OMNET++ with results. OM-NET++ is used in order to simulate mentioned scenario in realistic wireless communication scheme. SUMO and OMNET++ is integrated into the framework veins. Initially, traffic-related vehicle information (such as start time and location, stop time and position, origin, destination, maps, etc.) is generated in SUMO, then imported to OMNET++. In the network simulator, all vehicles are considered nodes. Veins modify the scenario of the automobile in OMNE++ if any modifications are made to SUMO and vice versa.
Figure 8. Simulation scenario on OMNET++.
Table 4 shows the events during the specified time duration with Beacon ID and packet ID used in OMNET as packet recognition. There are five nodes (vehicles) used in this simulation. Various nodes of communication are employed. For the proof of concept, we create our setup with five nodes, the limitation of our technique is that we have only employed a small number of nodes; in future work, we can use more nodes. On each node, an application is running to generate packets at regular intervals. The reason for the minimal number of nodes is that more nodes will send more acknowledgments to the infrastructure and to the other nodes, whereas a higher number of nodes will take more time and there will be more waiting to conduct and transfer the data to the control unit and send it in order to avoid collisions for the proposed implementation. We have considered five nodes from a 250-s time for two roadside units. If we consider more vehicles, we would have to add more road length with the more RSUs for a specified communication range and other components as well. There is no fixed point for nodes. We can increase the number of nodes by increasing all parameters. The parameters associated with the characteristics are the primary concerns of the performance analysis. In this scenario experiment, these parameters are used, and they are displayed in Table 5. Each experiment set’s simulation time is 250 s for the five nodes. Many vehicles and road attributes, including the list of lanes in the scenario, the form of the lane, the edge ID holding a specific lane ID, the length of the lane, the maximum speed allowed by the lane, and the mean speed allowed by the lane, can be accessed or updated by using TraCI.
Table 4. Results of Markov based TDE.
Table 5. Simulation parameters.

5. Vehicle Tracking

Tracking of vehicles is obtained by considering the speed, position, and direction in a highway scenario. SUMO is used to implement and track vehicles. We have considered some parameters for tracking, i.e., vehicle position, and speed fluctuations of each vehicle; it also simulates the acceleration of each vehicle. At the same time, the number of beacons is sent to the RSU from each node when traveled within the RSU range with a fixed time interval. The parameters associated with the characteristics are the primary concerns of the performance analysis. In this scenario experiment, these parameters are used, and they are displayed in Table 5. Each experiment set’s simulation time is 250 s for the five nodes. Many vehicle and road attributes, including the list of lanes in the scenario, the form of the lane, the edge ID holding a specific lane ID, the length of the lane, the maximum speed allowed by the lane, and the mean speed allowed by the lane, can be accessed or updated by using TraCI. TraCIScenarioManager and TraCIMobility modules of veins has the ability to run traffic simulation. To implement vehicle tracking additional commands in TraCICommandInterface.cc, TraCIMobili-ty.h files are used. Following are the commands used in simulation.
B e g i n
T r a C I C o m m a n d I n t e r f a c e ( )
V A R T R A C K V E H I C L E v a r i a b l e I d ;
T r a C I B u f f e r b u f = c o n n . Q u e r y ( C M D S E T G U I V A R I A B L E , T r a C I B u f f e r ( ) , v a r i a b l e I d ,
n o d e I d )
A S S E R T ( b u f . e o f ( ) )
E n d
B e g i n
c o m m a n d T r a c k V e h i c l e ( )
g e t c o m m a n d I n t e r f a c e . s e t V e h i c l e T r a c k i n g . g e t E x t e r n a l I d ( ) )
E n d
We investigate the tracking of five vehicles on a real road network, as shown in Figure 9a–e as (node/flow 0.1–0.4). Specific items can be chosen to track associated parameters, such as a vehicle’s current route, position, or speed. Each vehicle is tracked in its own time by articulating it in circles independently. The individual circle on the vehicle is constantly tracking along the journey.
Figure 9. Tracked vehicles in SUMO. (a) Tracked vehicle 0 in SUMO as node 0.0. (b) Tracked vehicle 1 in SUMO as node 0.1. (c) Tracked vehicle 2 in SUMO as node 0.2. (d) Tracked vehicle 3 in SUMO as node 0.3. (e) Tracked vehicle 4 in SUMO as node 0.4.

6. Tracking Results

In this evaluation, number of tracked vehicles calculated from the number of messages transferred between vehicles to the road side units. All the five vehicles are routed through the same route. In order to achieve the highest tracking accuracy, we selected the maximum continuous tracking time as a measure. The tracker first builds a traffic lane for beacons that shows throughout the scan. Then, by following intervals, it allocates beacons to the established routes and may initiate new tracks. The high peak tracking duration percentages are utilized as a tracking accuracy metric. The tracking system automatically builds a set of tracks for beacons that appear throughout the scan. Then, in following time steps, it distributes beacons to the established tracks and initiate new tracks. Vehicles are classed into a variety of groups based on their speed vectors. As a result of the tracking, it simulates the acceleration, vehicle position, and speed fluctuations of each vehicle. Because we consider monitoring and tracking on each vehicle, the tracked vehicle maintains a steady speed on the highway. The vehicle’s speed is the primary parameter that governs its dynamics.
The graph in Figure 10a–e depicts the relation between individual vehicle speed and time. The speed of the tracked vehicle reduces substantially as tracking increases. On either side, the value of speed is low, so there is a high likelihood of successful tracking as shown in the figures.
Figure 10. Speed graphs of Vehicles. (a) Vehicle 0 Speed; (b) Vehicle 1 Speed; (c) Vehicle 2 Speed; (d) Vehicle 3 Speed; (e) Vehicle 4 Speed.
Table 6 illustrates the differences in the number of vehicles generated for the highway scenario. The three methods further achieve a stable output for the mean vehicle acceleration with a standard deviation. VACaMobil [53] is used to create the network with the necessary number of vehicles. It also includes the specific min and max number of vehicles by using the standard deviation feature, as these vehicles are the primary simulation objects and have numerous attributes, such as the current speed, position, and acceleration. Table 6 values represent the average number of vehicles, their standard deviation, and their continuation over the simulation time.
Table 6. Traffic Contribution.

7. Results and Discussion

In this work, we investigate the modeling of traffic density by using the Markov model approach. Moreover, we successfully implemented our model in the SUMO simulation environment by using Omnet++ with the vein’s framework (available at https://veins.car2x.org/download/, accessed on 30 October 2022) that is linked and evaluated for the model’s functionality. Moreover, it enables the implementation of dynamic broadcast propagation techniques, thereby enhancing the communication capacities of vehicle networks. The proposed architecture makes it possible to use effective ways to reduce traffic congestion because it makes easy for cars to act quickly. Moreover, this makes it possible to use model-based broadcast propagation techniques, which improves the ability of vehicle networks to communicate with cellular. The number of cars in this implementation moving in a range of one roadside units’ network that is represented in Figure 8. Figure 6a–c shows the numbers of nodes (cars) enters the simulation environment one by one. The simulation is set up with a fixed number of five cars, and it finishes when the simulation time reaches the given 250 s, as seen in the Figure 11 and Figure 12, which show the number of beacons sent vs. simulation time and number of vehicles vs. simulation time, respectively. These figures depict the amount of time spent in execution that was required to complete the 200-s simulation. We allowed the simulation of the allocated amount of time to run, during which we monitored the number of packets or events that were generated in the designated area, as well as the relationship between the rate of time spent running the simulation and the total number of nodes. Once the beacon has entered the region, all of the nodes in the immediate vicinity will restart sending beacons at a rate of once every second for the duration of the simulation. An arrangement of this aims to establish whether or not the simulation framework is able to continue operating despite the presence of the produced traffic. In this simulation scenario, vehicles travel on premeditated roads determined by SUMO (the model treats all nodes identically) and vehicles that move at unpredictable speeds. The node moves from one spot to another with variable speed and in the same direction as all other nodes. Each entity has a mobility submodule that is in charge of node movement. The movement direction is determined by the various road directions of the node’s beginning place. VACaMobil compares the current number of cars in the simulation to the goal number of vehicles at each step of the mobility simulation. Depending on whether it is larger or lower than the target value, VACaMobil either waits for the number of vehicles to reduce toward the target value or, in the last case, the second scenario involves gradually adding more vehicles to the mobility simulation, raising the current value until the desired value is obtained. Output of the simulation contains several statistics for each car such as sent packets, received broadcasted packets, lost packets, speed, position, etc. Implementation of techniques follows the proposed frameworks due to the global nature of the problem for developed and underdeveloped countries. The results allow us to conclude that the implemented model is more suitable for simulating global network traffic simulation for estimating the traffic density on local ones. If the simulation is supposed to be used to evaluate such characteristics of a real network, then it is worth using models with an approximation not only of self-similar behavior, but also at least one-dimensional distribution.
Figure 11. Number of beacons sent vs. simulation time.
Figure 12. Number of vehicles vs. simulation time.

8. Conclusions

This paper presented a comprehensive investigation for traffic density estimation techniques in the context of sustainable characteristics of intelligent transportation systems. The new approach is also introduced by constructing a Markov-based efficient model on OMNET++. The proposed and implemented model results are discussed in Table 5, and a critical number of vehicles equipped with V2X communication is required to significantly improve traffic efficiency. Moreover, the illustration is shown in the form of graphs as mentioned in Figure 9a–e, and Table 4 and Table 6 of the proposed model was successfully implemented with the V2X communication. The results from this research are utilized to gain a better understanding of how well information may be propagated over V2X in any conditions, as well as the properties of communication devices (in terms of communication range), which may be employed to accomplish specific system performance. This study’s model can simply be extended to help or predict the distance between successive roadside stations, vehicles, and obstacles. In this study, we also explain the “Markov traffic”-based mathematical model that is developed by using the graph theory and Markov modeling. The objective was to develop a method capable of estimation the steady state of traffic distribution over an urban traffic road network. This model is helpful in improving the urban traffic road architecture, which is one of its intended applications. As shown by our results, we are able to formulate an accurate estimation of the traffic density by tracking the vehicle velocity, acceleration, mean speed, and location of each and every vehicle. This model incorporates the factor that it produces a steady-state headways distribution observed in practice. Moreover, it is a microsimulation model that can mimic the transient-state statistics of road traffic. Implementation of this proposed model is in software to evaluate the approach. We have performed simulations by using both, i.e., the model and the proposed estimation method. Future research will focus on a comprehensive evaluation of the effects of each parameter on traffic efficiency. This study could concentrate on increasing the accuracy and effectiveness of the proposed model by optimizing the parameters and selecting a more effective imputed technique for corrupted data, among other things.

Author Contributions

Conceptualization, H.B. and G.A.; Methodology, H.B.; Validation, A.A.S.; Investigation, H.B. and M.F.; Writing – original draft, H.B. and M.F.; Writing—review & editing, H.J.S.; Supervision, T.J. All authors have read and agreed to the published version of the manuscript.

Funding

The article processing charge (APC) was funded by the Research Management Centre (RMC), Universiti Malaysia Sabah, through the UMS/PPI-DPJ1 Journal Article Fund.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kwon, J.; Murphy, K. Modeling Freeway Traffic with Coupled HMMs; Technical Report; University of California: Berkeley, CA, USA, 2000. [Google Scholar]
  2. Guerrero-Ibáñez, J.; Zeadally, S.; Contreras-Castillo, J. Sensor technologies for intelligent transportation systems. Sensors 2018, 18, 1212. [Google Scholar] [CrossRef] [PubMed]
  3. Mahmud, S.S.; Ferreira, L.; Hoque, M.S.; Tavassoli, A. Micro-simulation modelling for traffic safety: A review and potential application to heterogeneous traffic environment. IATSS Res. 2019, 43, 27–36. [Google Scholar] [CrossRef]
  4. Rahimi, A.M.; Rahimi, F. Traffic Evaluation of SPUI and TUDI Interchanges Based on Traffic Conditions in Tehran with Aimsun and Synchro Software. Iran. J. Sci. Technol. Trans. Civ. Eng. 2020, 44, 1323–1334. [Google Scholar] [CrossRef]
  5. Nam, D.; Lavanya, R.; Jayakrishnan, R.; Yang, I.; Jeon, W.H. A deep learning approach for estimating traffic density using data obtained from connected and autonomous probes. Sensors 2020, 20, 4824. [Google Scholar] [CrossRef] [PubMed]
  6. Sun, D.J.; Zhang, L.; Chen, F. Comparative study on simulation performances of CORSIM and VISSIM for urban street network. Simul. Model. Pract. Theory 2013, 37, 18–29. [Google Scholar] [CrossRef]
  7. Kumar, S.V.; Vanajakshi, L.; Subramanian, S.C. Location-based data for estimated traffic on Urban arterial in heterogeneous traffic conditions. Transp. Res. Rec. 2011, 2239, 16–22. [Google Scholar] [CrossRef]
  8. Park, S.; Sohn, S.; Jae, M. Cohort-based evacuation time estimation using TSIS-CORSIM. Nucl. Eng. Technol. 2021, 53, 1979–1990. [Google Scholar] [CrossRef]
  9. Oskarbski, J.; Kaszubowski, D. Applying a mesoscopic Transport Model to analyse the effects of urban freight regulatory measures on transport emissions—An assessment. Sustainability 2018, 10, 2515. [Google Scholar] [CrossRef]
  10. Ratrout, N.T.; Rahman, S.M. A comparative analysis of currently used microscopic and macroscopic traffic simulation software. Arab. J. Sci. Eng. 2009, 34, 121–133. [Google Scholar]
  11. Chiou, S.W. An efficient algorithm for computing traffic equilibria using TRANSYT model. Appl. Math. Model. 2010, 34, 3390–3399. [Google Scholar] [CrossRef]
  12. Daganzo, C.F. A variational formulation of kinematic waves: Basic theory and complex boundary conditions. Transp. Res. Part B Methodol. 2005, 39, 187–196. [Google Scholar] [CrossRef]
  13. Lieu, H.; Santiago, A.; Kanaan, A. Corflo. An integrated traffic simulation system for corridors. In Proceedings of the Traffic Management, Engineering Foundation ConferenceEngineering Foundation, Palm Coast, FL, USA, 1–6 April 1991. [Google Scholar]
  14. Kadam, S.; Bandyopadhyay, P.K. Modelling passenger interaction process (PIP) framework using ISM and MICMAC approach. J. Rail Transp. Plan. Manag. 2020, 14, 100171. [Google Scholar] [CrossRef]
  15. Bourrel, E.; Lesort, J.B. Mixing microscopic and macroscopic representations of traffic flow: Hybrid model based on Lighthill–Whitham–Richards theory. Transp. Res. Rec. 2003, 1852, 193–200. [Google Scholar] [CrossRef]
  16. Dorokhin, S.; Artemov, A.; Likhachev, D.; Novikov, A.; Starkov, E. Traffic simulation: An analytical review. In IOP Conference Series: Materials Science and Engineering; IOP Publishing: Bristol, UK, 2020; Volume 918, p. 012058. [Google Scholar]
  17. Reyes-Rubiano, L.; Serrano-Hernandez, A.; Montoya-Torres, J.R.; Faulin, J. The Sustainability Dimensions in Intelligent Urban Transportation: A Paradigm for Smart Cities. Sustainability 2021, 13, 10653. [Google Scholar] [CrossRef]
  18. Ali, S.S.M.; George, B.; Vanajakshi, L.; Venkatraman, J. A multiple inductive loop vehicle detection system for heterogeneous and lane-less traffic. IEEE Trans. Instrum. Meas. 2011, 61, 1353–1360. [Google Scholar]
  19. Sochor, J.; Juránek, R.; Špaňhel, J.; Maršík, L.; Širokỳ, A.; Herout, A.; Zemčík, P. Comprehensive data set for automatic single camera visual speed measurement. IEEE Trans. Intell. Transp. Syst. 2018, 20, 1633–1643. [Google Scholar] [CrossRef]
  20. Sochor, J.; Juránek, R.; Herout, A. Traffic surveillance camera calibration by 3d model bounding box alignment for accurate vehicle speed measurement. Comput. Vis. Image Underst. 2017, 161, 87–98. [Google Scholar] [CrossRef]
  21. Tan, E.; Chen, J. Vehicular traffic density estimation via statistical methods with automated state learning. In Proceedings of the 2007 IEEE Conference on Advanced Video and Signal Based Surveillance, London, UK, 5–7 September 2007; pp. 164–169. [Google Scholar]
  22. Ozkurt, C.; Camci, F. Automatic traffic density estimation and vehicle classification for traffic surveillance systems using neural networks. Math. Comput. Appl. 2009, 14, 187–196. [Google Scholar] [CrossRef]
  23. Panda, M.; Ngoduy, D.; Vu, H.L. Multiple model stochastic filtering for traffic density estimation on urban arterials. Transp. Res. Part B Methodol. 2019, 126, 280–306. [Google Scholar] [CrossRef]
  24. Zeroual, A.; Harrou, F.; Sun, Y. Road traffic density estimation and congestion detection with a hybrid observer-based strategy. Sustain. Cities Soc. 2019, 46, 101411. [Google Scholar] [CrossRef]
  25. Biswas, D.; Su, H.; Wang, C.; Stevanovic, A.; Wang, W. An automatic traffic density estimation using Single Shot Detection (SSD) and MobileNet-SSD. Phys. Chem. Earth Parts A/B/C 2019, 110, 176–184. [Google Scholar] [CrossRef]
  26. George, R.; Vanajakshi, L.D.; Subramanian, S.C. Area Occupancy-Based Adaptive Density Estimation for Mixed Road Traffic. IEEE Access 2019, 8, 5502–5514. [Google Scholar] [CrossRef]
  27. Jo, K.; Chu, K.; Sunwoo, M. Interacting multiple model filter-based sensor fusion of GPS with in-vehicle sensors for real-time vehicle positioning. IEEE Trans. Intell. Transp. Syst. 2011, 13, 329–343. [Google Scholar] [CrossRef]
  28. Nugroho, S.A.; Taha, A.F.; Claudel, C.G. A control-theoretic approach for scalable and robust traffic density estimation using convex optimization. IEEE Trans. Intell. Transp. Syst. 2019, 22, 64–78. [Google Scholar] [CrossRef]
  29. Kerouh, F.; Ziou, D. Real-time Android application for traffic density estimation. IEEE Access 2018, 6, 49896–49901. [Google Scholar] [CrossRef]
  30. de Paula, M.B.; Jung, C.R. Automatic detection and classification of road lane markings using onboard vehicular cameras. IEEE Trans. Intell. Transp. Syst. 2015, 16, 3160–3169. [Google Scholar] [CrossRef]
  31. Asmaa, O.; Mokhtar, K.; Abdelaziz, O. Road traffic density estimation using microscopic and macroscopic parameters. Image Vis. Comput. 2013, 31, 887–894. [Google Scholar] [CrossRef]
  32. Yilan, M.; Özdemir, M.K. Traffic density estimation via KDE and nonlinear LS. Turk. J. Electr. Eng. Comput. Sci. 2017, 25, 1163–1172. [Google Scholar] [CrossRef]
  33. Garg, K.; Lam, S.K.; Srikanthan, T.; Agarwal, V. Real-time road traffic density estimation using block variance. In Proceedings of the 2016 IEEE Winter Conference on Applications of Computer Vision (WACV), Lake Placid, NY, USA, 7–10 March 2016; pp. 1–9. [Google Scholar]
  34. Yamaguchi, T.; Asanuma, I.; Park, J.G.; Mackin, K.J.; Mittleman, J. Estimation of vessel traffic density from Suomi NPP VIIRS day/night band. In Proceedings of the Oceans 2016 MTS/IEEE Monterey, Monterey, CA, USA, 19–23 September 2016; pp. 1–5. [Google Scholar]
  35. Borkar, P.; Sarode, M.; Malik, L. Employing speeded scaled conjugate gradient algorithm for multiple contiguous feature vector frames: An approach for traffic density state estimation. Procedia Comput. Sci. 2016, 78, 740–747. [Google Scholar] [CrossRef]
  36. Zhong, Z.; Lee, E.E.; Nejad, M.; Lee, J. Influence of CAV clustering strategies on mixed traffic flow characteristics: An analysis of vehicle trajectory data. Transp. Res. Part C Emerg. Technol. 2020, 115, 102611. [Google Scholar] [CrossRef]
  37. Xie, G.; Gao, H.; Qian, L.; Huang, B.; Li, K.; Wang, J. Vehicle trajectory prediction by integrating physics-and maneuver-based approaches using interactive multiple models. IEEE Trans. Ind. Electron. 2017, 65, 5999–6008. [Google Scholar] [CrossRef]
  38. Raj, J.; Bahuleyan, H.; Vanajakshi, L.D. Application of data mining techniques for traffic density estimation and prediction. Transp. Res. Procedia 2016, 17, 321–330. [Google Scholar] [CrossRef]
  39. Martínez-Díaz, M.; Soriguera, F. Short-term prediction of freeway travel times by fusing input-output vehicle counts and GPS tracking data. Transp. Lett. 2021, 13, 193–200. [Google Scholar] [CrossRef]
  40. Warriach, E.U.; Claudel, C. A machine learning approach for vehicle classification using passive infrared and ultrasonic sensors. In Proceedings of the 2013 ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN), Philadelphia, PA, USA, 8–11 April 2013; pp. 333–334. [Google Scholar]
  41. Hu, H.; Gao, Z.; Sheng, Y.; Zhang, C.; Zheng, R. Traffic density recognition based on image global texture feature. Int. J. Intell. Transp. Syst. Res. 2019, 17, 171–180. [Google Scholar] [CrossRef]
  42. Lozano Domínguez, J.M.; Al-Tam, F.; Mateo Sanguino, T.d.J.; Correia, N. Analysis of Machine Learning Techniques Applied to Sensory Detection of Vehicles in Intelligent Crosswalks. Sensors 2020, 20, 6019. [Google Scholar] [CrossRef]
  43. Mukherjee, A.; Jain, D.K.; Goswami, P.; Xin, Q.; Yang, L.; Rodrigues, J.J. Back propagation neural network based cluster head identification in MIMO sensor networks for intelligent transportation systems. IEEE Access 2020, 8, 28524–28532. [Google Scholar] [CrossRef]
  44. Goswami, P.; Mukherjee, A.; Hazra, R.; Yang, L.; Ghosh, U.; Qi, Y.; Wang, H. AI based energy efficient routing protocol for intelligent transportation system. IEEE Trans. Intell. Transp. Syst. 2021, 23, 1670–1679. [Google Scholar] [CrossRef]
  45. Gupta, M.; Kumar, R.; Shekhar, S.; Sharma, B.; Patel, R.B.; Jain, S.; Dhaou, I.B.; Iwendi, C. Game Theory-Based Authentication Framework to Secure Internet of Vehicles with Blockchain. Sensors 2022, 22, 5119. [Google Scholar] [CrossRef]
  46. Gupta, M.; Patel, R.B.; Jain, S.; Garg, H.; Sharma, B. Lightweight branched blockchain security framework for Internet of Vehicles. Trans. Emerg. Telecommun. Technol. 2022, e4520. [Google Scholar] [CrossRef]
  47. Garg, S.; Singh, R.; Obaidat, M.S.; Bhalla, V.K.; Sharma, B. Statistical vertical reduction-based data abridging technique for big network traffic dataset. Int. J. Commun. Syst. 2020, 33, e4249. [Google Scholar] [CrossRef]
  48. Zhang, Y.; Fricker, J.D. Multi-state semi-Markov modeling of recurrent events: Estimating driver waiting time at semi-controlled crosswalks. Anal. Methods Accid. Res. 2020, 28, 100131. [Google Scholar] [CrossRef]
  49. Singh, K.; Li, B. Estimation of traffic densities for multilane roadways using a markov model approach. IEEE Trans. Ind. Electron. 2011, 59, 4369–4376. [Google Scholar] [CrossRef]
  50. Wang, X.; Peng, L.; Chi, T.; Li, M.; Yao, X.; Shao, J. A hidden Markov model for urban-scale traffic estimation using floating car data. PLoS ONE 2015, 10, e0145348. [Google Scholar] [CrossRef] [PubMed]
  51. Priambodo, B.; Ahmad, A.; Kadir, R.A. Predicting Traffic Flow Propagation Based on Congestion at Neighbouring Roads Using Hidden Markov Model. IEEE Access 2021, 9, 85933–85946. [Google Scholar] [CrossRef]
  52. Zaki, J.F.; Ali-Eldin, A.; Hussein, S.E.; Saraya, S.F.; Areed, F.F. Traffic congestion prediction based on Hidden Markov Models and contrast measure. Ain Shams Eng. J. 2020, 11, 535–551. [Google Scholar] [CrossRef]
  53. Báguena, M.; Tornell, S.M.; Torres, Á.; Calafate, C.T.; Cano, J.C.; Manzoni, P. Vacamobil: Vanet car mobility manager for omnet++. In Proceedings of the 2013 IEEE International Conference on Communications Workshops (ICC), Budapest, Hungary, 9–13 June 2013; pp. 1057–1061. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.