MIMO时分蜂窝系统混合协作上行性能研究

下一代无线通信系统中,基站联合解码和移动终端协作传输是两种提高系统性能的重要技术。该文在线性时分蜂窝系统中,通过研究MIMO信道条件下混合协作可获得的单个小区上行可达传输速率,得出两种协作方式的相互作用和系统传输最小Eb/N0,并给出了小区联合解码与终端DF(解码前向)协作混合模式下的可达速率计算方法和最小Eb/N0的闭式解。最后,文中给出了MIMO衰减信道条件下的仿真结果,得出了多小区联合解码(宏分集)与终端协作性能的线性叠加关系,强临近小区干扰将会严重削弱用户与小区联合协作时终端协作作用的结论,验证了混合协作模式会极大提高系统传输性能。     

Successive relaying for large MIMO amplify‐and‐forward relay networks

In this paper, we consider a large relay network with one source, K relays and M users, where the source and relays are equipped with W and N antennas, respectively. We propose an amplify‐and‐forward successive relaying protocol in which the relays are divided into 2 groups to successively help transmission to M users. Achievable sum rate of the proposed protocol is derived and found to scale as when N and M are fixed and K→∞ . On the other hand, when M and K are fixed and N→∞, the achievable sum rate scales as . Therefore, the scaling law of the achievable sum rate coincides with the capacity scaling law of the considered network. Then, both precoding at the source and grouping of the relay nodes are jointly optimized to further improve the proposed protocol. Numerical results show that the proposed successive relaying protocol can outperform the conventional 2‐slot relaying protocol and the proposed joint optimization scheme for source precoding and relay grouping bring considerable rate gain.     

Grouping Algorithm for Partner Selection in Cooperative Transmission

The partner selection problem for cooperative transmission is considered. Our objective is sum power minimization. We provide a simple optimal rate allocation algorithm for two cooperating node pairs and closed-form optimal rate allocations for some cases. With these results, we determine the partner for each node pair by Gabow’s Algorithm. For a large number of nodes, we propose the grouping algorithm which is near-optimal but reduces the communication and computational overhead. We show the significant improvement of power consumption by our scheme and the fast convergence of the grouping algorithm through simulations.     

Impact of hardware impairments on large-scale MIMO systems over composite RG fading channels

In this paper, we analyze the impact of receiver hardware impairments on the achievable sum rate of multiple-input multiple-output (MIMO) systems, where the channel follows composite Rician-Gamma (RG) distribution and may be correlated at the transmitters. More specifically, we derive the analytical expressions on the lower bound for the achievable sum rate of regular and large-scale MIMO systems with zero-forcing (ZF) receivers. In order to obtain deeper insights, the asymptotic analysis for the achievable sum rate of regular MIMO systems at high signal-to-noise ratio (SNR) regime is explored. It explicitly reveals that there is a finite rate ceiling on the achievable sum rate for regular MIMO systems at high SNRs, which is irrespective of the transmit power. Additionally, for large antenna configuration, three representative cases are considered insightfully by deriving in closed-form expressions for the asymptotic achievable sum rate. It demonstrates that the finite rate ceiling vanishes for large-scale MIMO limits, which means that large-scale MIMO systems are robust to hardware impairments.     

On the Deployment of Antenna Elements in Generalized Multi-User Distributed Antenna Systems

In this paper, we focus on a generalized multi-user distributed antenna system (DAS), where the antenna elements (AEs) are divided into antenna clusters and the antenna clusters are randomly deployed in the coverage area. The mobile terminals equipped with M AEs each are supposed to be uniformly distributed in the coverage area. We are motivated to study the impact of the deployment of antenna elements on the system performance. In the model of consideration, the deployment of antenna elements is characterized by the antenna cluster size V, i.e., the number of AEs within each antenna cluster, and the distribution of the antenna clusters. With the assumption that the antenna clusters are uniformly deployed in the coverage area, the impact of the antenna cluster size V on the uplink sum rate capacity is particularly investigated. The mean square access distance (MSAD), a function of V, is proposed as a reasonable metric instead of the uplink sum rate capacity. From the analysis of the asymptotic behavior of MSAD, we derive an approximate closed-form expression for the expectation of MSAD over system topologies. Then, it is concluded that the ergodic uplink sum rate capacity can be improved due to access distance reduction by scattering AEs further only when V > M. An approximate closed-form expression for the relative variance of MSAD is also derived. And we conclude that the outage uplink sum rate capacity can be improved due to macro-diversity by scattering AEs further only when V ≤ M. In other words, when V ≤ M, the ergodic uplink sum rate capacity can not be improved by scattering AEs further, when V > M, the outage uplink sum rate capacity can not be improved by scattering AEs further. Finally, our analysis is well verified by Monte Carlo simulations.     

