Search

Achievable data rates in wireless systems rely heavily on the available channel state information (CSI) throughout the network. However, feedback links, which provide this information, are scarce, unreliable, and subject to security threats. In this work, we study the impact of having intermittent feedback links on the capacity region of the canonical two-user erasure broadcast channels. In our model, at any time instant, each receiver broadcasts its CSI, and at any other node, this information either becomes available with unit delay or gets erased. For this setting, we develop a new set of outer bounds to capture the intermittent nature of the feedback links. These outer bounds depend on the probability that the CSI from both receivers are erased at the transmitter. In particular, if at any time, the CSI from at least one of the two receivers is available at the other two nodes, then the outer-bounds match the capacity with global delayed CSI. We also provide capacity-achieving transmission strategies under certain scenarios, and we establish a connection between this problem and Blind Index Coding with feedback. [ABSTRACT FROM AUTHOR]

We characterize the capacity region of the two-user broadcast packet erasure channel (PEC) with single-user delayed channel state information (CSI). More precisely, we assume one receiver does not provide its channel state to the other two nodes (the other receiver and the transmitter), while the other receiver reveals its state globally with unit delay. This is a hybrid CSI at the transmitter (CSIT) setting where the transmitter has the delayed CSI of one user but not the other. Previous results developed opportunistic network coding schemes for this setting, which strictly enlarge the achievable rate region compared to the no-CSIT baseline. Characterization of the capacity region with single-user delayed CSI, however, remained open. In this work, we develop an improved achievability strategy and show that the capacity region, surprisingly, matches that of the broadcast PEC with global delayed CSI of both users. The key to such improvement over previous results is a new precoding strategy for the retransmission phase of the opportunistic network coding scheme. It harnesses the single-user delayed CSI in the retransmission phase, so that interference from the feedback receiver can be aligned at the other receiver. Besides the broadcast PEC with two private messages, an extension to a model with an additional common message is also provided and the corresponding capacity region with single-user CSI also matches that with global delayed CSI. Finally, further extensions to three-user cases are also provided. [ABSTRACT FROM AUTHOR]

In wireless networks, the link connectivity may be intermittent due to shadowing, burstiness of data arrival, or uncoordinated resource allocation. In this paper, we model the intermittence of links as Bernoulli distributed random channel states, termed intermittence channel states, and study the impact of the corresponding channel state information at the transmitter (CSIT) in a two-user Gaussian broadcast channel (BC). Moreover, due to the heterogeneous timeliness of intermittence channel states, the CSIT considered in this paper is hybrid. More specifically, the CSIT of each link can be perfectly (causally or non-causally) available, delayed, or not available. When the links are connected, we adopt a general setting that the received signal-to-noise ratios can be different. Our contribution is the characterization of the capacity regions of intermittent Gaussian BC to within bounded gaps for all combinations of hybrid CSIT, except for scenario DN (delayed CSIT of receiver 1, no CSIT of receiver 2). For scenario DN, we propose an opportunistic physical layer network coding scheme that achieves a strictly larger degree-of-freedom (DoF) region than the no-CSIT DoF region. As a corollary, single-user CSIT is able to increase the sum DoF for intermittent Gaussian BC (also the capacity region for the erasure BC, as a by-product). This result is in sharp contrast to the recent negative result by Davoodi and Jafar, where it is shown that for fast-fading multiple-input single-output BC with continuous channel states, single-user CSIT does not help at all in terms of sum DoF. [ABSTRACT FROM AUTHOR]

Physical layer secrecy has attracted much attention in recent years due to its ability to ensure communication secrecy with the use of channel coding and signal processing techniques (and without the explicit use of secret keys) in the physical layer. It serves as a promising technique for highly dynamic or ad hoc systems such as device-to-device and machine-type communication systems. However, the achievable secrecy performance depends highly on the level of CSI at the transmitter, the receiver, and the eavesdropper. In this article, we discuss how different levels of CSI resulting from conventional and unconventional ways of performing training and channel feedback may affect the confidentiality in terms of the information-theoretic (perfect) secrecy rate. The conventional approach refers to the emission of pilot signals from the transmitter and explicit channel feedback from the receiver. This approach is backward compatible with existing systems and allows the receiver to obtain accurate knowledge of the CSI, but may suffer from CSI leakage toward the eavesdropper. Unconventional approaches capitalize on reverse training to prevent CSI leakage and are shown to achieve significant improvements over conventional schemes in certain cases. For example, in a system with four transmit antennas and a single antenna at both the receiver and the eavesdropper, a secrecy rate gain of approximately 0.8 b/channel use at transmit SNR of 16 dB is observed over the full CSI case by providing CSI only to the transmitter (but not the receiver and the eavesdropper). [ABSTRACT FROM AUTHOR]

