690 research outputs found
Covert Wireless Communication with a Poisson Field of Interferers
In this paper, we study covert communication in wireless networks consisting
of a transmitter, Alice, an intended receiver, Bob, a warden, Willie, and a
Poisson field of interferers. Bob and Willie are subject to uncertain shot
noise due to the ambient signals from interferers in the network. With the aid
of stochastic geometry, we analyze the throughput of the covert communication
between Alice and Bob subject to given requirements on the covertness against
Willie and the reliability of decoding at Bob. We consider non-fading and
fading channels. We analytically obtain interesting findings on the impacts of
the density and the transmit power of the concurrent interferers on the covert
throughput. That is, the density and the transmit power of the interferers have
no impact on the covert throughput as long as the network stays in the
interference-limited regime, for both the non-fading and the fading cases. When
the interference is sufficiently small and comparable with the receiver noise,
the covert throughput increases as the density or the transmit power of the
concurrent interferers increases
Securing Large-Scale D2D Networks Using Covert Communication and Friendly Jamming
We exploit both covert communication and friendly jamming to propose a
friendly jamming-assisted covert communication and use it to doubly secure a
large-scale device-to-device (D2D) network against eavesdroppers (i.e.,
wardens). The D2D transmitters defend against the wardens by: 1) hiding their
transmissions with enhanced covert communication, and 2) leveraging friendly
jamming to ensure information secrecy even if the D2D transmissions are
detected. We model the combat between the wardens and the D2D network (the
transmitters and the friendly jammers) as a two-stage Stackelberg game.
Therein, the wardens are the followers at the lower stage aiming to minimize
their detection errors, and the D2D network is the leader at the upper stage
aiming to maximize its utility (in terms of link reliability and communication
security) subject to the constraint on communication covertness. We apply
stochastic geometry to model the network spatial configuration so as to conduct
a system-level study. We develop a bi-level optimization algorithm to search
for the equilibrium of the proposed Stackelberg game based on the successive
convex approximation (SCA) method and Rosenbrock method. Numerical results
reveal interesting insights. We observe that without the assistance from the
jammers, it is difficult to achieve covert communication on D2D transmission.
Moreover, we illustrate the advantages of the proposed friendly
jamming-assisted covert communication by comparing it with the
information-theoretical secrecy approach in terms of the secure communication
probability and network utility
Achieving Covert Communication in Large-Scale SWIPT-Enabled D2D Networks
We aim to secure a large-scale device-to-device (D2D) network against
adversaries. The D2D network underlays a downlink cellular network to reuse the
cellular spectrum and is enabled for simultaneous wireless information and
power transfer (SWIPT). In the D2D network, the transmitters communicate with
the receivers, and the receivers extract information and energy from their
received radio-frequency (RF) signals. In the meantime, the adversaries aim to
detect the D2D transmission. The D2D network applies power control and
leverages the cellular signal to achieve covert communication (i.e., hide the
presence of transmissions) so as to defend against the adversaries. We model
the interaction between the D2D network and adversaries by using a two-stage
Stackelberg game. Therein, the adversaries are the followers minimizing their
detection errors at the lower stage and the D2D network is the leader
maximizing its network utility constrained by the communication covertness and
power outage at the upper stage. Both power splitting (PS)-based and time
switch (TS)-based SWIPT schemes are explored. We characterize the spatial
configuration of the large-scale D2D network, adversaries, and cellular network
by stochastic geometry. We analyze the adversary's detection error minimization
problem and adopt the Rosenbrock method to solve it, where the obtained
solution is the best response from the lower stage. Taking into account the
best response from the lower stage, we develop a bi-level algorithm to solve
the D2D network's constrained network utility maximization problem and obtain
the Stackelberg equilibrium. We present numerical results to reveal interesting
insights
Covert Communications in the RF Band of Primary Wireless Networks
Covert systems are designed to operate at a low probability of detection (LPD) in order to provide system protection at the physical layer level. The classical approach to covert communications aims at hiding the covert signal in noise by lowering the power spectral density of the signal to a level that makes it indistinguishable from that of the noise. However, the increasing demand for modern covert systems that can provide better protection against intercept receivers (IRs) and provides higher data rates has shifted the focus to the design of Ad-Hoc covert networks (ACNs) that can hide their transmission in the RF spectrum of primary networks (PNs), like mobile networks. The early work on exploiting the RF band of other wireless systems has been promising; however, the difficulties in modeling such environments, analyzing the impact on/from the primary network, and deriving closed form expressions for the performance of the covert network have limited the work on this crucial subject. In this work, we provide the first comprehensive analyses of a covert network that exploits the RF band of an OFDM-based primary network to achieve covertness. A spectrum access algorithm is presented which would allow the ACN to transmit in the RF spectrum of the PN with minimum interference. Next, we use stochastic geometry to model both the OFDM-based PN as well as the ACN. Using stochastic geometry would also allow us to derive closed-form expressions and provide a comprehensive analysis for two metrics, namely an aggregate metric and a ratio metric. These two metrics quantify the covertness and performance of the covert network from the perspective of the IR and the ACN, respectively. The two metrics are used to determine the detectability limits of an ACN by an IR. The two metrics along with the proposed spectrum access algorithm will be used to provide a comprehensive discussion on how to design the ACN for a target covertness level, and analyze the effect of the PN parameters on the ACN expected performance. This work also addresses the question of trade-off between the ACN covertness and its achievable throughput. The overall discussion and results in this research work illustrate the strong potential for using man-made transmissions as a mask for covert communications. In addition, some of our results can be directly used for other applications such as device-to-device (D2D) and vehicle-to-everything (V2X) communications
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
- …