Network Traffic Conditions Research Articles

Short term road network Macroscopic Fundamental Diagram parameters and traffic state prediction based on LSTM

Macroscopic Fundamental Diagram (MFD) is widely used in traffic state evaluation due to its description of the macro level of urban road network. This study focuses on the discrimination and short-term prediction of macro traffic states in urban road networks, using MFD combined with FCM clustering for state partitioning to characterize different macro states of the road network. To predict the MFD state, this paper builds two LSTMs to perform short-term predictions on two important parameters in MFD: road network weighted flow qw and road network weighted density kw. The parameters of the first three statistical intervals and the predicted time period are used as inputs to output the MFD parameters for the predicted time period. To ensure that the two LSTM structures and hyper-parameters settings can achieve the best prediction performance for MFD, the parameter optimization process of both should be included in the same search framework for hyper-parameters search. Therefore, this paper uses GA algorithm combined with multi-objective particle swarm optimization algorithm as the solving algorithm, with the accuracy of solving two MFD parameters and the accuracy of MFD point positioning as the hyper-parameters solving objectives. The study was validated using actual road network data from Hong Kong, and the results showed that the method proposed in this paper has an MRE prediction error of less than 7.8% for the two parameters of MFD, and can predict the future temporal trend of the two parameters, demonstrating the feasibility of MFD related predictions. The model's prediction of the overall shape and change trajectory trend of MFD is consistent with reality, and some test sets in MFD state prediction show high accuracy, the overall accuracy is 81.45%. To verify the effectiveness of the multi-objective search algorithm, typical LSTM models and RNN models were used for comparison. The experiment proved that the model used in this study performed better in error control and state prediction. This study explores and practices a short-term prediction method for road network MFD parameters, MFD status, and their changing trends. Provided path reference for urban road network prediction, traffic control status, and MFD related research.

Emulation and detection of physical faults and cyber-attacks on building energy systems through real-time hardware-in-the-loop experiments

The increasing use of remote or mobile access, integrated wearable technologies, data exchange, and cloud-based data analytics in modern smart buildings is steering the building industry towards open communication technologies. The increased connectivity and accessibility could lead to more cyber-attacks in smart buildings. On the other hand, physical faults (e.g., HVAC − heating, ventilation, and air-conditioning faults) may have similar adverse impacts as those from the cyber-attacks on building energy systems, such as occupant discomfort, energy wastage, and equipment downtime. However, current physical behavior-based anomaly detection methods fail to differentiate between cyber-attacks and physical faults in building energy systems. Moreover, the challenge in collecting real-world threat data with ground truth has led researchers to rely on numerical models with user-defined assumptions, which may not accurately reflect real-world conditions due to the lack of in-situ experimental datasets. To address these challenges and gaps, this paper presents a flexible hardware-in-the-loop (HIL) testbed for generating cyber-attack and physical fault datasets and demonstrating threat detection algorithms in a real building automation system (BAS) environment. This testbed combines hardware (i.e., real BAS with local HVAC controllers and a physical network) with software (i.e., high-fidelity models to represent behaviors of building envelope and HVAC energy systems), enabling emulations of realistic threats. Five HIL experiments, including one baseline without any threats, two with physical faults, and two with cyber-attacks, were conducted to generate datasets containing detailed network traffic and system states. A joint classification framework, incorporating a network analyzer and a physical HVAC fault detector, was proposed to automatically detect cyber-physical abnormalities on BAS at both the network and the physical HVAC levels. The network analyzer comprises a conditional random fields (CRF) based command validator and a statistics-based detection strategy. The fault detector employs a weather and schedule-based pattern matching and feature-based principal component analysis (WPM-FPCA) method. Evaluation of the classification using four metrics from the multi-class confusion matrix revealed an average accuracy of 90.2 %, recall of 89.7 %, precision of 88.5 % and F1-score of 89.2 %. These results demonstrate that the proposed joint classification framework can effectively differentiate between specific types of cyber-attacks (e.g., device reinitialization attack, network Denial-of-Service attack) and physical faults (e.g., air handling unit operational fault, cooling coil valve stuck) in real time for improved building energy management.

