16,335 research outputs found
Analyzing Attacks on Cooperative Adaptive Cruise Control (CACC)
Cooperative Adaptive Cruise Control (CACC) is one of the driving applications
of vehicular ad-hoc networks (VANETs) and promises to bring more efficient and
faster transportation through cooperative behavior between vehicles. In CACC,
vehicles exchange information, which is relied on to partially automate
driving; however, this reliance on cooperation requires resilience against
attacks and other forms of misbehavior. In this paper, we propose a rigorous
attacker model and an evaluation framework for this resilience by quantifying
the attack impact, providing the necessary tools to compare controller
resilience and attack effectiveness simultaneously. Although there are
significant differences between the resilience of the three analyzed
controllers, we show that each can be attacked effectively and easily through
either jamming or data injection. Our results suggest a combination of
misbehavior detection and resilient control algorithms with graceful
degradation are necessary ingredients for secure and safe platoons.Comment: 8 pages (author version), 5 Figures, Accepted at 2017 IEEE Vehicular
Networking Conference (VNC
Disturbance Observer-based Robust Control and Its Applications: 35th Anniversary Overview
Disturbance Observer has been one of the most widely used robust control
tools since it was proposed in 1983. This paper introduces the origins of
Disturbance Observer and presents a survey of the major results on Disturbance
Observer-based robust control in the last thirty-five years. Furthermore, it
explains the analysis and synthesis techniques of Disturbance Observer-based
robust control for linear and nonlinear systems by using a unified framework.
In the last section, this paper presents concluding remarks on Disturbance
Observer-based robust control and its engineering applications.Comment: 12 pages, 4 figure
Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks
The performance of computer networks relies on how bandwidth is shared among
different flows. Fair resource allocation is a challenging problem particularly
when the flows evolve over time. To address this issue, bandwidth sharing
techniques that quickly react to the traffic fluctuations are of interest,
especially in large scale settings with hundreds of nodes and thousands of
flows. In this context, we propose a distributed algorithm based on the
Alternating Direction Method of Multipliers (ADMM) that tackles the multi-path
fair resource allocation problem in a distributed SDN control architecture. Our
ADMM-based algorithm continuously generates a sequence of resource allocation
solutions converging to the fair allocation while always remaining feasible, a
property that standard primal-dual decomposition methods often lack. Thanks to
the distribution of all computer intensive operations, we demonstrate that we
can handle large instances at scale
Radio Galaxy Zoo: Knowledge Transfer Using Rotationally Invariant Self-Organising Maps
With the advent of large scale surveys the manual analysis and classification
of individual radio source morphologies is rendered impossible as existing
approaches do not scale. The analysis of complex morphological features in the
spatial domain is a particularly important task. Here we discuss the challenges
of transferring crowdsourced labels obtained from the Radio Galaxy Zoo project
and introduce a proper transfer mechanism via quantile random forest
regression. By using parallelized rotation and flipping invariant Kohonen-maps,
image cubes of Radio Galaxy Zoo selected galaxies formed from the FIRST radio
continuum and WISE infrared all sky surveys are first projected down to a
two-dimensional embedding in an unsupervised way. This embedding can be seen as
a discretised space of shapes with the coordinates reflecting morphological
features as expressed by the automatically derived prototypes. We find that
these prototypes have reconstructed physically meaningful processes across two
channel images at radio and infrared wavelengths in an unsupervised manner. In
the second step, images are compared with those prototypes to create a
heat-map, which is the morphological fingerprint of each object and the basis
for transferring the user generated labels. These heat-maps have reduced the
feature space by a factor of 248 and are able to be used as the basis for
subsequent ML methods. Using an ensemble of decision trees we achieve upwards
of 85.7% and 80.7% accuracy when predicting the number of components and peaks
in an image, respectively, using these heat-maps. We also question the
currently used discrete classification schema and introduce a continuous scale
that better reflects the uncertainty in transition between two classes, caused
by sensitivity and resolution limits
- …