Delay Constrained Throughput Analysis of a Correlated MIMO Wireless Channel

The maximum traffic arrival rate at the network for a given delay guarantee (delay constrained throughput) has been well studied for wired channels. However, few results are available for wireless channels, especially when multiple antennas are employed at the transmitter and receiver. In this work, we analyze the network delay constrained throughput of a multiple input multiple output (MIMO) wireless channel with time-varying spatial correlation. The MIMO channel is modeled via its virtual representation, where the individual spatial paths between the antenna pairs are Gilbert-Elliot channels. The whole system is then described by a K-State Markov chain, where K depends upon the degree of freedom (DOF) of the channel. We prove that the DOF based modeling is indeed accurate. Furthermore, we study the impact of the delay requirements at the network layer, violation probability and the number of antennas on the throughput under different fading speeds and signal strength.Comment: Submitted to ICCCN 2011, 8 pages, 5 figure

Secure Communication for Spatially Sparse Millimeter-Wave Massive MIMO Channels via Hybrid Precoding

In this paper, we investigate secure communication over sparse millimeter-wave (mm-Wave) massive multiple-input multiple-output (MIMO) channels by exploiting the spatial sparsity of legitimate user's channel. We propose a secure communication scheme in which information data is precoded onto dominant angle components of the sparse channel through a limited number of radio-frequency (RF) chains, while artificial noise (AN) is broadcast over the remaining nondominant angles interfering only with the eavesdropper with a high probability. It is shown that the channel sparsity plays a fundamental role analogous to secret keys in achieving secure communication. Hence, by defining two statistical measures of the channel sparsity, we analytically characterize its impact on secrecy rate. In particular, a substantial improvement on secrecy rate can be obtained by the proposed scheme due to the uncertainty, i.e., 'entropy', introduced by the channel sparsity which is unknown to the eavesdropper. It is revealed that sparsity in the power domain can always contribute to the secrecy rate. In contrast, in the angle domain, there exists an optimal level of sparsity that maximizes the secrecy rate. The effectiveness of the proposed scheme and derived results are verified by numerical simulations

Reliable multi-hop routing with cooperative transmissions in energy-constrained networks

We present a novel approach in characterizing the optimal reliable multi-hop virtual multiple-input single-output (vMISO) routing in ad hoc networks. Under a high node density regime, we determine the optimal cardinality of the cooperation sets at each hop on a path minimizing the total energy cost per transmitted bit. Optimal cooperating set cardinality curves are derived, and they can be used to determine the optimal routing strategy based on the required reliability, transmission power, and path loss coefficient. We design a new greedy geographical routing algorithm suitable for vMISO transmissions, and demonstrate the applicability of our results for more general networks