Search

Vehicular Ad-Hoc Network is one of the most growing research fields and has become a promising topic for researchers. Day by day, vehicle density increases, causing very serious issues like road accidents and traffic jams. These issues can be minimized by a periodic exchange of awareness messages among the vehicles. Traffic density increases transmission of awareness messages, which causes channel congestion and degrades safety services, so congestion control schemes must ensure that the channel load should be below a particular threshold, boost the quality of services and minimize information loss and delay in the network. This paper proposes a machine learning-based risk-aware congestion control (MLB-RACC) scheme which is an efficient congestion control scheme based on the modified k -means machine learning algorithms. MLB-RACC technique processes the input data and helps to improve the quality of services in the automotive industry. It works in three phases: detecting congestion, clustering of vehicles and controlling the broadcasting of awareness messages for decreasing the channel load. MLB-RACC scheme works by grouping the nearest vehicles and the number of groups or clusters is decided on the basis of transmission range/transmission power. The group member selects adaptive transmission rate by looking at the channel busy ratio (CBR). In this technique, message generation rate is controlled at two levels: first is at the clustering level and second is during the checking of CBR. The scheme is implemented through MATLAB, NS2 and the SUMO platform and provides evidence for the minimization of information loss by analyzing the throughput, packet loss and end-to-end delay in comparison to ordinary decentralized congestion control (DCC) technique. [ABSTRACT FROM AUTHOR]

Learning a fast global model that describes the observed phenomenon well is a crucial goal in the inherently distributed Vehicular Networks. This global model is further used for decision-making, which is especially important for some safety-related applications (i.e., the altering of accident and warning of traffic jam). Most existing works have ignored the network overhead caused by synchronizing with neighbors, which inevitably delays the time for agents to stabilize. In this paper, we focus on developing an asynchronous distributed clustering algorithm to learn the global model, where cluster models, rather than raw data points, are shared and updated. Empirical experiments on a message delay simulator show the efficiency of our methods, with a reduced convergence time, declined network overhead and improved accuracy (relative to the standard solution). This algorithm is further improved by introducing a tolerant delay. Compared to the algorithm without delay, the performance is improved significantly in terms of convergence time (by as much as 47%) and network overhead (by around 53%) if the underlying network is geometric or regular. [ABSTRACT FROM AUTHOR]

Wireless sensor networks congestion occurs easily due to its centralized traffic pattern. Normally, mono-sync wireless sensor network experiences multiple traffic flow congestion in the dense environment of the network, which leads to excess energy consumption and severe packet loss. To overcome these issues, a congestion detection and alleviation mechanism using cluster based heuristic optimized hierarchical routing protocol is proposed in this paper. Here, congestion detection and alleviation utilize the features of sensor nodes. The congestion is categorized into two types: (i) node level congestion and (ii) link level congestion. The node level congestion is detected by assessing the buffer utilization and the interval amid the consecutive data packets. The link level congestion is considered with computing link usage utilizing back-off step of round robin carrier sense multi-access with collision avoidance. Congestion detection and alleviation reactively affected node/link through cuckoo hosted rider search multi-hop routing algorithm. It has two phases: the cluster head selection and multi-path routing. Cluster head selection is performed through Taylor multiple random forest kernel fuzzy C-means clustering algorithm and multi-path routing is performed through cuckoo hosted rider search multi-hop routing algorithm. The simulation of the proposed method is done in network simulator tool. Here, the performance metrics, like packet delivery ratio, delay, energy consumption, packet drop, overhead, network lifetime and throughput are calculated. The experimental outcomes of the proposed technique shows 11.6%, 18.4% and 28.1% lower delay, 78.2%, 65.4% and 52.6% higher packet delivery ratio, and 29.2%, 37.4% and 40.8% lower packet drop compared with the existing methods, like congestion detection and alleviation using multi-attribute decision-making in optimization-based hybrid congestion alleviation routing protocol in wireless sensor networks, congestion detection and alleviation using hybrid K-means with greedy best first search algorithms in packet rate reduction utilizing adaptive weight firefly algorithm ant colony optimization based routing protocol in wireless sensor networks and congestion detection and alleviation using multi-input time on task optimization algorithm for altered gravitational search algorithm routing protocol in wireless sensor networks. [ABSTRACT FROM AUTHOR]