In this paper we consider the secure transmission with multiple-input, single-output, single-antenna eavesdropper (MISOSE) in fast fading channels where the transmitter knows perfect legitimate channel state information but only the statistics of the eavesdropper's channel. For the MISOSE channels, the artificial noise assisted beamforming proposed by Goel and Negi is a promising technique, where the artificial noise is imposed on the null space of the legitimate channel to disrupt the eavesdropper's reception. Here we propose a generalized artificial noise scheme which allows the injection of the artificial noise to the legitimate channel. Although the generalized artificial noise may cause the leakage of artificial noise at the legitimate receiver, the secrecy rate can still be improved since the covariance matrix of it is more flexible than the heuristic one selected by Goel and Negi. To fully characterize the proposed scheme, we investigate the optimization of its secrecy rate. We first derive the conditions under which the beamformers of the message bearing signal and the generalized artificial noise being the same is optimal. Based on this choice, the complicated secrecy rate optimization problem over the covariance matrices of the message-bearing signal and the generalized artificial noise can be reduced to a much simpler power allocation problem. We also develop an efficient algorithm to solve this non-convex power allocation problem. Numerical results show that our generalized artificial noise scheme outperforms Goel and Negi's heuristic selection, especially in the near eavesdropper settings. In particular, with the aid of the proposed scheme, the regime with non-zero secrecy rate is enlarged, which can significantly improve the connectivity of the network. [ABSTRACT FROM AUTHOR]

In this paper, we aim to solve the multiuser multi-input multi-output (MIMO) downlink beamforming problem where one multi-antenna base station broadcasts data to many users. Each user is assigned multiple data streams and has multiple antennas at its receiver. Efficient solutions to the joint transmit-receive beamforming and power allocation problem based on iterative methods are proposed. We adopt the group maximum signal-to-interference-plus-noise-ratio (SINR) filter bank (GSINR-FB) as our beamformer which exploits receiver diversity through cooperation between the data streams of a user. The data streams for each user are subject to an average SINR constraint, which has many important applications in wireless communication systems and serves as a good metric to measure the quality of service (QoS). The GSINR-FB also optimizes the average SINR of its output. Based on the GSINR-FB beamformer, we find an SINR balancing structure for optimal power allocation which simplifies the complicated power allocation problem to a linear one. Simulation results verify the superiority of the proposed algorithms over previous works with approximately the same complexity. [ABSTRACT FROM PUBLISHER]

Linear-assignment Gel'fand-Pinsker coding (LA-GPC) is a coding technique for channels with interference known only at the transmitter, where the known interference is treated as side-information (SI). As a special case of the LA-GPC, dirty paper coding has been shown to be able to achieve the optimal interference-free rate for SI channels with perfect channel state information at the transmitter (CSIT). In the cases where only the channel distribution information at the transmitter (CDIT) is available, LA-GPC also has good (sometimes optimal) performance in a variety of fast and slow fading SI channels. In this letter, we design filters in the nested lattice based coding to make it achieve the same rate performance as the LA-GPC in multiple-input multiple-output (MIMO) channels. Compared with the random Gaussian codebooks used in previous works, our resultant coding schemes have algebraic structures and can be implemented in practical systems. Simulations in slow-fading channels are provided, and near interference-free error performance is obtained. The proposed coding schemes can serve as the fundamental building blocks to achieve the promised rate performance of MIMO Gaussian broadcast channels with CDIT or perfect CSIT. [ABSTRACT FROM AUTHOR]

The impact of quantized channel direction information (CDI) on the achievable secrecy rate is studied for multiple antenna wiretap channels. By assuming that the eavesdropper's channel is unknown at the transmitter, we adopt the transmission scheme where artificial noise (AN) is imposed in the null space of the legitimate receiver's channel to disrupt the eavesdropper's reception. It has been shown that, in the ideal case where perfect CDI is available at the transmitter, the achievable secrecy rate can be made arbitrarily large by increasing the transmission power. However, when only quantized CDI is available, the AN that was originally intended to jam the eavesdropper may now leak into the legitimate receiver's channel, causing significant secrecy rate loss. For a given number of feedback bits B and transmission power P, we derive the optimal power allocation among the message-bearing signal and the AN to maximize the secrecy rate under AN leakage. We show that, when B is sufficiently large, one should allocate power evenly among the message-bearing signal and the AN; whereas when B is small, one should be more conservative in allocating power to the AN. Moreover, by showing that the achievable secrecy rate under quantized CDI is bounded by a constant, we derive a scaling law between B and P that is necessary to maintain a constant secrecy rate loss compared to the perfect CDI case. The scaling of B is shown to be logarithmic of P. These results are first derived for the multiple-input single-output single—antenna-eavesdropper scenario and are later extended to the multiple-input multiple-output multiple-antenna-eavesdropper case. Numerical simulations are provided to verify our theoretical claims. [ABSTRACT FROM PUBLISHER]