10,690 research outputs found
A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead
Physical layer security which safeguards data confidentiality based on the
information-theoretic approaches has received significant research interest
recently. The key idea behind physical layer security is to utilize the
intrinsic randomness of the transmission channel to guarantee the security in
physical layer. The evolution towards 5G wireless communications poses new
challenges for physical layer security research. This paper provides a latest
survey of the physical layer security research on various promising 5G
technologies, including physical layer security coding, massive multiple-input
multiple-output, millimeter wave communications, heterogeneous networks,
non-orthogonal multiple access, full duplex technology, etc. Technical
challenges which remain unresolved at the time of writing are summarized and
the future trends of physical layer security in 5G and beyond are discussed.Comment: To appear in IEEE Journal on Selected Areas in Communication
Reliable Physical Layer Network Coding
When two or more users in a wireless network transmit simultaneously, their
electromagnetic signals are linearly superimposed on the channel. As a result,
a receiver that is interested in one of these signals sees the others as
unwanted interference. This property of the wireless medium is typically viewed
as a hindrance to reliable communication over a network. However, using a
recently developed coding strategy, interference can in fact be harnessed for
network coding. In a wired network, (linear) network coding refers to each
intermediate node taking its received packets, computing a linear combination
over a finite field, and forwarding the outcome towards the destinations. Then,
given an appropriate set of linear combinations, a destination can solve for
its desired packets. For certain topologies, this strategy can attain
significantly higher throughputs over routing-based strategies. Reliable
physical layer network coding takes this idea one step further: using
judiciously chosen linear error-correcting codes, intermediate nodes in a
wireless network can directly recover linear combinations of the packets from
the observed noisy superpositions of transmitted signals. Starting with some
simple examples, this survey explores the core ideas behind this new technique
and the possibilities it offers for communication over interference-limited
wireless networks.Comment: 19 pages, 14 figures, survey paper to appear in Proceedings of the
IEE
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
Energy Harvesting Wireless Communications: A Review of Recent Advances
This article summarizes recent contributions in the broad area of energy
harvesting wireless communications. In particular, we provide the current state
of the art for wireless networks composed of energy harvesting nodes, starting
from the information-theoretic performance limits to transmission scheduling
policies and resource allocation, medium access and networking issues. The
emerging related area of energy transfer for self-sustaining energy harvesting
wireless networks is considered in detail covering both energy cooperation
aspects and simultaneous energy and information transfer. Various potential
models with energy harvesting nodes at different network scales are reviewed as
well as models for energy consumption at the nodes.Comment: To appear in the IEEE Journal of Selected Areas in Communications
(Special Issue: Wireless Communications Powered by Energy Harvesting and
Wireless Energy Transfer
Diversity analysis, code design, and tight error rate lower bound for binary joint network-channel coding
Joint network-channel codes (JNCC) can improve the performance of communication in wireless networks, by combining, at the physical layer, the channel codes and the network code as an overall error-correcting code. JNCC is increasingly proposed as an alternative to a standard layered construction, such as the OSI-model. The main performance metrics for JNCCs are scalability to larger networks and error rate. The diversity order is one of the most important parameters determining the error rate. The literature on JNCC is growing, but a rigorous diversity analysis is lacking, mainly because of the many degrees of freedom in wireless networks, which makes it very hard to prove general statements on the diversity order. In this article, we consider a network with slowly varying fading point-to-point links, where all sources also act as relay and additional non-source relays may be present. We propose a general structure for JNCCs to be applied in such network. In the relay phase, each relay transmits a linear transform of a set of source codewords. Our main contributions are the proposition of an upper and lower bound on the diversity order, a scalable code design and a new lower bound on the word error rate to assess the performance of the network code. The lower bound on the diversity order is only valid for JNCCs where the relays transform only two source codewords. We then validate this analysis with an example which compares the JNCC performance to that of a standard layered construction. Our numerical results suggest that as networks grow, it is difficult to perform significantly better than a standard layered construction, both on a fundamental level, expressed by the outage probability, as on a practical level, expressed by the word error rate
Multi-Way Relay Networks: Orthogonal Uplink, Source-Channel Separation and Code Design
We consider a multi-way relay network with an orthogonal uplink and
correlated sources, and we characterise reliable communication (in the usual
Shannon sense) with a single-letter expression. The characterisation is
obtained using a joint source-channel random-coding argument, which is based on
a combination of Wyner et al.'s "Cascaded Slepian-Wolf Source Coding" and
Tuncel's "Slepian-Wolf Coding over Broadcast Channels". We prove a separation
theorem for the special case of two nodes; that is, we show that a modular code
architecture with separate source and channel coding functions is
(asymptotically) optimal. Finally, we propose a practical coding scheme based
on low-density parity-check codes, and we analyse its performance using
multi-edge density evolution.Comment: Authors' final version (accepted and to appear in IEEE Transactions
on Communications
Error Rate Analysis of GF(q) Network Coded Detect-and-Forward Wireless Relay Networks Using Equivalent Relay Channel Models
This paper investigates simple means of analyzing the error rate performance
of a general q-ary Galois Field network coded detect-and-forward cooperative
relay network with known relay error statistics at the destination. Equivalent
relay channels are used in obtaining an approximate error rate of the relay
network, from which the diversity order is found. Error rate analyses using
equivalent relay channel models are shown to be closely matched with simulation
results. Using the equivalent relay channels, low complexity receivers are
developed whose performances are close to that of the optimal maximum
likelihood receiver.Comment: 28 pages, 10 figures. This work has been submitted to the IEEE for
possible publication. Copyright may be transferred without notice, after
which this version may no longer be accessibl
- …