With the rapid growth of the global economy, the global car ownership is also increasing year by year, which has caused a series of problems, the most prominent of which is traffic congestion and traffic accidents. In order to solve the traffic problem, all countries are actively studying the intelligent transportation system, and one of the important research contents of the intelligent transportation system is vehicle detection. Vehicle detection based on vision is to capture vehicle images in the driving environment through a camera, and then use computer vision recognition technology for vehicle detection and recognition. Although computer vision recognition technology has made great progress, how to improve the detection accuracy of the image to be detected is still an important content of visual recognition technology research. Intelligent vehicle visual robust detection and identification of methods of research to reduce the growing incidence of traffic accidents, improve the existing road traffic safety and transportation efficiency, alleviate the degree of driver fatigue problem are of great significance. This paper considers the intelligent vehicle environmental awareness of the key technology to the goal of robust detection and recognition based on machine vision problems for further research. The particle filter is used to extract the local energy of the image to realize the fast segmentation of the region of interest (ROI). In order to further verify the ROI, a measure learning method based on multi-core embedding is proposed, and the semantic classification of ROI is realized by integrating the color, shape and geometric features of ROI. Experimental results show that the algorithm can effectively eliminate false sexy ROI interest, and the algorithm is robust to complex background, illumination changes, perspective changes and other conditions. [ABSTRACT FROM AUTHOR]

Ride hailing services, such as Uber, Lyft, and Grab, have become a major transportation mode in the last decade. The number of current passenger requests is one of the important factors for such services routing and pricing algorithms. Therefore, predicting future passenger request for ride hailing services can boost the efficiency of the service for both drivers and riders by pre-planning the allocation of vehicles and avoiding traffic congestions. Demand forecasting for ride hailing services relies upon the spatial and temporal correlations of its features. The existing literatures mostly divide the target area into rectangular grids (based on the longitude and latitude), consider only adjacent grids for spatial correlation, and calculate demand for each grid independently. An individual grid can contain different regions with high and low demand or have a major part of it outside the land area, which obscures the granularity and precision of estimations and predictions. This paper attempts to mitigate the limitations of grid-based methods by estimating and predicting ride hailing service demand between geographic regions as pickup and destination zones. For predicting demand, a convolutional neural network is integrated with a recurrent autoencoder network to best capture the spatial–temporal correlations of features, including time of the day, month, year, weekend, holiday, pickup zone, destination, and demand. In our experiments, we forecast the demand for each pickup–destination pair for the next day at a certain hour by observing the demands over the past 2 weeks during the same hour in the New York City hire vehicle data set. Using the same model (CNN-biLSTM-AE) to predict demand for geographical regions, it achieved an R 2 of 0.984, while predicting demand for cells in the grid achieved an R 2 0.545. While using the geographical regions instead of grids for partitioning the space, we compared our deep learning model with LSTM, CNN, CNN-LSTM, and LSTM-AE models and observed an improvement in R 2 from 0.632 to 0.767 and an improvement in RMSE from 20.53 to 16.33 against CNN. [ABSTRACT FROM AUTHOR]

Large and expanding cities suffer from a traffic congestion problem that harms the environment, travelers, and the economy. This paper aims to predict short term traffic congestion on a road section of expressway in Delhi city. For this purpose, we first propose a traffic congestion index based on traffic speed and flow. Clustering techniques and the Greenshield's model were used for the derivation of the congestion index. Using this congestion index, congested time intervals of each day and each location of a weekday were identified. This study also introduces a feature series long short-term memory neural network (FSLSTMNN), which links a long short-term memory (LSTM) layer to each feature. It is trained using the many heterogeneous traffic features data collected in Delhi city for the next five minutes of traffic flow and speed prediction. FSLSTMNN achieved the good capability to learn feature series data. We also trained several traditional and deep-learning models using the same traffic data. The FSLSTMNN reduces mean absolute error 12.90% and 17.13%, respectively, in speed and traffic flow prediction compared to the second good-performance long short-term memory neural network (LSTMNN). Finally, traffic congestion is predicted classwise (light, medium, and congested) using the developed congestion index and traffic speed and flow predicted by the FSLSTMNN. Predicted results are consistent with the measured field data. Study results confirm that the developed congestion index and FSLSTMNN can be used successfully to predict traffic congestion. [ABSTRACT FROM AUTHOR]