AI for AI-based intrusion detection as a service: Reinforcement learning to configure models, tasks, and capacities

Intrusion Detection Systems (IDS) increasingly leverage machine learning (ML) to enhance the detection of zero-day attacks. As operational complexities increase, enterprises are turning to Intrusion Detection as a Service (IDaS), requiring advanced solutions for efficient ML model selection and resource allocation. Existing research often focuses primarily on accuracy and computational efficiency, leaving a gap in solutions that can dynamically adapt. This study introduces a novel integrated solution, Auto-IDaS, which employs advanced Reinforcement Learning (RL) techniques for real-time, adaptive management of IDS. Auto-IDaS uses the Deep Q-Network (DQN) algorithm for dynamic ML model selection, automatically adjusting configurations of IDaS in response to fluctuating network traffic conditions. Simultaneously, it utilizes the Twin Delayed Deep Deterministic (TD3) algorithm for optimizing capacity allocation, aiming to minimize computational costs while maintaining service quality. This dual approach is innovative in its use of RL to address both selection and allocation challenges within IDaS frameworks. The effectiveness of TD3 is compared against Simulated Annealing (SA), a traditional optimization technique. The results demonstrate that utilizing DQN to dynamically select the model significantly improves the reward by 0.29% to 27.04%, effectively balancing detection performance (F1 score), detection time, and computation cost. Regarding capacity allocation, TD3 accelerates decision times approximately 5×106 times faster than SA while retaining decision quality within a 10% range comparable to SA’s performance.

[formula omitted]-LB: Software-defined IDS with UAV Resource Aware Load-Balancing in FANET disaster scenarios

In critical scenarios like natural disasters, the physical infrastructure of the network may be heavily damaged or completely torn down making difficult communications and rescue activities. In such cases, due to their nature, Unmanned Aerial Vehicles (UAVs) are usually employed to provide a temporary support network by forming a Flying Ad-Hoc Network (FANET). However, this network should be carefully monitored and safeguarded to guarantee its stability by deploying network security appliances, like Intrusion Detection Systems (IDSs). In the wake of these considerations, this paper delves into the utilization of IDS functions deployed on UAVs, named IDS-enabled UAVs, in emergencies leveraging the modern Software-Defined Network (SDN) paradigm. Specifically, the study proposes a dynamic approach to promptly activate IDS-enabled UAVs, in an SDN-FANET, responding to network traffic increasing and/or malicious activities taking place within the network. In order to achieve this objective, a Software-defined IDS with UAV Resource Aware Load Balancing strategy – SURA-LB – is proposed and implemented within the SDN controller, leveraging its programmable nature and its holistic view of the network. The SURA-LB strategy equally distributes the load among the set of IDS-enabled UAVs by considering their resources and energy utilization along with the experienced network traffic conditions. Finally, an extensive experimental campaign shows the benefits of the proposed load-balancing strategy in reducing and fairly distributing the workload among the IDS-enabled UAVs outperforming naive and baseline load-balancing strategies like Random and Round-Robin and, therefore, bolstering the resilience and the reliability of the set of IDS-enabled UAVs while the traffic to be monitored and analyzed increases.

Next‐generation energy‐efficient optical networking: DQ‐RGK algorithm for dynamic quality of service and adaptive resource allocation

