We study the Gaussian multiple-input multiple-output multiple-eavesdropper wiretap channel where a transmitter wishes to communicate a confidential message to a legitimate receiver in the presence of eavesdroppers. Each node in the network is equipped with an arbitrary number of antennas. Furthermore, channels are time varying, and there is no channel state information available at the transmitter (CSIT) with respect to eavesdroppers' channels; and transmitter only has access to delayed CSIT of the channel to the legitimate receiver. The secure degrees of freedom (SDoF) for such a network has only been characterized for special cases, and is unknown in general. We completely characterize the SDoF of this network for all antenna configurations. In particular, we strictly improve the state-of-the-art achievable scheme for this network by proposing more efficient artificial noise alignment at the receivers. Furthermore, we develop a tight upper bound by utilizing three important inequalities that provide lower bounds on the received signal dimensions at receivers which supply delayed CSIT or no CSIT. These inequalities together allow for analysis of signal dimensions in networks with heterogeneous CSIT; and as a result, we present a converse proof that leads to characterization of SDoF for all possible antenna configurations.

We study the impact of heterogeneity of channel-state-information available at the transmitters (CSIT) on the capacity of broadcast channels with a multiple-antenna transmitter and k single-antenna receivers (MISO BC). In particular, we consider the k-user MISO BC, where the CSIT with respect to each receiver can be either instantaneous/perfect, delayed, or not available; and we study the impact of this heterogeneity of CSIT on the degrees-of-freedom (DoFs) of such network. We first focus on the three-user MISO BC, and we completely characterize the DoF region for all possible heterogeneous CSIT configurations, assuming linear encoding strategies at the transmitters. The result shows that the state-of-the-art achievable schemes in the literature are indeed sum-DoF optimal, when restricted to linear encoding schemes. To prove the result, we develop a novel bound, called interference decomposition bound, which provides a lower bound on the interference dimension at a receiver which supplies delayed CSIT based on the average dimension of constituents of that interference, thereby decomposing the interference into its individual components. Furthermore, we extend our outer bound on the DoF region to the general k-user MISO BC, and demonstrate that it leads to an approximate characterization of linear sum-DoF to within an additive gap of 0.5 for a broad range of CSIT configurations. Moreover, for the special case where only one receiver supplies delayed CSIT, we completely characterize the linear sum-DoF.

We study the impact of heterogeneity of channel state information available to the transmitters (CSIT) on the performance of multi-antenna multi-user wireless networks. More specifically, we consider the 3-user multiple-input single-output (MISO) broadcast channel, where the available CSIT with respect to each receiver can be instantaneous (P), delayed (D), or none (N); and we characterize the extent to which such heterogeneity of CSIT impacts its linear degrees of freedom (LDoF). In particular, we completely characterize the DoF region for all possible CSIT configurations, assuming linear encoding strategies at the transmitters. The converse, which is the main contribution of the paper, is based on a novel lemma, called Interference Decomposition Bound, which provides a lower bound on the interference dimension at a receiver with delayed CSIT, based on the dimension of constituents of that interference, thereby decomposing the interference into its individual components.

We study the impact of heterogeneity of channel-state-information available at the transmitters (CSIT) on the capacity of broadcast channels with a multiple-antenna transmitter and k single-antenna receivers (MISO BC). In particular, we consider the k-user MISO BC, where the CSIT with respect to each receiver can be either instantaneous/perfect (P), delayed (D), or not available (N); and we study the impact of this heterogeneity of CSIT on the degrees-of-freedom (DoF) of such network. We develop a general outer bound on the DoF region of k-user MISO BC for all possible heterogeneous CSIT configurations, assuming linear encoding strategies at the transmitter. The outer bound leads to an approximate linear sum-DoF characterization to within 0.5 for a broad range of CSIT configurations. It also leads to an exact characterization of linear sum-DoF for some specific CSIT configurations. Our proof of the outer bound relies on the development of a novel lemma, called Interference Decomposition Bound, which lower bounds the interference dimension at a receiver which supplies delayed CSIT based on the average dimension of constituents of that interference, thereby decomposing it into its components.