LTE-Advanced (LTE-A) offloading is concerned about alleviating traffic congestion for the LTE-A network, which includes the core network and the radio access network (RAN). Due to the scarcity of the radio resource, offloading for the LTE-A RAN is more critical, for which an efficient way is to integrate Wi-Fi with LTE-A to form a heterogeneous RAN environment. An LTE-A UE (User Equipment) with the wi-fi interface can therefore access the Internet via an LTE-A base station of Evolved Node B (eNB) or a wi-fi Access Point (AP). In this paper, wireless network selection for UEs with delay-sensitive traffic in the heterogeneous RAN of LTE-A and wi-fi is addressed. Based on the queueing model of M/G/1, a novel network selection and offloading scheme, namely Delay-Sensitive Network Selection and Offloading (DSO), is proposed. The average system time at LTE-A eNBs and wi-fi APs calculated according to M/G/1 is used for network selection as well as offloading operations in DSO. The benefit of DSO in terms of satisfying the delay budget of UEs and load balancing is demonstrated by the simulation study. [ABSTRACT FROM AUTHOR]

The high growth of vehicular travel in urban areas, in particular, requires a traffic control system that optimizes traffic flow efficiency. Traffic congestion can also occur by large de-lays in Red Light etc. The delay in lighting is difficult to code and does not rely on real traffic density. It follows that traffic controls are simulated and configured to better meet this rising demand. So, in order to avoid the traffic control problem, the Adaptive Intelligent Traffic Light control system (AITLCS) has been proposed based on OpenCV and Image processing technique. The system proposed is designed to ensure smooth and efficient traffic flow for daily life as well as emergency and public transportation safety. Based on the road density instead of the levels set the proposed system provides the timing for the traffic light signal so that a highly loaded side switched on over long periods compared with the other lanes. It can also be used at an intersection with traffic signs, which controls the traffic light signal at the intersection. If timers are smart to predict the exact time, the system is more efficient because it reduces the time spent on unintended green signal significantly. With the help of OpenCV software, this paper aims to have a signal management SMART solution that will be cost-effective at the end. The system consists of a camera facing a lane taking pictures of the route we want to travel and then the density of the pedestrian and vehicle is taken and compared with each image employing image processing. Such images are processed effectively to learn the density of traffic. [ABSTRACT FROM AUTHOR]

With the high development of economy and the continuous growth of the population of major cities in the world, the problem of traffic jams has become a serious problem that local governments must solve. In addition, facing the impact of global warming, how to save energy and reduce carbon emission is another critical problem that local governments need to face. An effective smart bus APP can enhance people's satisfaction with the use of the APP while it can increase their willingness to take the bus, thereby reducing the number of people driving their own cars. It is of some help to alleviate the problem of urban traffic congestion. At the same time, it also reduces the total amount of carbon emitted from cars so as to achieve the effects of energy saving and carbon reduction. Therefore, this paper, through questionnaires, gathered opinions from passengers who used the bus APP and established a performance evaluation model of the bus APP. This model can assist the designer or management engineer of the bus APP to find out the service items of the bus APP that need to be improved, in order to make the bus APP more intelligent and efficient to use. [ABSTRACT FROM AUTHOR]

As the key component of wireless network-on-chip (WiNoC), wireless router is required to handle a large number of data packets which could cause network congestion. The congestion not only reduces the network performance, but also results in additional power consumption. In this paper, a low-power WiNoC with congestion-aware wireless node is proposed. Firstly, flit counter unit and address resolution unit are added in wireless interface (WI), which can sense the congestion information and destination address information of each wireless node dynamically. Secondly, through the proposed congestion judgment algorithm, the congestion judgment unit in global network can judge the priority of each wireless node pair and set the highest-priority wireless node pair to use the channel resources preferentially. The mechanism can effectively alleviate the congestion of wireless nodes and ensure the stability of system performance. In addition, a sleep mechanism is utilized to switch off WI which fails in the wireless channel competition. Experimental results show that the proposed scheme can effectively improve the performance in terms of packets' transmission latency and network throughput. [ABSTRACT FROM AUTHOR]

