3,467 research outputs found
Defeating jamming with the power of silence: a game-theoretic analysis
The timing channel is a logical communication channel in which information is
encoded in the timing between events. Recently, the use of the timing channel
has been proposed as a countermeasure to reactive jamming attacks performed by
an energy-constrained malicious node. In fact, whilst a jammer is able to
disrupt the information contained in the attacked packets, timing information
cannot be jammed and, therefore, timing channels can be exploited to deliver
information to the receiver even on a jammed channel.
Since the nodes under attack and the jammer have conflicting interests, their
interactions can be modeled by means of game theory. Accordingly, in this paper
a game-theoretic model of the interactions between nodes exploiting the timing
channel to achieve resilience to jamming attacks and a jammer is derived and
analyzed. More specifically, the Nash equilibrium is studied in the terms of
existence, uniqueness, and convergence under best response dynamics.
Furthermore, the case in which the communication nodes set their strategy and
the jammer reacts accordingly is modeled and analyzed as a Stackelberg game, by
considering both perfect and imperfect knowledge of the jammer's utility
function. Extensive numerical results are presented, showing the impact of
network parameters on the system performance.Comment: Anti-jamming, Timing Channel, Game-Theoretic Models, Nash Equilibriu
To Harvest and Jam: A Paradigm of Self-Sustaining Friendly Jammers for Secure AF Relaying
This paper studies the use of multi-antenna harvest-and-jam (HJ) helpers in a
multi-antenna amplify-and-forward (AF) relay wiretap channel assuming that the
direct link between the source and destination is broken. Our objective is to
maximize the secrecy rate at the destination subject to the transmit power
constraints of the AF relay and the HJ helpers. In the case of perfect channel
state information (CSI), the joint optimization of the artificial noise (AN)
covariance matrix for cooperative jamming and the AF beamforming matrix is
studied using semi-definite relaxation (SDR) which is tight, while suboptimal
solutions are also devised with lower complexity. For the imperfect CSI case,
we provide the equivalent reformulation of the worst-case robust optimization
to maximize the minimum achievable secrecy rate. Inspired by the optimal
solution to the case of perfect CSI, a suboptimal robust scheme is proposed
striking a good tradeoff between complexity and performance. Finally, numerical
results for various settings are provided to evaluate the proposed schemes.Comment: 16 pages (double column), 8 figures, submitted for possible journal
publicatio
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
Efficient Wireless Security Through Jamming, Coding and Routing
There is a rich recent literature on how to assist secure communication
between a single transmitter and receiver at the physical layer of wireless
networks through techniques such as cooperative jamming. In this paper, we
consider how these single-hop physical layer security techniques can be
extended to multi-hop wireless networks and show how to augment physical layer
security techniques with higher layer network mechanisms such as coding and
routing. Specifically, we consider the secure minimum energy routing problem,
in which the objective is to compute a minimum energy path between two network
nodes subject to constraints on the end-to-end communication secrecy and
goodput over the path. This problem is formulated as a constrained optimization
of transmission power and link selection, which is proved to be NP-hard.
Nevertheless, we show that efficient algorithms exist to compute both exact and
approximate solutions for the problem. In particular, we develop an exact
solution of pseudo-polynomial complexity, as well as an epsilon-optimal
approximation of polynomial complexity. Simulation results are also provided to
show the utility of our algorithms and quantify their energy savings compared
to a combination of (standard) security-agnostic minimum energy routing and
physical layer security. In the simulated scenarios, we observe that, by
jointly optimizing link selection at the network layer and cooperative jamming
at the physical layer, our algorithms reduce the network energy consumption by
half
- …