Related papers: Integrating static and dynamic information for rou…
In this paper, we present a cyclically time-expanded network model for simultaneous optimization of traffic assignment and traffic signal parameters, in particular offsets, split times, and phase orders. Since travel times are of great…
We model information traffic on scale-free networks by introducing the bandwidth as the delivering ability of links. We focus on the effects of bandwidth on the packet delivering ability of the traffic system to better understand traffic…
The optimal information feedback has a significant effect on many socioeconomic systems like stock market and traffic systems aiming to make full use of resources. In this paper, we studied dynamics of traffic flow with real-time…
In this paper, urban traffic is modeled using dual graph representation of urban transportation network where roads are mapped to nodes and intersections are mapped to links. The proposed model considers both the navigation of vehicles on…
Motivated by the fact that intelligent traffic control systems have become inevitable demand to cope with the risk of traffic congestion in urban areas, this paper develops a distributed control strategy for urban traffic networks. Since…
In this paper, we present a hierarchical framework that integrates upper-level routing with low-level optimal trajectory planning for connected and automated vehicles (CAVs) traveling in an urban network. The upper-level controller…
We propose a limited packet-delivering capacity model for traffic dynamics in scale-free networks. In this model, the total node's packet-delivering capacity is fixed, and the allocation of packet-delivering capacity on node $i$ is…
We introduce a model of information packet transport on networks in which the packets are posted by a given rate and move in parallel according to a local search algorithm. By performing a number of simulations we investigate the major…
This essay provides a comprehensive analysis of the optimization and performance evaluation of various routing algorithms within the context of computer networks. Routing algorithms are critical for determining the most efficient path for…
In this paper, we reveal the relationship between entropy rate and the congestion in complex network and solve it analytically for special cases. Finding maximizing entropy rate will lead to an improvement of traffic efficiency, we propose…
In this paper, we study traffic dynamics in scale-free networks in which packets are generated with non-homogeneously selected sources and destinations, and forwarded based on the local routing strategy. We consider two situations of packet…
The multiple access scheduling decides how the channel is shared among the nodes in the network. Typical scheduling algorithms aims at increasing the channel utilization and thereby throughput of the network. This paper describes several…
In this work, we face the issue of achieving an efficient dynamic mapping in vehicular networking scenarios, i.e., to obtain an accurate estimate of the positions and trajectories of connected vehicles in a certain area. State of the art…
We present a simple yet effective routing strategy inspired by coverage control, which delays the onset of congestion on traffic networks, by introducing a control parameter. The routing algorithm allows a trade-off between the congestion…
Controlling and coordinating urban traffic flow through robot vehicles is emerging as a novel transportation paradigm for the future. While this approach garners growing attention from researchers and practitioners, effectively managing and…
Coordination of dynamical routes can alleviate traffic congestion and is essential for the coming era of autonomous self-driving cars. However, dynamical route coordination is difficult and many existing routing protocols are either static…
For realistic scale-free networks, we investigate the traffic properties of stochastic routing inspired by a zero-range process known in statistical physics. By parameters $\alpha$ and $\delta$, this model controls degree-dependent hopping…
The transport capacity of a communication network can be characterized by the transition from a free-flow state to a congested state. Here, we propose a dynamic routing strategy in complex networks based on hierarchical bypass selections.…
We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algorithm balances network traffic iteratively by minimizing the…
Traffic congestion has lead to an increasing emphasis on management measures for a more efficient utilization of existing infrastructure. In this context, this paper proposes a novel framework that integrates real-time optimization of…