In this paper, the focus is on the role of the municipality, as an enabler of a collaboration between freight forwarders and the municipality in which the consolidation of goods is considered as a means for goods flow improvement in urban freight transportation. We present a cost allocation model that is based on solution concepts from cooperative game theory, for allocating the operational costs associated with the collaboration. It is assumed that the municipality is willing to carry some cost to ensure a stable collaboration for the potential benefits received, e.g., reduced traffic congestion in the city. The model is applied to some illustrative examples, and the cost allocation results are discussed. It is shown that the role of the municipality may be decisive in achieving a stable collaboration between the freight forwarders, and further that the municipality does not necessarily need to contribute to covering the costs. [ABSTRACT FROM AUTHOR]

The congestion caused by ramp overflow has an essential impact on the energy consumption of autonomous vehicles. It is urgent to solve the energy waste of ramp overflow on connected and autonomous vehicles and improve the energy utilization rate. Aiming at the traffic congestion caused by ramp overflow, this paper obtains the data of autonomous vehicles and traffic flow based on vehicle road cooperative perception, analyzes the impact mechanism of vehicle energy consumption, and summarizes the energy consumption modes of autonomous vehicles into three categories. Second, an energy consumption evaluation framework is proposed based on the CSANS strategy. This strategy can make up for the deficiency of constructing neighborhoods within European distance, find important influencing variables on connected and autonomous vehicles' energy consumption, and accurately capture the manifold characteristics of energy consumption data. Finally, flow control is carried out from the macro perspective of traffic engineering to optimize ramp overflow's impact on autonomous vehicles' energy consumption. Through multiple groups of experiments, it has been found that it can effectively reduce the energy consumption of autonomous vehicles. [ABSTRACT FROM AUTHOR]

Multiplex networks have proven to be valuable tools for modeling and analyzing real complex system. Extensive work has been done on the traffic dynamics on multiplex networks, but there remains a lack of sufficient attention towards studying routing strategies for the purpose of suppressing epidemic spreading. In this paper, the impact of global awareness routing (GAR), improved global awareness routing (IGAR), and improved active routing (IAR) strategies on traffic-driven epidemic spreading are investigated. Our findings indicate that in the case of infinite node-delivery capacity and no traffic congestion in the network, adjusting routing parameters can effectively suppress epidemic spreading. In this context, these three strategies show better abilities on the multiplex network built by WS or ER model to minimize the density of infected nodes, thus contributing to the overall inhibition of the epidemic spread. However, in the multiplex network constructed by BA model, GAR strategy has a promoting effect on epidemic spreading compared with the shortest routing strategy. In addition, by controlling traffic flow, limiting node delivery capabilities can contain outbreaks. Our results suggest that adopting appropriate routing strategies in multiplex networks can play a proactive role in controlling epidemic spreading. This is crucial for formulating effective prevention and control measures and improving public health security. [ABSTRACT FROM AUTHOR]

Automated material handling systems (AMHS) have been widely used in semiconductor manufacturing. However, the performance of AMHS heavily hinges on vehicle fleet sizing, which is a complex yet crucial problem. For example, a small fleet size may increase the average wait time, but a large fleet size can also result in traffic congestion. This tradeoff is difficult and can be further exacerbated by profound uncertainty in the manufacturing process. In the literature, the existing models are focused on improving the mean-based performance of AMHS, where the resulting optimal vehicle fleet size is fixed, lacking the ability and flexibility to respond to the changes and/or special requirements that suddenly come up in the manufacturing process. Another drawback with the existing models is that they are not able to characterize the upside/downside risks associated with the resulting vehicle fleet size. This paper, motivated by a real project, presents a novel quantile-based decision model to fill the gap. The adjustment of α values in the proposed decision model allows for agile vehicle fleet sizing according to the production situations, resulting in the satisfactory performance of AMHS. We develop a simulation optimization solution method, called ES-AMHS in short, to enable the efficient derivation of the optimal vehicle fleet size. A comprehensive numerical analysis is conducted to evaluate the efficiency and efficacy of the solution method. Finally, an empirical study in cooperation with a wafer fab in Taiwan is presented to show the practical usefulness of this methodology in a real-world setting. [ABSTRACT FROM AUTHOR]

In this paper, an overview of different analytic queueing models for traffic on road networks is presented. In the literature, it has been shown that queueing models can be used to adequately model uninterrupted traffic flows. This paper gives a broad review on this literature. Moreover, it is shown that the developed published methodologies (which are mainly single node oriented) can be extended towards queueing networks. First, an extension towards queueing networks with infinite buffer sizes is evaluated. Secondly, the assumption of infinite buffer sizes is dropped leading to queueing networks with finite buffer sizes. The impact of the buffer size when comparing the different queueing network methodologies is studied in detail. The paper ends with an analytical application tool to facilitate the optimal positioning of the counting points on a highway. [ABSTRACT FROM AUTHOR]