Transmit antenna selection of correlated MIMO multiuser cognitive radio networks in Nakagami‐m fading channels

In this paper, we examine the impact of antenna correlation on transmit antenna selection with receive maximal ratio combining (TAS/MRC) in multiple‐input multiple‐output multiuser underlay cognitive radio network (MIMO‐MCN) over a Nakagami‐m fading environment. The secondary network under consideration consists of a single source and M destinations equipped with multiple correlated antennas at each node. The primary network composed of L primary users, each of which is equipped with multiple correlated antennas. For the considered underlay spectrum sharing paradigm, the transmission power of the proposed secondary system is limited by the peak interference limit on the primary network and the maximum transmission power at the secondary network. In particular, we derive exact closed‐form expressions for the outage probability and average symbol error rate of the proposed secondary system. To gain further insights, simple asymptotic closed‐form expressions for the outage probability and symbol error rate are provided to obtain the achievable diversity order and coding gain of the system. In addition, the impact of antenna correlation on the secondary user ergodic capacity has been investigated by deriving closed‐form expressions for the secondary user capacity. The derived analytical formulas herein are supported by numerical and simulation results to clarify the main contributions. Copyright © 2016 John Wiley & Sons, Ltd.     

Performance analysis of achievable sum‐rate for downlink massive MIMO systems

Massive multiple‐input and multiple‐output (MIMO) has been recognized as a promising technology in the fifth‐generation wireless networks. Under perfect channel state information, we derive three tractable closed‐form expressions that corresponding to the lower bound, approximation, and upper bound on the achievable rate in a massive MIMO downlink system with maximum‐ratio transmission precoding. Based on the proposed closed‐form expressions, the power efficiency of the system is investigated as the number of transmit antennas increases. Simulation results demonstrate the tightness of our proposed closed‐form expressions for the achievable sum‐rate.     

Selfishness and altruism on the MISO interference channel: the case of partial transmitter CSI

We study the achievable ergodic rate region of the two-user multiple-input single-output interference channel, under the assumptions that the receivers treat interference as additive Gaussian noise and the transmitters only have statistical channel knowledge. Initially, we provide a closed-form expression for the ergodic rates and derive the Nash-equilibrium and zero-forcing transmit beamforming strategies. Then, we show that combinations of the aforementioned selfish and altruistic, respectively, strategies achieve Pareto-optimal rate pairs.     

Utility-Based Optimal Precoding for SWIPT in MIMO Broadcasting Systems

In this paper, we focus on optimal precoding for simultaneous wireless information and power transfer in multiple-input multiple-output broadcasting systems. A utility function, which is a nonnegative weighted sum of the achievable data rate and the received energy, is designed to effectively allocate the available power. Then, the problem of optimal precoding is formulated as a utility maximization problem, and a closed-form solution is provided. In order to clearly illustrate the rate-utility tradeoff, a two-tier optimization structure is adopted, and the corresponding two-tier optimization algorithm, for which the outer-tier optimization is accomplished by the golden section search method, is also provided. Our results indicate that the maximum information transmission and the energy transfer must be well balanced in order to maximize the total payoff, and the method employed by this paper can obtain the unique precoding matrix for the optimal operating point.     

Optimal Power Allocation in an Amplify-and-Forward Untrusted Relay Network with Imperfect Channel State Information

The characteristics of the wireless medium create difficulty to shield the data transmission from unauthorized recipients. In this paper, power optimization in an amplify-and-forward untrusted relay network is presented, using cooperative jamming transmission to prevent the untrusted relay from intercepting the confidential signals. Considering imperfect channel estimation error at the destination, an optimal power allocation (OPA) is designed to maximize the achievable secrecy rate for the network. Simplified OPA is derived for high signal-to-noise ratio regime with imperfect CSI and the ergodic secrecy rate is also analyzed to evaluate the achievable average secrecy rate for different scenarios as a common performance metric. The numerical results show that when the error of CSI is considered, the proposed OPA generates limited and acceptable degradation on the secrecy rate.     

Capacity Analysis of MIMO Group-Broadcast Channels with Time-Division Scheduling

This paper investigates the ergodic sum capacity for a MIMO group-broadcast channel with time-division scheduling (TDS). In this scheme, the overall user set is divided into subgroups, among which a single user subgroup which maximizes the instantaneous sum capacity will be scheduled at a time. In order to characterize the TDS performance, we first derived an asymptotic bound to the full capacity obtained by dirty paper coding (DPC). This bound is a closed-form expression and performs well for different system configurations. Further concerning practical precoding techniques, we studied its achievable sum capacity by using block-diagonalization (BD) and zero-forcing (ZF) precoding. Based on these results, the achieved scheduling gain by TDS over random scheduling is analyzed. We also compared the scheduling gains under different transmission strategies including DPC, BD, and ZF precoding. The results reveal that TDS provides the largest scheduling gain for the system with ZF precoding. Finally, we also discussed the effect of the group cardinality on the performance of TDS. Numerical results show the tightness of derived capacity bounds and verify the correctness of our analysis.     