SummaryIn green optical networking, designing an adaptive energy‐saving scheme plays a vital role, in optimizing energy consumption by dynamically adjusting resources based on network traffic and environmental conditions, to a more sustainable and efficient optical communication infrastructure. Traditional methods in optical networking face challenges such as static resource allocation, limited adaptability, inefficient power usage, environmental insensitivity, and scalability issues. Therefore this article proposed a novel method named Dynamic Quality of Service based Random update Genghis Khan (DQ‐RGK) algorithm, the proposed model can tackle the abovementioned complexities. In this study, cluster head dynamic placement is utilized to optimize the network's performance by adapting the placement of cluster heads to the current topology, load distribution, and energy levels in the network nodes. Additionally, Dynamic Quality of Service (QoS) is employed to respond dynamically to changes in network conditions, adapting to varying traffic patterns and resource availability. In this work, the Genghis Khan Shark optimization with a random update strategy is implemented for hyperparameter optimization to enhance the performance of the DQ‐RGK method. The DQ‐RGK adjusts the parameters of QoS in real‐time, and this ensures that network resources based on the requirements changed and priorities of applications, which ultimately optimizes performance and enhances user experience. By dynamically assigning and reallocating resources based on the current demand the algorithm enhances overall network efficiency and reduces energy consumption. Then, this work analyzes the experimental results, where some evaluation measures estimate the DQ‐RGK method's performance. Routing efficiency, latency, scalability, spectral efficiency, Packet Delivery Ratio, throughput, network lifetime, energy consumption, jitter, and energy consumption are the measures employed by the DQ‐RGK model. In The results, other routing models that do not provide efficiency are utilized, a comparison of these other routing models is represented in results. The overall DQ‐RGK model's effectiveness is represented in the experimental results and its effectiveness is greater among other methods.

ELA-RCP: An energy-efficient and load balanced algorithm for reliable controller placement in software-defined networks

Software-defined networking is a modern and popular network technology that utilizes controllers as network operating systems to manage the network and allow user applications to interact with network hardware. Determining the optimal number of controllers and the optimal place to install them are some of the multi-controller model challenges that are known as the Controller Placement Problem (CPP). CPP is an optimization problem that tries to minimize delay and achieve a balanced network. CPP becomes more important when we intend to increase reliability and reduce energy consumption. This paper proposes an Energy-efficient and Load-balanced optimization Algorithm for Reliable Controller Placement (ELA-RCP) in Software-Defined Networks (SDN). The proposed ELA-RCP is a three-step solution to CPPs. First, it determines the optimal number of controllers using the proposed cellular learning automata, taking into account network traffic status, scale, and budget. Second, an innovative meta-heuristic algorithm is proposed to identify proper controller locations based on factors like path reliability, controller processing capacity, propagation delay, and energy consumption. In the last step, load balancing and the reliability of the controllers are improved using queuing theory and a proposed greedy algorithm. ELA-RCP is evaluated with real-world topologies. The simulation demonstrates up to 25% improvement in energy consumption, up to 108% improvement in the network survivability, and up to 68% improvement in mean average delay rise compared to particle swarm optimization, firefly optimization algorithm, ant lion optimization, and seagull optimization algorithm.

A traffic state prediction method based on spatial–temporal data mining of floating car data by using autoformer architecture

AbstractFloating car data (FCD), characterized by wide spatiotemporal coverage, low collection cost, and immunity to adverse weather conditions, are one of the key approaches for intelligent transportation systems to obtain real‐time urban road network traffic information. The research aims to utilize GPS data from taxis in Shanghai and vector geographic information data of the road network, with urban expressways as the research focus. Based on the different driving characteristics of expressways and the vehicles on the ramps below, a clustering analysis is employed to determine all floating vehicles traveling on the target road. Furthermore, an adaptive buffer zone consistent with the road orientation is established based on road vector geographic data. This allows for the extraction of FCD within segmented areas, and the average vehicle speed for that road segment is obtained through weighted calculations. This method fully exploits the natural characteristics of taxis in urban areas with a wide spatiotemporal distribution. The data effectiveness and coverage reach 90.2% and 85.7%, respectively, significantly surpassing the traditional grid‐based extraction method for FCD. Additionally, to capture the long‐term spatiotemporal dependencies of road network traffic states, a spatial–temporal autoformer (STAF) network based on spatial–temporal sequence autocorrelation is employed for traffic state prediction. The results indicate that the STAF method demonstrates good performance in medium‐ and long‐term prediction. We believe that the proposed FCD mining method in this paper provides a new approach for efficiently extracting large‐scale road network traffic states and conducting medium‐ to long‐term predictions.