Embedded distributed multimedia applications based on the use of on-chip networks for communication and messages exchange requires specific and enhanced quality of service (QoS) management. To reach the desired performances at the application level, the network-on-chip (NoC) router should implement per flit handling strategy with wide granularity. This purpose requires an enhanced internal architecture that ensures from one hand a specific management according to a service classification and from the other hand, it enhances the routing process. In this context, this paper proposes a new mechanism for QoS management in NoC. This mechanism is based on the use of central memory where flits are in-queued according to their class of service. This scheme enables an optimal flit scheduling phase and provides more capabilities to drop low important flits when the router shows congestion state symptoms. The paper presents, also, a protocol structure that fills with this architecture and introduces a signaling mechanism to make efficient the QoS management through the proposed architecture. The circuit performances and its adaptability to achieve QoS with low power processing and high bandwidth in on chip multiprocessor systems will be studied in this paper. [ABSTRACT FROM AUTHOR]

In 2004, Yang and co-workers proposed the extraction of bridge frequencies from the dynamic response of a moving test vehicle [Y. B. Yang, C. W. Lin and J. D. Yau, Extracting bridge frequencies from the dynamic response of a passing vehicle, J. Sound Vib. 272 (2004) 471-493] and verified the technique by a field test [C. W. Lin and Y. B. Yang, Use of a passing vehicle to scan the bridge frequencies - An experimental verification, Eng. Struct. 27(13) (2005) 1865-1878]. This technique was extended to construction of mode shapes [Y. B. Yang, Y. C. Li and K. C. Chang, Constructing the mode shapes of a bridge from a passing vehicles: A theoretical study, Smart Struct. Syst. 13(5) (2014) 797-819] and damage identification of bridges. It was referred to as the indirect method for bridge measurement because no vibration sensors are needed for installation on the bridge, but it only requires one or few vibration sensors on the test vehicle. When compared with the conventional direct method that relies fully on the response of the bridge fitted with vibration sensors, the advantage of the indirect method is clear: mobility, economy, and efficiency. Over the past years, many research studies were conducted along the lines of the indirect method for bridge measurement. Significant advances have been made on various aspects of application. This paper represents a state-of-the-art review of the related research works conducted worldwide. Comments and recommendations will be made at proper places, while concluding remarks including future research directions will be presented at the end of the paper. [ABSTRACT FROM AUTHOR]

We consider a class of variational inequality problems with linear constraints, where the mapping is unknown and the system is an oracle. The capacitated traffic congestion pricing problem of transportation is such an application, and many classical methods cannot deal with this class of problems. Note that the cost of the observation (observe the exact solution of the subproblem) is very expensive. It is important to get an inexact solution instead of an exact solution, especially when the iteration is far from the solution set. In this paper, we propose a modified inexact prediction–correction method. Under the mild condition that the underlying mapping is strongly monotone, we prove the global convergence. Some numerical examples are presented to illustrate the efficiency of the inexact strategy. [ABSTRACT FROM AUTHOR]

Online 3D games require fast and efficient user interaction support over the network environments, and the networking support is usually implemented by the use of a network game engine. The network game engine should minimize the network delay and mitigate the network traffic congestion. To minimize the network traffic between game users, a client-based prediction (dead reckoning (DR) algorithm) is used. Each game entity uses the algorithm to estimate its own movement as well as the others'. In case the estimation error exceeds the threshold, the entity sends an UPDATE packet which includes velocity, position and the like to other entities. As the estimation accuracy is increased, each entity can minimize the transmission of the UPDATE packet. In this paper, a Kalman filter-based approach is proposed in order to improve the prediction accuracy and an adaptive Kalman gain control in order to minimize the number of UPDATE packets to distant devices. The BZFlag game was used in the experiment in order to verify the proposed approach and the results have shown that it is possible to increase prediction accuracy and reduce the network traffic by 12%. [ABSTRACT FROM AUTHOR]

