561 research outputs found
On the Capacity Region of Multi-Antenna Gaussian Broadcast Channels with Estimation Error
In this paper we consider the effect of channel estimation error on the capacity region of MIMO Gaussian broadcast channels. It is assumed that the receivers and the transmitter have (the same) estimates of the channel coefficients (i.e., the feedback channel is noiseless). We obtain an achievable rate region based on the dirty paper coding scheme. We show that this region is given by the capacity region of a dual multi-access channel with a noise covariance that depends on the transmit power. We explore this duality to give the asymptotic behavior of the sum-rate for a system with a large number of user, i.e., n rarr infin. It is shown that as long as the estimation error is of fixed (w.r.t n) variance, the sum-capacity is of order M log log n, where M is the number of antennas deployed at the transmitter. We further obtain the sum-rate loss due to the estimation error. Finally, we consider a training-based scheme for block fading MISO Gaussian broadcast channels. We find the optimum length of the training interval as well as the optimum power used for training in order to maximize the achievable sum-rate
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
Secure Massive MIMO Communication with Low-resolution DACs
In this paper, we investigate secure transmission in a massive multiple-input
multiple-output (MIMO) system adopting low-resolution digital-to-analog
converters (DACs). Artificial noise (AN) is deliberately transmitted
simultaneously with the confidential signals to degrade the eavesdropper's
channel quality. By applying the Bussgang theorem, a DAC quantization model is
developed which facilitates the analysis of the asymptotic achievable secrecy
rate. Interestingly, for a fixed power allocation factor , low-resolution
DACs typically result in a secrecy rate loss, but in certain cases they provide
superior performance, e.g., at low signal-to-noise ratio (SNR). Specifically,
we derive a closed-form SNR threshold which determines whether low-resolution
or high-resolution DACs are preferable for improving the secrecy rate.
Furthermore, a closed-form expression for the optimal is derived. With
AN generated in the null-space of the user channel and the optimal ,
low-resolution DACs inevitably cause secrecy rate loss. On the other hand, for
random AN with the optimal , the secrecy rate is hardly affected by the
DAC resolution because the negative impact of the quantization noise can be
compensated for by reducing the AN power. All the derived analytical results
are verified by numerical simulations.Comment: 14 pages, 10 figure
Degrees of Freedom of Time Correlated MISO Broadcast Channel with Delayed CSIT
We consider the time correlated multiple-input single-output (MISO) broadcast
channel where the transmitter has imperfect knowledge on the current channel
state, in addition to delayed channel state information. By representing the
quality of the current channel state information as P^-{\alpha} for the
signal-to-noise ratio P and some constant {\alpha} \geq 0, we characterize the
optimal degree of freedom region for this more general two-user MISO broadcast
correlated channel. The essential ingredients of the proposed scheme lie in the
quantization and multicasting of the overheard interferences, while
broadcasting new private messages. Our proposed scheme smoothly bridges between
the scheme recently proposed by Maddah-Ali and Tse with no current state
information and a simple zero-forcing beamforming with perfect current state
information.Comment: revised and final version, to appear in IEEE transactions on
Information Theor
Adaptive Power Allocation and Control in Time-Varying Multi-Carrier MIMO Networks
In this paper, we examine the fundamental trade-off between radiated power
and achieved throughput in wireless multi-carrier, multiple-input and
multiple-output (MIMO) systems that vary with time in an unpredictable fashion
(e.g. due to changes in the wireless medium or the users' QoS requirements).
Contrary to the static/stationary channel regime, there is no optimal power
allocation profile to target (either static or in the mean), so the system's
users must adapt to changes in the environment "on the fly", without being able
to predict the system's evolution ahead of time. In this dynamic context, we
formulate the users' power/throughput trade-off as an online optimization
problem and we provide a matrix exponential learning algorithm that leads to no
regret - i.e. the proposed transmit policy is asymptotically optimal in
hindsight, irrespective of how the system evolves over time. Furthermore, we
also examine the robustness of the proposed algorithm under imperfect channel
state information (CSI) and we show that it retains its regret minimization
properties under very mild conditions on the measurement noise statistics. As a
result, users are able to track the evolution of their individually optimum
transmit profiles remarkably well, even under rapidly changing network
conditions and high uncertainty. Our theoretical analysis is validated by
extensive numerical simulations corresponding to a realistic network deployment
and providing further insights in the practical implementation aspects of the
proposed algorithm.Comment: 25 pages, 4 figure
- …