1,509 research outputs found
On the Security of the Automatic Dependent Surveillance-Broadcast Protocol
Automatic dependent surveillance-broadcast (ADS-B) is the communications
protocol currently being rolled out as part of next generation air
transportation systems. As the heart of modern air traffic control, it will
play an essential role in the protection of two billion passengers per year,
besides being crucial to many other interest groups in aviation. The inherent
lack of security measures in the ADS-B protocol has long been a topic in both
the aviation circles and in the academic community. Due to recently published
proof-of-concept attacks, the topic is becoming ever more pressing, especially
with the deadline for mandatory implementation in most airspaces fast
approaching.
This survey first summarizes the attacks and problems that have been reported
in relation to ADS-B security. Thereafter, it surveys both the theoretical and
practical efforts which have been previously conducted concerning these issues,
including possible countermeasures. In addition, the survey seeks to go beyond
the current state of the art and gives a detailed assessment of security
measures which have been developed more generally for related wireless networks
such as sensor networks and vehicular ad hoc networks, including a taxonomy of
all considered approaches.Comment: Survey, 22 Pages, 21 Figure
Interference and Throughput in Aloha-based Ad Hoc Networks with Isotropic Node Distribution
We study the interference and outage statistics in a slotted Aloha ad hoc
network, where the spatial distribution of nodes is non-stationary and
isotropic. In such a network, outage probability and local throughput depend on
both the particular location in the network and the shape of the spatial
distribution. We derive in closed-form certain distributional properties of the
interference that are important for analyzing wireless networks as a function
of the location and the spatial shape. Our results focus on path loss exponents
2 and 4, the former case not being analyzable before due to the stationarity
assumption of the spatial node distribution. We propose two metrics for
measuring local throughput in non-stationary networks and discuss how our
findings can be applied to both analysis and optimization.Comment: 5 pages, 3 figures. To appear in International Symposium on
Information Theory (ISIT) 201
Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad-hoc Networks
In dynamic wireless ad-hoc networks (DynWANs), autonomous computing devices
set up a network for the communication needs of the moment. These networks
require the implementation of a medium access control (MAC) layer. We consider
MAC protocols for DynWANs that need to be autonomous and robust as well as have
high bandwidth utilization, high predictability degree of bandwidth allocation,
and low communication delay in the presence of frequent topological changes to
the communication network. Recent studies have shown that existing
implementations cannot guarantee the necessary satisfaction of these timing
requirements. We propose a self-stabilizing MAC algorithm for DynWANs that
guarantees a short convergence period, and by that, it can facilitate the
satisfaction of severe timing requirements, such as the above. Besides the
contribution in the algorithmic front of research, we expect that our proposal
can enable quicker adoption by practitioners and faster deployment of DynWANs
that are subject changes in the network topology
Optimal fault-tolerant placement of relay nodes in a mission critical wireless network
The operations of many critical infrastructures (e.g., airports) heavily depend on proper functioning of the radio communication network supporting operations. As a result, such a communication network is indeed a mission-critical communication network that needs adequate protection from external electromagnetic interferences. This is usually done through radiogoniometers. Basically, by using at least three suitably deployed radiogoniometers and a gateway gathering information from them, sources of electromagnetic emissions that are not supposed to be present in the monitored area can be localised. Typically, relay nodes are used to connect radiogoniometers to the gateway. As a result, some degree of fault-tolerance for the network of relay nodes is essential in order to offer a reliable monitoring. On the other hand, deployment of relay nodes is typically quite expensive. As a result, we have two conflicting requirements: minimise costs while guaranteeing a given fault-tolerance. In this paper address the problem of computing a deployment for relay nodes that minimises the relay node network cost while at the same time guaranteeing proper working of the network even when some of the relay nodes (up to a given maximum number) become faulty (fault-tolerance). We show that the above problem can be formulated as a Mixed Integer Linear Programming (MILP) as well as a Pseudo-Boolean Satisfiability (PB-SAT) optimisation problem and present experimental results com- paring the two approaches on realistic scenarios
- …