In Broadband Wireless Access (BWA) networks, provisioning of Quality of Service (QoS) is absolutely essential for real time and non real time services. Congestion in these networks can lead to deterioration in QoS experienced by the network users. Congestion avoidance is rarely considered to ensure the QoS of wireless connections. Efforts are mainly aimed at reducing the overload once it has occurred. To avoid congestion at the base station in WiMAX networks, the WiMAX Fair Intelligent Congestion Control (WFICC) was proposed to ensure the traffic is scheduled in such a way that the base station output buffer operates around a target operating point without violating the QoS requirements of connections. The aim of this paper is to investigate WFICC thoroughly and evaluate its performance in terms of throughput, delay and jitter for different Classes of Services (CoSs) under various parameter settings of the algorithm. A detailed and comprehensive simulation study on various settings of parameters is performed in ns-2. The results show that WFICC performs excellently in allocating resources fairly among Class of Services (CoSs) and also preserves their QoS requirements. Furthermore, WFICC is robust and easily adapted to various traffic conditions. [ABSTRACT FROM AUTHOR]

Traffic flow information can be employed in an intelligent transportation system to detect and manage traffic congestion. One of the key elements in determining the traffic flow information is traffic density estimation. The goal of traffic density estimation is to determine the density of vehicles on a given road from loop detectors, traffic radars, or surveillance cameras. However, due to the inflexibility of deploying loop detectors and traffic radars, there is a growing trend of using video-content-understanding technique to determine the traffic flow from a surveillance camera. But difficulties arise when attempting to do this in real-time under changing illumination and weather conditions as well as heavy traffic congestions. In this paper, we attempt to address the problem of real-time traffic density estimation by using a stochastic model called Hidden Markov Models (HMM) to probabilistically determine the traffic density state. Choosing a good set of model parameters for HMMs has a significant impact on the accuracy of traffic density estimation. Thus, we propose a novel feature extraction scheme to represent traffic density, and a novel approach to initialize and construct the HMMs by using an unsupervised clustering technique called AutoClass. We show through extensive experiments that our proposed real-time algorithm achieves an average traffic density estimation accuracy of 96.6% over various different illumination and weather conditions. [ABSTRACT FROM AUTHOR]

Traffic congestion degrades not only the user-perceived Quality-of-Service (QoS), such as leading to high packet loss rates, low throughput, and increased delays, but also causes excessive energy consumption in energy-sensitive systems (e.g., wireless sensor networks). A simple way to detect congestion is to monitor and measure queue length in network nodes or routers. This paper develops an analytical performance model for a finite capacity queueing system with an enhanced Random Early Detection (RED) congestion control scheme based on the instantaneous queue length in the presence of differentiated classes of bursty traffic. The aggregate traffic is captured by the superposition of 2-state Markov Modulated Poisson Processes (MMPP). The individual threshold is assigned to each traffic class in order to differentially control traffic injection rate. The accuracy of this model is verified by comparing the analytical results against those obtained from simulation experiments. The model is adopted to investigate the effects of traffic burstiness and system capacity on the performance of the congestion control scheme. [ABSTRACT FROM AUTHOR]

In the metropolitan region, most congestion or traffic jams are caused by the uneven distribution of traffic flow that creates bottleneck points where the traffic volume exceeds the road capacity. Additionally, unexpected incidents are the next most probable cause of these bottleneck regions. Moreover, most drivers are driving based on their empirical experience without awareness of real-time traffic situations. This unintelligent traffic behavior can make the congestion problem worse. Prediction based route guidance systems show great improvements in solving the inefficient diversion strategy problem by estimating future travel time when calculating accurate travel time is difficult. However, performances of machine learning based prediction models that are based on the historical data set degrade sharply during a congestion situation. This paper develops a new navigation system for reducing travel time of an individual driver and distributing the flow of urban traffic efficiently in order to reduce the occurrence of congestion. Compared with previous route guidance systems, the results reveal that our system, applying the advanced multi-lane prediction based real-time fastest path (AMPRFP) algorithm, can significantly reduce the travel time especially when drivers travel in a complex route environment and face frequent congestion problems. Unlike the previous system,1 it can be applied either for single lane or multi-lane urban traffic networks where the reason for congestion is significantly complex. We also demonstrate the advantages of this system and verify the results using real highway traffic data and a synthetic experiment. [ABSTRACT FROM AUTHOR]

Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper, we address this question by using numerical models in which both structure and dynamics are controlled systematically. We consider the traffic of information packets that include driving, searching and queuing. We present the results of extensive simulations on two classes of networks; a correlated cyclic scale-free network and an uncorrelated homogeneous weakly clustered network. By measuring different dynamical variables in the free flow regime we show how the global statistical properties of the transport are related to the temporal fluctuations at individual nodes (the traffic noise) and the links (the traffic flow). We then demonstrate that these two network classes appear as representative topologies for optimal traffic flow in the regimes of low density and high density traffic, respectively. We also determine statistical indicators of the pre-jamming regime on different network geometries and discuss the role of queuing and dynamical betweenness for the traffic congestion. The transition to the jammed traffic regime at a critical posting rate on different network topologies is studied as a phase transition with an appropriate order parameter. We also address several open theoretical problems related to the network dynamics. [ABSTRACT FROM AUTHOR]