The Peak Stability Analysis through Hysteresis Phenomenon on Heterogeneous Networks

The macroscopic fundamental diagram (MFD) is a nonuniversal changing process over network traffic status which indicates different shapes in different networks. Hysteresis is observed in the MFD of some urban networks. It is a unique phenomenon when the network remains at low stability level and usually appears around the congestion period. This paper analyzed network peak stability through focusing on hysteresis. The formation mechanism of hysteresis is deduced from the mathematical method based on previous research studies. The precondition of hysteresis and the changing process of network state can be figured by mathematical deduction. It indicates that hysteresis only occurs conditionally in the period of macroscopic congestion and is not a universal phenomenon. Heterogeneity is an important factor leading to network instability. The hysteresis patterns of different peaks in MFD are different due to the variation of network flow. Real data are collected from Atlanta’s urban network to verify the analysis of hysteresis. To discuss the changing process of hysteresis in different peaks, a three-stage division is proposed and time series is presented as a third dimension in MFD. It is worth noticing that the existence and form of hysteresis in morning and evening peaks are different. Although there is a higher peak flow in the morning peak, the stability of the evening peak performs better when hysteresis occurs in the network. The different fluctuations in the morning and evening peaks are exhibited through the 3D version of MFD. The otherness of hysteresis in different peaks is explained through a 3D coordinate system with cross-compared corresponding indexes.

Load balancing of multi-AGV road network based on improved Q-learning algorithm and macroscopic fundamental diagram

To address the challenges of traffic congestion and suboptimal operational efficiency in the context of large-scale applications like production plants and warehouses that utilize multiple automatic guided vehicles (multi-AGVs), this article proposed using an Improved Q-learning (IQL) algorithm and Macroscopic Fundamental Diagram (MFD) for the purposes of load balancing and congestion discrimination on road networks. Traditional Q-learning converges slowly, which is why we have proposed the use of an updated Q value of the previous iteration step as the maximum Q value of the next state to reduce the number of Q value comparisons and improve the algorithm’s convergence speed. When calculating the cost of AGV operation, the traditional Q-learning algorithm only considers the evaluation function of a single distance and introduces an improved reward and punishment mechanism to combine the operating distance of AGV and the road network load, which finally equalizes the road network load. MFD is the basic property of road networks and is based on MFD, which is combined with the Markov Chain (MC) model. Road network traffic congestion state discrimination method was proposed to classify the congestion state according to the detected number of vehicles on the road network. The MC model accurately discriminated the range near the critical point. Finally, the scale of the road network and the load factor were changed for several simulations. The findings indicated that the improved algorithm showed a notable ability to achieve equilibrium in the load distribution of the road network. This led to a substantial enhancement in AGV operational efficiency.

A new intelligent cross-domain routing method in SDN based on a proposed multiagent reinforcement learning algorithm

PurposeA cross-domain intelligent software-defined network (SDN) routing method based on a proposed multiagent deep reinforcement learning (MDRL) method is developed.Design/methodology/approachFirst, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between the root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to acquire global network state information in real time. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a network traffic state prediction mechanism is designed to improve awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time.FindingsExperimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput and reduce the network delay and packet loss rate compared to those of the Dijkstra and open shortest path first (OSPF) routing methods.Originality/valueMessage transmission and message synchronization for multicontroller interdomain routing in SDN have long adaptation times and slow convergence speeds, coupled with the shortcomings of traditional interdomain routing methods, such as cumbersome configuration and inflexible acquisition of network state information. These drawbacks make it difficult to obtain global state information about the network, and the optimal routing decision cannot be made in real time, affecting network performance. This paper proposes a cross-domain intelligent SDN routing method based on a proposed MDRL method. First, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to realize the real-time acquisition of global network state information. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a prediction mechanism for the network traffic state is designed to improve awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time. Experimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput and reduce the network delay and packet loss rate compared to those of the Dijkstra and OSPF routing methods.

