2,086 research outputs found
Opportunistic Secrecy with a Strict Delay Constraint
We investigate the delay limited secrecy capacity of the flat fading channel
under two different assumptions on the available transmitter channel state
information (CSI). The first scenario assumes perfect prior knowledge of both
the main and eavesdropper channel gains. Here, upper and lower bounds on the
delay limited secrecy capacity are derived, and shown to be tight in the high
signal-to-noise ratio (SNR) regime. In the second scenario, only the main
channel CSI is assumed to be available at the transmitter where, remarkably, we
establish the achievability of a non-zero delay-limited secure rate, for a wide
class of channel distributions, with a high probability. In the two cases, our
achievability arguments are based on a novel two-stage key-sharing approach
that overcomes the secrecy outage phenomenon observed in earlier works.Comment: Submitted to IEEE Transactions on Information Theor
Performance analysis with network-enhanced complexities: On fading measurements, event-triggered mechanisms, and cyber attacks
Copyright © 2014 Derui Ding et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Nowadays, the real-world systems are usually subject to various complexities such as parameter uncertainties, time-delays, and nonlinear disturbances. For networked systems, especially large-scale systems such as multiagent systems and systems over sensor networks, the complexities are inevitably enhanced in terms of their degrees or intensities because of the usage of the communication networks. Therefore, it would be interesting to (1) examine how this kind of network-enhanced complexities affects the control or filtering performance; and (2) develop some suitable approaches for controller/filter design problems. In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered mechanisms, and attack behaviors of adversaries. First, these three kinds of complexities are introduced in detail according to their engineering backgrounds, dynamical characteristic, and modelling techniques. Then, the developments of the performance analysis and synthesis issues for various networked systems are systematically reviewed. Furthermore, some challenges are illustrated by using a thorough literature review and some possible future research directions are highlighted.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
On the Delay Limited Secrecy Capacity of Fading Channels
In this paper, the delay limited secrecy capacity of the flat fading channel
is investigated under two different assumptions on the available transmitter
channel state information (CSI). The first scenario assumes perfect prior
knowledge of both the main and eavesdropper channel gains. Here, upper and
lower bounds on the secure delay limited capacity are derived and shown to be
tight in the high signal-to-noise ratio (SNR) regime (for a wide class of
channel distributions). In the second scenario, only the main channel CSI is
assumed to be available at the transmitter. Remarkably, under this assumption,
we establish the achievability of non-zero secure rate (for a wide class of
channel distributions) under a strict delay constraint. In the two cases, our
achievability arguments are based on a novel two-stage approach that overcomes
the secrecy outage phenomenon observed in earlier works.Comment: Proceedings of the 2009 IEEE International Symposium on Information
Theory (ISIT 2009), Seoul, Korea, June 28-July 3, 200
- …