The growing number of automobiles on the road has now become a significant source of traffic, accidents, and pollution. Intelligent Transportation Systems (ITSs) could be the key to finding solutions that drastically reduce these issues. The linked vehicular networks channel is a fast-expanding topic for workflow management system and development. Traffic detection is a big issue on city streets. To make informed decisions in order to prevent traffic jams, one of the solutions is the Vehicular Ad-Hoc Network (VANET). We describe an approach for detecting traffic jams in both vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication, which provides vehicle drivers with multiple alternatives for determining the location of congestion, its size, and how to prevent becoming stuck in a traffic jam. The data are sent to the driver to assist him in making the appropriate selection. Delivering Quality of Service (QoS) for automotive networks is a difficult challenge due to the characteristics such as terms of transmission or high mobility, congested and fragmented channels, hardware defects, and a large number of vehicular devices. As a result, it is extremely desired to get and distribute resources efficiently. This research uses Reinforcement Learning with Decision-Making Model (RLDMM) method to enhance channel allocation. By using latency, Signal-to-Interference Ratio (SIR) and QoS, the available channel is initially determined. This method is used to determine suitable channel for platoon members. As a result, the proposed RLDMM achieves an SINR reduction of 29 Db, 69 kbps of throughput, 21.4% of collision probability with 4 ms of latency. [ABSTRACT FROM AUTHOR]

We present a deterministic model that specifies lane direction in a multi-laned bridge that has a movable barrier that divides the two directions of traffic flow, in order to reduce congestion. A probabilistic dynamic programming formulation for a stochastic extension of the model is also presented. Analysis of the special structure of the dynamic programming formulation provides new insights into important aspects of certain traffic planning problems and represents a useful addition to the traffic network planner's toolkit. A case study involving the lane direction management of an actual bridge is also provided. [ABSTRACT FROM AUTHOR]

Develops a numerical method to solve the user equilibrium simultaneous departure time and route choice problem on congested general traffic networks. Basis of the method on diagonalization algorithm which has been used to solve general variational inequities; Solution for the diagonalized problem using the Frank-Wolfe method.

Since all the existing real world networks are evolving, the study of traffic dynamics is a challenging task. Avoidance of traffic congestion, system utility maximization and enhancement of network capacity are prominent issues. Network capacity may be improved either by optimizing network topology or enhancing in routing approach. In this context, we propose and design a model of the time-varying data communication networks (TVCN) based on the dynamics of inflowing links. Traffic congestion can be avoided by using a suitable centrality measure, especially betweenness and Eigen vector centralities. If the nodes coming in user’s route are most betweenness central, then that route will be highly congested. Eigen vector centrality is used to find the influence of a node on others. If a node is most influential, then it will be highly congested and considered as least reputed. For that reason, routes are chosen such that the sum of the centralities of the nodes coming in user’s route should be minimum. Furthermore, Kelly’s optimization formulation for a rate allocation problem is used for obtaining optimal rates of distinct users at different time instants and it is found that the user’s path with lowest betweenness centrality and highest reputation will always give maximum rate at the stable point. [ABSTRACT FROM AUTHOR]

The central points of communication network flow have often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the underlying network structure. In this work we investigate the relationship between centrality measures and the density of traffic for some simple particle hopping models on networks with emerging scale-free degree distributions. We also study how the speed of the dynamics are affected by the underlying network structure. Among other conclusions, we find that, even at low traffic densities, the dynamical measure of traffic density (the occupation ratio) has a non-trivial dependence on the static centrality (quantified by "betweenness centrality"), where non-central vertices get a comparatively large portion of the traffic. [ABSTRACT FROM AUTHOR]