Performance Optimization of Machine Learning Algorithms Based on Spark

Abstract This paper proposes a performance optimization strategy for Spark-based machine learning algorithms in Shuffle and memory data management modules. The Shuffle module is optimized by introducing Observer monitoring module in Spark cluster to achieve task status monitoring and dynamic ShuffleWrite task generation. Meanwhile, an adaptive caching mechanism for RDD data addresses the lack of in-memory data caching. The performance-optimized algorithm performs well in the experiments, with a clustering accuracy of 89% and a response time that is 5% faster than the Random Forest algorithm. In road network traffic state discrimination, the optimized algorithm’s classification decision F-measure value is as high as 99.53%, which is 5.32% higher than that before unoptimization, and the running time is 767 seconds less than that of the unoptimized algorithm when dealing with about 6,880,000 pieces of data, which significantly improves the efficiency and accuracy.

Representing and Inferring Massive Network Traffic Condition: A Case Study in Nashville, Tennessee

Intelligent transportation systems (ITSs) usually require monitoring of massive road networks and gathering traffic data at a high spatial and temporal resolution. This leads to the accumulation of substantial data volumes, necessitating the development of more concise data representations. Approaches like principal component analysis (PCA), which operate within subspaces, can construct precise low-dimensional models. However, interpreting these models can be challenging, primarily because the principal components often encompass a multitude of links within the traffic network. To overcome this issue, this study presents a novel approach for representing and indexing network traffic conditions through weighted CUR matrix decomposition integrated with clustering analysis. The proposed approach selects a subset group of detectors from the original network to represent and index traffic condition through a matrix decomposition method, allowing for more efficient management and analysis. The proposed method is evaluated using traffic detector data from the city of Nashville, TN. The results demonstrate that the approach is effective in representing and indexing network traffic conditions, with high accuracy and efficiency. Overall, this study contributes to the field of network traffic monitoring by proposing a novel approach for representing massive traffic networks and exploring the effects of incorporating clustering into CUR decomposition. The proposed approach can help traffic analysts and practitioners to more efficiently manage and analyze traffic conditions, ultimately leading to more effective transportation systems.

Hysteresis and the Unobserved Congestion Branch in the Macroscopic Fundamental Diagram: Theoretical Considerations and Modeling

The macroscopic fundamental diagram (MFD) is developed to describe traffic operations aggregated over an area. The MFD is defined by network traffic states as a relationship between the accumulation of vehicles and flow or speed of vehicles. The concept of the MFD has been applied to model traffic dynamics and to design control strategies. For various applications (e.g., routing and departure time choices), the MFD is often assumed to be of a particular shape, consisting of two branches—a free-flow branch and a congestion branch. However, empirical observations show some inconsistencies between the theoretical and the empirical MFD. First, the empirical MFD only presents free-flow branch, i.e., the congestion branch is missing. Second, the MFD presents as hysteresis loop(s). This paper explores these differences, providing insights into urban network traffic dynamics. This work takes the travelers’ departure time choices and user equilibrium (UE) as starting points. We consider demand to be in UE in terms of departure time choices. Using this property of the demand profile, the paper proposes a closed-form expression for average density and outflow. Finally, we show some insights in the urban traffic dynamics: (i) an explanation of the hysteresis phenomenon solely from the perspective of departure time choices and UE and (ii) an explanation of why we hardly observe the MFD congestion branch in real life even in heavily congested networks. Our study shows that, for management purposes, the missing of congestion branch is a result of UE, rather than an indicator of congestion severity.

