3,133 research outputs found
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
Distributed Turbo-Like Codes for Multi-User Cooperative Relay Networks
In this paper, a distributed turbo-like coding scheme for wireless networks
with relays is proposed. We consider a scenario where multiple sources
communicate with a single destination with the help of a relay. The proposed
scheme can be regarded as of the decode-and-forward type. The relay decodes the
information from the sources and it properly combines and re-encodes them to
generate some extra redundancy, which is transmitted to the destination. The
amount of redundancy generated by the relay can simply be adjusted according to
requirements in terms of performance, throughput and/or power. At the
destination, decoding of the information of all sources is performed jointly
exploiting the redundancy provided by the relay in an iterative fashion. The
overall communication network can be viewed as a serially concatenated code.
The proposed distributed scheme achieves significant performance gains with
respect to the non-cooperation system, even for a very large number of users.
Furthermore, it presents a high flexibility in terms of code rate, block length
and number of users.Comment: Submitted to ICC 201
Secure Communication over Parallel Relay Channel
We investigate the problem of secure communication over parallel relay
channel in the presence of a passive eavesdropper. We consider a four terminal
relay-eavesdropper channel which consists of multiple relay-eavesdropper
channels as subchannels. For the discrete memoryless model, we establish outer
and inner bounds on the rate-equivocation region. The inner bound allows mode
selection at the relay. For each subchannel, secure transmission is obtained
through one of two coding schemes at the relay: decoding-and-forwarding the
source message or confusing the eavesdropper through noise injection. For the
Gaussian memoryless channel, we establish lower and upper bounds on the perfect
secrecy rate. Furthermore, we study a special case in which the relay does not
hear the source and show that under certain conditions the lower and upper
bounds coincide. The results established for the parallel Gaussian
relay-eavesdropper channel are then applied to study the fading
relay-eavesdropper channel. Analytical results are illustrated through some
numerical examples.Comment: To Appear in IEEE Transactions on Information Forensics and Securit
Partner selection in indoor-to-outdoor cooperative networks: an experimental study
In this paper, we develop a partner selection protocol for enhancing the
network lifetime in cooperative wireless networks. The case-study is the
cooperative relayed transmission from fixed indoor nodes to a common outdoor
access point. A stochastic bivariate model for the spatial distribution of the
fading parameters that govern the link performance, namely the Rician K-factor
and the path-loss, is proposed and validated by means of real channel
measurements. The partner selection protocol is based on the real-time
estimation of a function of these fading parameters, i.e., the coding gain. To
reduce the complexity of the link quality assessment, a Bayesian approach is
proposed that uses the site-specific bivariate model as a-priori information
for the coding gain estimation. This link quality estimator allows network
lifetime gains almost as if all K-factor values were known. Furthermore, it
suits IEEE 802.15.4 compliant networks as it efficiently exploits the
information acquired from the receiver signal strength indicator. Extensive
numerical results highlight the trade-off between complexity, robustness to
model mismatches and network lifetime performance. We show for instance that
infrequent updates of the site-specific model through K-factor estimation over
a subset of links are sufficient to at least double the network lifetime with
respect to existing algorithms based on path loss information only.Comment: This work has been submitted to IEEE Journal on Selected Areas in
Communications in August 201
Coordination and Bargaining over the Gaussian Interference Channel
This work considers coordination and bargaining between two selfish users
over a Gaussian interference channel using game theory. The usual information
theoretic approach assumes full cooperation among users for codebook and rate
selection. In the scenario investigated here, each selfish user is willing to
coordinate its actions only when an incentive exists and benefits of
cooperation are fairly allocated. To improve communication rates, the two users
are allowed to negotiate for the use of a simple Han-Kobayashi type scheme with
fixed power split and conditions for which users have incentives to cooperate
are identified. The Nash bargaining solution (NBS) is used as a tool to get
fair information rates. The operating point is obtained as a result of an
optimization problem and compared with a TDM-based one in the literature.Comment: 5 pages, 4 figures, to appear in Proceedings of IEEE ISIT201
- …