We consider the Gaussian wiretap channel with a transmitter, a legitimate receiver, and k eavesdroppers (k ∈ ℕ), where the secure communication is aided via a jammer. We focus on the setting where the transmitter and the jammer are blind with respect to the state of channels to eavesdroppers, and only have access to delayed channel state information (CSI) of the legitimate receiver, which is referred to as “blind cooperative wiretap channel with delayed CSIT”. We show that a strictly positive secure Degrees of Freedom (DoF) of 1 over 3 is achievable irrespective of the number of eavesdroppers (k) in the network, and further, 1 over 3 is optimal assuming linear coding strategies at the transmitters. The converse proof is based on two key lemmas. The first lemma, named Rank Ratio Inequality, shows that if two distributed transmitters employ linear strategies, the ratio of the dimensions of received linear sub-spaces at the two receivers cannot exceed 3/2, due to delayed CSI. The second lemma implies that once the transmitters in a network have no CSI with respect to a receiver, the least amount of alignment will occur at that receiver, meaning that transmit signals will occupy the maximal signal dimensions at that receiver. Finally, we show that once the transmitter and the jammer form a single transmitter with two antennas, which we refer to as MISO wiretap channel, 1 over 2 is the optimal secure DoF when using linear schemes.

We establish the degrees of freedom (DoF) of the two-user X-channel with delayed channel knowledge at transmitters [i.e., delayed channel state information at the transmitters (CSIT)], assuming linear coding strategies at the transmitters. We derive a new upper bound and characterize the linear DoF of this network to be 6/5. The converse builds upon our development of a general lemma that shows that, if two distributed transmitters employ linear strategies, the ratio of the dimensions of received linear subspaces at the two receivers cannot exceed 3/2, due to delayed CSIT. As a byproduct, we also apply this general lemma to the three-user interference channel with delayed CSIT, thereby deriving a new upper bound of 9/7 on its linear DoF. This is the first bound that captures the impact of delayed CSIT on the DoF of this network, under the assumption of linear encoding strategies.

The proliferation of different wireless access technologies, together with the growing number of multi-radio wireless devices suggest that the opportunistic utilization of multiple connections at the users can be an effective solution to the phenomenal growth of traffic demand in wireless networks. In this paper, we consider the downlink of a wireless network with$N$access points (${\ssr AP}$s) and$M$clients, where each client is connected to several out-of-band${\ssr AP}$s, and requests delay-sensitive traffic (e.g., real-time video). We adopt the framework of Houand study the maximum total timely throughput of the network, denoted by$C_{{\ssr T}^{3}}$, which is the maximum average number of packets delivered successfully before their deadline. Solving this problem is challenging since even the number of different ways of assigning packets to the${\ssr AP}$s is$N^{M}$. We overcome the challenge by proposing a deterministic relaxation of the problem, which converts the problem to a network with deterministic delays in each link. We show that the additive gap between the capacity of the relaxed problem, denoted by$C_{\rm det}$and$C_{{\ssr T}^{3}}$is bounded by$2\sqrt{N(C_{\rm det}+{{N}\over{4}})}$, which is asymptotically negligible compared to$C_{\rm det}$, when the network is operating at high-throughput regime. In addition, our numerical results show that the actual gap between$C_{{\ssr T}^{3}}$and$C_{\rm det}$is in most cases much less than the worst-case gap proven analytically. Moreover, using LP rounding methods we prove that the relaxed problem can be approximated within additive gap of$N$. We extend the analytical results to the case of time-varying channel states, real-time traffic, prioritized traffic, and optimal online policies. Finally, we generalize the model for deterministic relaxation to consider fading, rate adaptation, and multiple simultaneous transmissions.

In this paper we consider the down link of a heterogeneous wireless network with N Access Points (AP's) and M clients, where each client is connected to several out-of-band AP's, and requests delay-sensitive traffic (e.g., real-time video). We adopt the framework of Hou, Borkar, and Kumar, and study the maximum total timely throughput of the network, denoted by C(T3), which is the maximum average number of packets delivered successfully before their deadline. We propose a deterministic relaxation of the problem, which converts the problem to a network with deterministic delays in each link. We show that the additive gap between the capacity of the relaxed problem denoted by Cdet, and C(T3) is bounded by 2√(N(Cdet+ N/4)), which is asymptotically negligible compared to Cdet, when the network is operating at high-throughput regime. Moreover, using LP rounding methods we prove that the relaxed problem can be approximated in polynomial time with additive gap of N.