Detection and Mitigation of (D)DoS Attacks in SDN Environment Using Entropy

Software Defined Networking (SDN) is a paradigm for the networks, where the control planes and data planes are separated. It provides centralized network control by separating the network’s control logic from the underlying hardware devices. However, like traditional networks SDN is also susceptible to Denial of Service (DoS) and Distributed Denial of Service (DDoS) attacks. This paper aims to detect and mitigate DoS and DDoS attacks in an SDN environment using an entropy-based approach. The proposed mechanism calculates the entropy of the network over the collected traffic, and derives a dynamic threshold according to the network traffic conditions to determine whether the environment is subject to DoS or DDoS attacks. In the event of the attack, the proposed mechanism installs a drop flow rule into underlying forwarding devices, discarding the traffic sent from attacking host to victim host

A novel traffic optimization method using GRU based deep neural network for the IoV system.

At present, China is moving towards the direction of "Industry 4.0". The development of the automobile industry, especially intelligent automobiles, is in full swing, which brings great convenience to people's life and travel. However, at the same time, urban traffic pressure is also increasingly prominent, and the situation of traffic congestion and traffic safety is not optimistic. In this context, the Internet of Vehicles (also known as "IoV") opens up a new way to relieve urban traffic pressure. Therefore, in order to further optimize the road network traffic conditions in the IoV environment, this research focuses on the traffic flow prediction algorithm on the basis of deep learning to enhance traffic efficiency and safety. First, the study investigates the short-time traffic flow prediction by combining the characteristics of the IoV environment. To address the issues that existing algorithms cannot automatically extract data features and the model expression capability is weak, the study chooses to build a deep neural network using GRU model in deep learning for short-time traffic flow prediction, thereby improving the prediction accuracy of algorithm. Secondly, a fine-grained traffic flow statistics approach suitable for the IoV situation is suggested in accordance with the deep learning model that was built. The algorithm sends the vehicle characteristic data obtained through GRU model training into the fine-grained traffic flow statistics algorithm, so as to realize the statistics of traffic information of various types of vehicles. The advantage of this algorithm is that it can well count the traffic flow of multiple lanes, so as to better predict the current traffic status and achieve traffic optimization. Finally, the IoV environment is constructed to confirm the effectiveness of the prediction model. The prediction results prove that the new algorithm has good performance in traffic flow statistics in different scenarios.

Research on Anomaly Network Detection Based on Self-Attention Mechanism.

Network traffic anomaly detection is a key step in identifying and preventing network security threats. This study aims to construct a new deep-learning-based traffic anomaly detection model through in-depth research on new feature-engineering methods, significantly improving the efficiency and accuracy of network traffic anomaly detection. The specific research work mainly includes the following two aspects: 1. In order to construct a more comprehensive dataset, this article first starts from the raw data of the classic traffic anomaly detection dataset UNSW-NB15 and combines the feature extraction standards and feature calculation methods of other classic detection datasets to re-extract and design a feature description set for the original traffic data in order to accurately and completely describe the network traffic status. We reconstructed the dataset DNTAD using the feature-processing method designed in this article and conducted evaluation experiments on it. Experiments have shown that by verifying classic machine learning algorithms, such as XGBoost, this method not only does not reduce the training performance of the algorithm but also improves its operational efficiency. 2. This article proposes a detection algorithm model based on LSTM and the recurrent neural network self-attention mechanism for important time-series information contained in the abnormal traffic datasets. With this model, through the memory mechanism of the LSTM, the time dependence of traffic features can be learned. On the basis of LSTM, a self-attention mechanism is introduced, which can weight the features at different positions in the sequence, enabling the model to better learn the direct relationship between traffic features. A series of ablation experiments were also used to demonstrate the effectiveness of each component of the model. The experimental results show that, compared to other comparative models, the model proposed in this article achieves better experimental results on the constructed dataset.