Throughput analysis for interference limited TDMA and TDMA/CDMA wireless ad hoc networks

The node throughput, which is defined as the total rate received at each node, is evaluated for the interference limited TDMA and TDMA/CDMA wireless ad hoc networks. In the TDMA wireless ad hoc network, there is only one transmission link connected to each node in the same time slot, whereas in the TDMA/CDMA wireless ad hoc network there are multiple transmission links connected to each node in the same time slot. We first derive the node throughput for these two wireless ad hoc networks and then make a comparison of the node throughput between them. The theoretical results and simulation results both reveal that the TDMA wireless ad hoc network outperforms the TDMA/CDMA wireless ad hoc network in the node throughput. Copyright © 2008 John Wiley & Sons, Ltd.     

Asymptotic uniform data-rate guarantees in large wireless networks

In this paper, we study asymptotic uniform data-rate guarantees in large wireless networks from an information-theoretic viewpoint. We consider the following question: what is the maximum achievable data rate that such a network can support for communication from an arbitrary radio node to its destination under transmission power and network-topology constraints, as the network size goes to infinity? In other words, we study the data-rate guarantee for an arbitrarily chosen source–destination pair assuming all other nodes act as relays. We consider two types of network deployments: (1) a regular deployment with unreliable nodes; and (2) a random deployment. We provide upper and lower bounds on the asymptotic achievable data rate for both linear and planar topologies under the two deployment models.     

BlueMesh: Degree-Constrained Multi-Hop Scatternet Formation for Bluetooth Networks

In this paper we describe BlueMesh, a new protocol for the establishment of scatternets, i.e., multi-hop wireless networks of Bluetooth devices. BlueMesh defines rules for device discovery, piconet formation and piconet interconnection so to generate connected scatternets with the following desirable properties. BlueMesh forms scatternets without requiring the Bluetooth devices to be all in each other transmission range. BlueMesh scatternet topologies are meshes with multiple paths between any pair of nodes. BlueMesh piconets are made up of no more than 7 slaves. Simulation results in networks with over 200 nodes show that BlueMesh is effective in quickly generating a connected scatternet in which each node, on average, does not assume more than 2.4 roles. Moreover, the route length between any two nodes in the network is comparable to that of the shortest paths between the nodes.     

Impact of Imperfect Channel State Information on the Physical Layer Security in D2D Wireless Networks Using Untrusted Relays

In this paper, we investigate the impact of channel estimation errors on the physical layer security of an overlaying device-to-device (D2D) wireless network with an amplify-and-forward untrusted relay. An untrusted relay assists D2D communication while may capture the confidential data. Under the practical assumption of imperfect channel state information (ICSI) for the relay-to-receiver D2D link, we take into account optimal power allocation (OPA) problem to maximize the achievable secrecy rate of two different scenarios which are without jamming and with friendly jamming. Based on these OPA solutions, we study the secrecy performance of the two scenarios by driving closed-form expressions for the ergodic secrecy rate (ESR) in Rayleigh fading channel. We also calculate the high signal-to-noise ratio (SNR) slope and high SNR power offset of the optimized scenarios by finding the asymptotic ESR. Numerical results confirm the accuracy of our proposed theoretical analysis. The results also demonstrate that our proposed OPAs enhance the ESR performance compared with other power allocation techniques. Moreover, they show the effect of ICSI on the ESR such that as channel estimation error grows, the ESR performance reduction is occurred.

     

Introducing Space into MIMO Capacity Calculations

The large spectral efficiencies promised for multiple-input multiple-output (MIMO) wireless fading channels are derived under certain conditions which do not fully take into account the spatial aspects of the channel. Spatial correlation, due to limited angular spread or insufficient antenna spacing, significantly reduces the performance of MIMO systems. In this paper we explore the effects of spatially selective channels on the capacity of MIMO systems via a new capacity expression which is more general and realistic than previous expressions. By including spatial information we derive a closed-form expression for ergodic capacity which uses the physics of signal propagation combined with the statistics of the scattering environment. This expression gives the capacity of a MIMO system in terms of antenna placement and scattering environment and leads to valuable insights into the factors determining capacity for a wide range of scattering models.     

Broadcast capacity of wireless networks

We present an upper bound on the broadcast capacity of arbitrary ad hoc wireless networks. The throughput obtainable by each node for broadcasting to-all-of the other nodes in a network consisting of n nodes with- fixed transmission ranges and C bits per second channel capacity is bounded by O(C/n), which is equivalent to the upper bound for per node capacity of a fully connected single-hop network.     

Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.