1,303 research outputs found
Secure Compute-and-Forward Transmission With Artificial Noise and Full-Duplex Devices
We consider a wiretap channel with an eavesdropper (Eve) and an honest but
curious relay (Ray). Ray and the destination (Bob) are full-duplex (FD)
devices. Since we aim at not revealing information on the secret message to the
relay, we consider the scaled compute-and-forward (SCF) where scaled lattice
coding is used in the transmission by both the source (Alice) and Bob in order
to allow Ray to decode only a linear combination of the two messages. At the
same time Ray transmits artificial noise (AN) to confuse Eve. When Ray relays
the decoded linear combination, Alice and Bob are transmitting AN against Eve.
This can be a 5G cellular communication scenario where a mobile terminal (MT)
aims at transmitting a secret message to a FD base station (BS), with the
assistance of a network FD relay. With respect to existing literature the
innovations of this paper are: a) Bob and Ray are FD devices; b) Alice, Ray and
Bob transmit also AN; and c) the channel to Eve is not known to Alice, Bob and
Ray. For this scenario we derive bounds on both the secrecy outage probability
under Rayleigh fading conditions of the channels to Eve, and the achievable
secrecy-outage rates.Comment: submitted to PIMR
Coexistence of RF-powered IoT and a Primary Wireless Network with Secrecy Guard Zones
This paper studies the secrecy performance of a wireless network (primary
network) overlaid with an ambient RF energy harvesting IoT network (secondary
network). The nodes in the secondary network are assumed to be solely powered
by ambient RF energy harvested from the transmissions of the primary network.
We assume that the secondary nodes can eavesdrop on the primary transmissions
due to which the primary network uses secrecy guard zones. The primary
transmitter goes silent if any secondary receiver is detected within its guard
zone. Using tools from stochastic geometry, we derive the probability of
successful connection of the primary network as well as the probability of
secure communication. Two conditions must be jointly satisfied in order to
ensure successful connection: (i) the SINR at the primary receiver is above a
predefined threshold, and (ii) the primary transmitter is not silent. In order
to ensure secure communication, the SINR value at each of the secondary nodes
should be less than a predefined threshold. Clearly, when more secondary nodes
are deployed, more primary transmitters will remain silent for a given guard
zone radius, thus impacting the amount of energy harvested by the secondary
network. Our results concretely show the existence of an optimal deployment
density for the secondary network that maximizes the density of nodes that are
able to harvest sufficient amount of energy. Furthermore, we show the
dependence of this optimal deployment density on the guard zone radius of the
primary network. In addition, we show that the optimal guard zone radius
selected by the primary network is a function of the deployment density of the
secondary network. This interesting coupling between the two networks is
studied using tools from game theory. Overall, this work is one of the few
concrete works that symbiotically merge tools from stochastic geometry and game
theory
Research Issues, Challenges, and Opportunities of Wireless Power Transfer-Aided Full-Duplex Relay Systems
We present a comprehensive review for wireless power transfer (WPT)-aided full-duplex (FD) relay systems. Two critical challenges in implementing WPT-aided FD relay systems are presented, that is, pseudo FD realization and high power consumption. Existing time-splitting or power-splitting structure based-WPT-aided FD relay systems can only realize FD operation in one of the time slots or only forward part of the received signal to the destination, belonging to pseudo FD realization. Besides, self-interference is treated as noise and self-interference cancellation (SIC) operation incurs high power consumption at the FD relay node. To this end, a promising solution is outlined to address the two challenges, which realizes consecutive FD realization at all times and forwards all the desired signal to the destination for decoding. Also, active SIC, that is, analog/digital cancellation, is not required by the proposed solution, which effectively reduces the circuit complexity and releases high power consumption at the FD relay node. Specific classifications and performance metrics of WPT-aided FD relay systems are summarized. Some future research is also envisaged for WPT-aided FD systems
A Lightweight Secure and Resilient Transmission Scheme for the Internet of Things in the Presence of a Hostile Jammer
In this article, we propose a lightweight security scheme for ensuring both information confidentiality and transmission resiliency in the Internet-of-Things (IoT) communication. A single-Antenna transmitter communicates with a half-duplex single-Antenna receiver in the presence of a sophisticated multiple-Antenna-Aided passive eavesdropper and a multiple-Antenna-Assisted hostile jammer (HJ). A low-complexity artificial noise (AN) injection scheme is proposed for drowning out the eavesdropper. Furthermore, for enhancing the resilience against HJ attacks, the legitimate nodes exploit their own local observations of the wireless channel as the source of randomness to agree on shared secret keys. The secret key is utilized for the frequency hopping (FH) sequence of the proposed communication system. We then proceed to derive a new closed-form expression for the achievable secret key rate (SKR) and the ergodic secrecy rate (ESR) for characterizing the secrecy benefits of our proposed scheme, in terms of both information secrecy and transmission resiliency. Moreover, the optimal power sharing between the AN and the message signal is investigated with the objective of enhancing the secrecy rate. Finally, through extensive simulations, we demonstrate that our proposed system model outperforms the state-of-The-Art transmission schemes in terms of secrecy and resiliency. Several numerical examples and discussions are also provided to offer further engineering insights
Securing Downlink Massive MIMO-NOMA Networks with Artificial Noise
In this paper, we focus on securing the confidential information of massive
multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA)
networks by exploiting artificial noise (AN). An uplink training scheme is
first proposed with minimum mean squared error estimation at the base station.
Based on the estimated channel state information, the base station precodes the
confidential information and injects the AN. Following this, the ergodic
secrecy rate is derived for downlink transmission. An asymptotic secrecy
performance analysis is also carried out for a large number of transmit
antennas and high transmit power at the base station, respectively, to
highlight the effects of key parameters on the secrecy performance of the
considered system. Based on the derived ergodic secrecy rate, we propose the
joint power allocation of the uplink training phase and downlink transmission
phase to maximize the sum secrecy rates of the system. Besides, from the
perspective of security, another optimization algorithm is proposed to maximize
the energy efficiency. The results show that the combination of massive MIMO
technique and AN greatly benefits NOMA networks in term of the secrecy
performance. In addition, the effects of the uplink training phase and
clustering process on the secrecy performance are revealed. Besides, the
proposed optimization algorithms are compared with other baseline algorithms
through simulations, and their superiority is validated. Finally, it is shown
that the proposed system outperforms the conventional massive MIMO orthogonal
multiple access in terms of the secrecy performance
An Overview of Physical Layer Security with Finite-Alphabet Signaling
Providing secure communications over the physical layer with the objective of
achieving perfect secrecy without requiring a secret key has been receiving
growing attention within the past decade. The vast majority of the existing
studies in the area of physical layer security focus exclusively on the
scenarios where the channel inputs are Gaussian distributed. However, in
practice, the signals employed for transmission are drawn from discrete signal
constellations such as phase shift keying and quadrature amplitude modulation.
Hence, understanding the impact of the finite-alphabet input constraints and
designing secure transmission schemes under this assumption is a mandatory step
towards a practical implementation of physical layer security. With this
motivation, this article reviews recent developments on physical layer security
with finite-alphabet inputs. We explore transmit signal design algorithms for
single-antenna as well as multi-antenna wiretap channels under different
assumptions on the channel state information at the transmitter. Moreover, we
present a review of the recent results on secure transmission with discrete
signaling for various scenarios including multi-carrier transmission systems,
broadcast channels with confidential messages, cognitive multiple access and
relay networks. Throughout the article, we stress the important behavioral
differences of discrete versus Gaussian inputs in the context of the physical
layer security. We also present an overview of practical code construction over
Gaussian and fading wiretap channels, and we discuss some open problems and
directions for future research.Comment: Submitted to IEEE Communications Surveys & Tutorials (1st Revision
- …