STGNN-FAM: A Traffic Flow Prediction Model for Spatiotemporal Graph Networks Based on Fusion of Attention Mechanisms

Network traffic state prediction has been constantly challenged by complex spatiotemporal features of traffic information as well as imperfection in streaming data. This paper proposes a traffic flow prediction model for spatiotemporal graph networks based on fusion of attention mechanisms (STGNN-FAM) to simultaneously tackle these challenges. This model contains a spatial feature extraction layer, a bidirectional temporal feature extraction layer, and an attention fusion layer, which not only fully considers the temporal and spatial features of the traffic flow problem but also uses the attention mechanism to enhance the critical temporal and spatial features to achieve more accurate and robust predictions. Experimental results on a network traffic speed dataset PeMSD7 show that the proposed STGNN-FAM outperforms several important benchmarks in prediction accuracy and the ability to withstand interference in the data stream, especially for mid- and long-term prediction of 30 minutes and 45 minutes.

Optimization of charging stations integrated with dynamic transportation systems in metropolises

The development of electric vehicles (EVs) is expected to play an important role in achieving the emission reduction targets in the transportation sector by many countries and regions, including China’s dual carbon goals. A bottleneck to the mass roll-out of EVs is the limited charging facilities. This paper considers the planning of charging facilities for a new developing area in a metropolis, and an optimization model for charging station planning based on the dynamic transportation system is proposed. The proposed model is developed using an objective framework that considers the spatio-temporal characteristics of EV charging demand in order to minimize the overall cost while the constraints from suppliers and drivers are met. The Voronoi diagram is used to determine the final service boundary of each charging station, and the effect is verified in the planning of charge stations for the Yizhuang new town in Beijing. The case study confirms that the proposed method can optimize the charging facilities that fit well with the traffic network conditions. Furthermore, it is shown that the charging demand varies in accordance with the population density and regional functionality in different areas.

Analyzing and Modeling Network Travel Patterns During the Ukraine Invasion Using Crowd-Sourced Pervasive Traffic Data

In 2022, Ukraine is suffering an invasion which has resulted in acute impacts playing out over time and geography. This paper examines the impact of the ongoing disruption on traffic behavior using analytics as well as zonal-based network models. The methodology is a data-driven approach that utilizes obtained travel-time conditions within an evolutionary algorithm framework which infers origin–destination demand values in an automated process based on traffic assignment. Because of the automation of the implementation, numerous daily models can be approximated for multiple cities. The novelty of this paper versus the previously published core methodology includes an analysis to ensure the obtained data is appropriate, since some data sources were disabled because of the ongoing disruption. Further novelty includes a direct linkage of the analysis to the timeline of disruptions to examine the interaction in a new way. Finally, specific network metrics are identified which are particularly suited for conceptualizing the impact of conflict disruptions on traffic network conditions. The ultimate aim is to establish processes, concepts, and analysis to advance the broader activity of rapidly quantifying the traffic impacts of conflict scenarios.

Network Path Optimization Strategy using Collaborative Cache for Delay Tolerant Networks

The data transmissions over Delay Tolerant Networks (DTN) and Social-based Opportunistic networks have increased in the last few years due to a higher demand for remote transmissions. The wide applications of DTN have significantly motivated the researchers to focus on finding optimized routing strategies by optimizing various parameters such as energy, cost and congestion. Nonetheless, these parallel research outcomes have reported few further bottlenecks to improve the strategies. Henceforth, this work proposes a novel approach to optimize the routing paths using the cache collaboration method. This proposed method identifies the data-sharing strategies and subsequently identifies the sub-set of the paths between the source and destinations. Further optimizes the path using standard measures such as cost, transmission speed, and the network traffic conditions; lastly Data-Centric and Cost Optimized Routing Path is Identification. This work results in a nearly 20% reduction in the distance between the nodes, a 15% reduction of time in path identification and a nearly 50% reduction in cache allocation demand over multiple iterations compared to the existing models.