545,555 research outputs found
Parameter estimation for stochastic hybrid model applied to urban traffic flow estimation
This study proposes a novel data-based approach for estimating the parameters of a stochastic hybrid model describing the traffic flow in an urban traffic network with signalized intersections. The model represents the evolution of the traffic flow rate, measuring the number of vehicles passing a given location per time unit. This traffic flow rate is described using a mode-dependent first-order autoregressive (AR) stochastic process. The parameters of the AR process take different values depending on the mode of traffic operation – free flowing, congested or faulty – making this a hybrid stochastic process. Mode switching occurs according to a first-order Markov chain. This study proposes an expectation-maximization (EM) technique for estimating the transition matrix of this Markovian mode process and the parameters of the AR models for each mode. The technique is applied to actual traffic flow data from the city of Jakarta, Indonesia. The model thus obtained is validated by using the smoothed inference algorithms and an online particle filter. The authors also develop an EM parameter estimation that, in combination with a time-window shift technique, can be useful and practical for periodically updating the parameters of hybrid model leading to an adaptive traffic flow state estimator
The Methods to Improve Quality of Service by Accounting Secure Parameters
A solution to the problem of ensuring quality of service, providing a greater
number of services with higher efficiency taking into account network security
is proposed. In this paper, experiments were conducted to analyze the effect of
self-similarity and attacks on the quality of service parameters. Method of
buffering and control of channel capacity and calculating of routing cost
method in the network, which take into account the parameters of traffic
multifractality and the probability of detecting attacks in telecommunications
networks were proposed. The both proposed methods accounting the given
restrictions on the delay time and the number of lost packets for every type
quality of service traffic. During simulation the parameters of transmitted
traffic (self-similarity, intensity) and the parameters of network (current
channel load, node buffer size) were changed and the maximum allowable load of
network was determined. The results of analysis show that occurrence of
overload when transmitting traffic over a switched channel associated with
multifractal traffic characteristics and presence of attack. It was shown that
proposed methods can reduce the lost data and improve the efficiency of network
resources.Comment: 10 pages, 1 figure, 1 equation, 1 table. arXiv admin note: text
overlap with arXiv:1904.0520
Performance Comparison of Contention- and Schedule-based MAC Protocols in Urban Parking Sensor Networks
Network traffic model is a critical problem for urban applications, mainly
because of its diversity and node density. As wireless sensor network is highly
concerned with the development of smart cities, careful consideration to
traffic model helps choose appropriate protocols and adapt network parameters
to reach best performances on energy-latency tradeoffs. In this paper, we
compare the performance of two off-the-shelf medium access control protocols on
two different kinds of traffic models, and then evaluate their application-end
information delay and energy consumption while varying traffic parameters and
network density. From the simulation results, we highlight some limits induced
by network density and occurrence frequency of event-driven applications. When
it comes to realtime urban services, a protocol selection shall be taken into
account - even dynamically - with a special attention to energy-delay tradeoff.
To this end, we provide several insights on parking sensor networks.Comment: ACM International Workshop on Wireless and Mobile Technologies for
Smart Cities (WiMobCity) (2014
Kinetic derivation of a Hamilton-Jacobi traffic flow model
Kinetic models for vehicular traffic are reviewed and considered from the
point of view of deriving macroscopic equations. A derivation of the associated
macroscopic traffic flow equations leads to different types of equations: in
certain situations modified Aw-Rascle equations are obtained. On the other
hand, for several choices of kinetic parameters new Hamilton-Jacobi type
traffic equations are found. Associated microscopic models are discussed and
numerical experiments are presented discussing several situations for highway
traffic and comparing the different models
Three-phase traffic theory and two-phase models with a fundamental diagram in the light of empirical stylized facts
Despite the availability of large empirical data sets and the long history of
traffic modeling, the theory of traffic congestion on freeways is still highly
controversial. In this contribution, we compare Kerner's three-phase traffic
theory with the phase diagram approach for traffic models with a fundamental
diagram. We discuss the inconsistent use of the term "traffic phase" and show
that patterns demanded by three-phase traffic theory can be reproduced with
simple two-phase models, if the model parameters are suitably specified and
factors characteristic for real traffic flows are considered, such as effects
of noise or heterogeneity or the actual freeway design (e.g. combinations of
off- and on-ramps). Conversely, we demonstrate that models created to reproduce
three-phase traffic theory create similar spatiotemporal traffic states and
associated phase diagrams, no matter whether the parameters imply a fundamental
diagram in equilibrium or non-unique flow- density relationships. In
conclusion, there are different ways of reproducing the empirical stylized
facts of spatiotemporal congestion patterns summarized in this contribution,
and it appears possible to overcome the controversy by a more precise
definition of the scientific terms and a more careful comparison of models and
data, considering effects of the measurement process and the right level of
detail in the traffic model used.Comment: 18 pages in the published article, 13 figures, 2 table
Two-lane traffic-flow model with an exact steady-state solution
We propose a stochastic cellular-automaton model for two-lane traffic flow
based on the misanthrope process in one dimension. The misanthrope process is a
stochastic process allowing for an exact steady-state solution; hence we have
an exact flow-density diagram for two lane traffic. In addition, we introduce
two parameters that indicate respectively driver's driving-lane preference and
passing-lane priority. Due to the additional parameters, the model shows a
deviation of the density ratio for driving-lane use and a biased
lane-efficiency in flow. Then, a mean-field approach explicitly describes the
asymmetric flow by the hop rates, the driving-lane preference, and the
passing-lane priority. Meanwhile, the simulation results are in good agreement
with an observational data, and we thus estimate these parameters. We conclude
that the proposed model successfully produces two-lane traffic flow
particularly with the driving-lane preference and the passing-lane priority.Comment: 8 pages, 3 figure
- …
