多小区蜂窝网络波束成形优化策略

为了克服多小区的邻小区干扰问题,该文在多小区蜂窝网络中,研究了多小区多用户下行协同传输技术。该文提出一种联合优化基站和中继的波束成形权重的迭代算法,在基站和中继总功率限制下最大化最差用户接收信干噪比(Signal-to-Interference-and-Noise Ratio, SINR)。该文提出的联合优化波束成形策略,可以应用半正定松弛技术(Semi-Definite Relaxation, SDR)得到有效的解决。仿真表明,在多小区通信系统中,该文提出的迭代算法只需要少量的迭代次数就可以达到近似最优性能,并且在性能和资源消耗之间给出一种折中的传输策略。     

Beamforming for inter‐relay interference reduction in MIMO‐aided two‐path successive relaying

To effectively reduce the inter‐relay interference (IRI) in two‐path successive relaying, two beamforming schemes are proposed in this paper, utilizing multiple‐antenna relay nodes. Specifically, the two cooperation nodes perform receive combining of the source signal and transmit beamforming of the relayed signal alternately in the successive relaying process. As a result, the IRI between them can be effectively suppressed, thanks to the additional degree of freedom provided by the multiple‐input multiple‐output inter‐relay channel. In the first beamforming scheme, the source‐to‐destination signal‐to‐interference‐plus‐noise ratios (SINR) of separate paths are maximized with approximation, leading to a minimum variance distortionless response beamformer under the high SINR condition. To further improve the system performance, noting that the received SINRs of the two paths have impact on each other due to the mutual coupling of the beamformers, the sum of mean squared errors from these two transmission paths is minimized in the second scheme. Based on this performance criterion, a suboptimal beamformer design is developed numerically through cyclic minimization of the sum of mean squared error cost function. Simulation results demonstrate the superiority of both proposed beamforming schemes in terms of symbol error rate and the achievable system rate, in particular, at high IRI levels. Copyright © 2016 John Wiley & Sons, Ltd.     

Cooperative beamforming and relay selection in cognitive radio systems

In this paper, a new scheme is suggested for cooperative beamforming (BF) and relay selection in CR networks, where a pair of secondary users communicates with each other assisted by some multiple antenna relay nodes. The goal of the algorithm is to maximize signal to interference plus noise ratio of secondary user receiver subject to limited interference caused for primary user receiver and power constraints of relay nodes. The relay selection and BF optimization problem is solved separately by employing convex semidefinite programming through rank‐one relaxation. It is shown that our proposed algorithm outperforms conventional relay selection and BF schemes. Copyright © 2014 John Wiley & Sons, Ltd.     

Joint Optimization of Source Power Allocation and Relay Beamforming in Multiuser Cooperative Wireless Networks

Relay beamforming techniques have been shown to significantly enhance the sum capacity of a multiuser cooperative wireless network through the optimization of the relay weights, where concurrent communications of multiple source-destination pairs are achieved via spatial multiplexing. Further optimization of the transmit power allocation over the source nodes is expected to improve the network throughput as well. In this paper, we maximize the sum capacity of a multiuser cooperative wireless network through the joint optimization of power allocation among source nodes and relay beamforming weights across the relay nodes. We consider a two-hop cooperative wireless network, consisting of single-antenna nodes, in which multiple concurrent links are relayed by a number of cooperative nodes. When a large number of relay nodes are available, the channels of different source-destination pairs can be orthogonalized, yielding enhanced sum network capacity. Such cooperative advantage is particularly significant in high signal-to-noise ratio (SNR) regime, in which the capacity follows a logarithm law with the SNR, whereas exploiting spatial multiplexing of multiple links yields capacity increment linear to the number of users. However, the capacity performance is compromised when the input SNR is low and/or when the number of relay nodes is limited. Joint optimization of source power allocation and relay beamforming is important when the input SNR and/or the number of relay nodes are moderate or the wireless channels experience different channel variances. In these cases, joint optimization of source power and distributed beamforming weights achieves significant capacity increment over both source selection and equal source power spatial multiplexing schemes. With consideration of the needs to deliver data from each source node, we further examine the optimization of global sum capacity in the presence of individual capacity requirements by maximizing sum capacity of the network subject to a minimum capacity constraint over each individual user.     

Energy‐Aware Hybrid Cooperative Relaying with Asymmetric Traffic

In this paper, we study an asymmetric two‐way relaying network where two source nodes intend to exchange information with the help of multiple relay nodes. A hybrid time‐division broadcast relaying scheme with joint relay selection (RS) and power allocation (PA) is proposed to realize energy‐efficient transmission. Our scheme is based on the asymmetric level of the two source nodes’ target signal‐to‐noise ratio indexes to minimize the total power consumed by the relay nodes. An optimization model with joint RS and PA is studied here to guarantee hybrid relaying transmissions. Next, with the aid of our proposed intelligent optimization algorithm, which combines a genetic algorithm and a simulated annealing algorithm, the formulated optimization model can be effectively solved. Theoretical analyses and numerical results verify that our proposed hybrid relaying scheme can substantially reduce the total power consumption of relays under a traffic asymmetric scenario; meanwhile, the proposed intelligent optimization algorithm can eventually converge to a better solution.     

Multiple Peer-to-Peer Communications Using a Network of Relays

We consider an ad hoc wireless network consisting of d source-destination pairs communicating, in a pairwise manner, via R relaying nodes. The relay nodes wish to cooperate, through a decentralized beamforming algorithm, in order to establish all the communication links from each source to its respective destination. Our communication strategy consists of two steps. In the first step, all sources transmit their signals simultaneously. As a result, each relay receives a noisy faded mixture of all source signals. In the second step, each relay transmits an amplitude- and phase-adjusted version of its received signal. That is each relay multiply its received signal by a complex coefficient and retransmits the so-obtained signal. Our goal is to obtain these complex coefficients (beamforming weights) through minimization of the total relay transmit power while the signal-to-interference-plus-noise ratio (SINR) at the destinations are guaranteed to be above certain predefined thresholds. Although such a power minimization problem is not convex, we use semidefinite relaxation to turn this problem into a semidefinite programming (SDP) problem. Therefore, we can efficiently solve the SDP problem using interior point methods. Our numerical examples reveal that for high network data rates, our space division multiplexing scheme requires significantly less total relay transmit power compared to other orthogonal multiplexing schemes, such as time-division multiple access schemes.     

Adaptive linearly constrained minimum variance beamforming for multiuser cooperative relaying using the kalman filter

In this paper, we consider a wireless communication scenario with multiple source-destination pairs communicating through several cooperative amplify-and-forward relay terminals. The relays are equipped with multiple antennas that receive the source signals and transmit them to the destination nodes. We develop two iterative relay beamforming algorithms that can be applied in real-time. In both algorithms, the relay beamforming matrices are jointly designed by minimizing the received power at all the destination nodes while preserving the desired signal at each destination. The first algorithm requires the existence of a local processing center that computes the beamforming coefficients of all the relays. In the second algorithm, each relay can compute its beamforming coefficients locally with the help of some common information that is broadcasted from the other relays. This is achieved at the expense of enforcing the desired signal preservation constraints non-cooperatively. We provide two extensions of the proposed algorithms that allow the relays to control their transmission power and to modify the quality of service provided to different sources. Simulation results are presented validating the ability of the proposed algorithms to perform their beamforming tasks efficiently and to track rapid changes in the operating environment.     

Energy‐efficient resource allocation in D2D communications for energy harvesting–enabled NOMA‐based cellular networks

In this paper, we propose an energy‐efficient power control and harvesting time scheduling scheme for resource allocation of the subchannels in a nonorthogonal multiple access (NOMA)–based device‐to‐device (D2D) communications in cellular networks. In these networks, D2D users can communicate by sharing the radio resources assigned to cellular users (CUs). Device‐to‐device users harvest energy from the base station (BS) in the downlink and transmit information to their receivers. Using NOMA, more than one user can access the same frequency‐time resource simultaneously, and the signals of the multiusers can be separated successfully using successive interference cancellation (SIC). In fact, NOMA, unlike orthogonal multiple access (OMA) methods, allows sharing the same frequency resources at the same time by implementing adaptive power allocation. Our aim is to maximize the energy efficiency of the D2D pairs, which is the ratio of the achievable throughput of the D2D pairs to their energy consumption by allocating the proper subchannel of each cell to each device user equipment (DUE), managing their transmission power, and setting the harvesting and transmission time. The constraints of the problem are the quality of service of the CUs, minimum required throughput of the subchannels, and energy harvesting of DUEs. We formulate the problem and propose a low‐complexity iterative algorithm on the basis of the convex optimization method and Karush‐Kuhn‐Tucker conditions to obtain the optimal solution of the problem. Simulation results validate the performance of our proposed algorithm for different values of the system parameters.     

Antenna subset selection at multi‐antenna relay with adaptive modulation

In this paper, we proposed several antenna selection schemes for cooperative diversity systems with adaptive transmission. The proposed schemes were based on dual‐hop relaying where a relay with multiple‐antenna capabilities at reception and transmission is deployed between the source and the destination nodes. We analyzed the performance of the proposed schemes by quantifying the average spectral efficiency and the outage probability. We also investigated the trade‐off of performance and complexity by comparing the average number of active antennas, path estimations, and signal‐to‐noise ratio comparisons of the different proposed schemes. Copyright © 2011 John Wiley & Sons, Ltd.     

Relaying Schemes Using Matrix Triangularization for MIMO Wireless Networks

Multiple input multiple output (MIMO) relay networks are wireless communication systems comprising of multiple nodes, each of which is equipped with multiple antennas. Information theories have shown that using multiple nodes to simultaneously relay a message can improve the capacity of source-to-destination communications. In this paper, we propose new relaying schemes for MIMO relay networks. The major concept behind the proposed schemes is to transform each of the MIMO relay channels into an equivalent triangular channel with positive real diagonal entries. By doing so, the resultant MIMO relay channel can simultaneously offer both distributed array gain (diversity gain obtained among relay nodes) and intranode array gain (diversity gain realized by multiple antennas of individual relay node) while maintaining the maximum spatial multiplexing gain (number of parallel data pipes). Based on this concept, three relaying schemes are derived that perform QR decomposition and phase control. Numerical results confirm that at least one of the proposed schemes outperforms the amplify-and-forward and the zero-forcing relaying schemes under various conditions. Moreover, we show that ratios of noise power level at relay and destination node have a great impact on capacities.     

Channel and queue aware joint relay selection and resource allocation for MISO-OFDMA based user-relay assisted cellular networks

User-relay assisted orthogonal frequency division multiple access (OFDMA) networks are cost-effective solutions to meet the growing capacity and coverage demands of the next generation cellular networks. These networks can be used with multiple antennas technology in order to obtain a diversity gain to combat signal fading and to obtain more capacity gain without increasing the bandwidth or transmit power. Efficient relay selection and resource allocation are crucial in such a multi-user, multi-relay and multi-antenna environment to fully exploit the benefits of the combination of user-relaying and multiple antennas technology. Thus, we propose a channel and queue aware joint relay selection and resource allocation algorithm for multiple-input single-output (MISO)-OFDMA based user-relay assisted downlink cellular networks. Since, the proposed algorithm is not only channel but also queue-aware, the system resources are allocated efficiently among the users. The proposed algorithm for the MISO-OFDMA based user-relay assisted scheme is compared to existing MISO-OFDMA based non-relaying and fixed relay assisted schemes and it is also compared with the existing single-input single-output (SISO)-OFDMA based user-relay assisted scheme. Simulation results revealed that the proposed scheme outperforms the existing schemes in terms of cell-edge users’ total data rate, average backlog and average delay.     

MUSIC-Based Pilot Decontamination and Channel Estimation in Multiuser Massive MIMO System

This paper addresses the problem of channel estimation in a multiuser multi-cell wireless communications system in which the base station (BS) is equipped with a very large number of antennas (also referred to as “massive multiple-input multiple-output (MIMO)”). We consider a time-division duplexing (TDD) scheme, in which reciprocity between the uplink and downlink channels can be assumed. Channel estimation is essential for downlink beamforming in massive MIMO, nevertheless, the pilot contamination effect hinders accurate channel estimation, which leads to overall performance degradation. Benefitted from the asymptotic orthogonality between signal and interference subspaces for non-overlapping angle-of arrivals (AOAs) in the large-scale antenna system, we propose a multiple signals classification (MUSIC) based channel estimation algorithm during the uplink transmission. Analytical and numerical results verify complete pilot decontamination and the effectiveness of the proposed channel estimation algorithm in the multiuser multi-cell massive MIMO system.     

Efficient Beamforming by SLNR Maximization for Dual-Hop Relay Assisted MIMO Network

Relay beamforming is a key signal processing technique to mitigate interference in single and multiuser multiple input and multiple output (MIMO) wireless communication networks. In MIMO relay networks interference cancellation is an essential task of the study to get optimal network capacity. In this paper, the problem of interference resulted from leakage signal from desired signal for intended antenna, which causing interference to other antennas of the same user with multiple antennas is tackled. The criterion of signal to leakage plus noise ratio (SLNR) maximization is considered to design a vector by vector relay downlink precoding based on Fukunaga Koontz transform. This can control the interference among multiple antennas and maximize SLNR. However, matched filter beamforming is utilized at the relay receiving side that can increase output signal to noise ratio at the relay node. The channel state information of both the channel between source to relay and relay to destination is assumed at the relay node. The effectiveness of the proposed technique is studied and compared with conventional relay precoding techniques. Simulation is carried out in MATLAB environment using ideal channel conditions. This study demonstrates that, the proposed scheme for relay assisted MIMO networks can improve overall system performance in terms of ergodic capacity.     

Predictive downlink beamforming for wideband CDMA over Rayleigh-fading channels

A new approach to adaptive downlink beamforming to combat fast Rayleigh fading is presented. In this approach, the antennas at the base transceiver station form transmit beam patterns according to the prediction of downlink channels. The channel prediction is a linear prediction based on the autoregressive model, which is downsampled to extend the memory span given fixed model order. For a wideband code-division multiple-access downlink, pre-RAKE transmission is employed to achieve the multipath diversity gain. In particular, we combine pseudoinverse directions of arrival beamforming with pre-RAKE transmission to alleviate self-interference. The beamforming weights are adjusted within a downlink frame to compensate the predicted fading. We give measures of the prediction and beamforming performance and evaluate the impact of prediction errors on the downlink. Ray tracing simulations in a three-dimensional urban physical model show that the predictive downlink beamforming outperforms the conventional beamforming over Rayleigh-fading channels.     

Joint beamforming and power control in downlink multiuser multiple‐input multiple‐output systems

In this paper, we study joint beamforming and power control for downlink multiple‐input multiple‐output systems with multiple users and target values for signal‐to‐interference plus noise ratios (SINRs). We formulate this as a constrained optimization problem of minimizing total interference subject to constraints on the beamforming vector norms, target SINRs, and total transmit power. Necessary and sufficient conditions satisfied by the optimal beamformer and power allocation are presented, and a new algorithm for joint beamforming and power control is proposed. This adapts the beamforming vectors and transmit powers incrementally, and it stops when the specified SINR targets are achieved with minimum powers. The proposed algorithm is illustrated with numerical results obtained from simulations, which study its convergence and compare it with other similar algorithms. Copyright © 2013 John Wiley & Sons, Ltd.     

Design of Distributed Beamforming for Dual‐Hop Multiple‐Access Relay Networks

This paper studies a dual‐hop multiple‐access relay network where two independent source nodes transmit information to a common destination node with the aid of multiple single‐antenna amplify‐and‐forward relays. Each relay node is subject to an individual power constraint. We focus on the design of distributed beamforming schemes for the relays to support the transmission rate requirements of the two sources. To this end, we first characterize the achievable rate region for this network via solving a sequence of corner point optimization problems proposed in this paper. We also develop several low‐complexity suboptimal schemes in closed form. Two inner bounds of the achievable rate region are theoretically shown to be approximately optimal in two special scenarios. Finally, numerical results demonstrate the effectiveness of our proposed approaches.     

Performance analysis of spectrally efficient amplify‐and‐forward opportunistic relaying scheme for adaptive cooperative wireless systems

In this paper, we propose an adaptive amplify‐and‐forward (AF) relaying scheme that selects the best relay among the available relay nodes opportunistically to cooperate with a source node for improvement of the spectral efficiency. This improvement can be achieved by introducing a policy that gives the useful cooperative regions and defines a switching threshold signal‐to‐noise ratio that guarantees the bit error rate (BER) of cooperative transmission is below the target. We model all links as independent non‐identically distributed Rayleigh fading channels. We then derive closed‐form expressions for the average spectral efficiency, average BER, and outage probability when an upper bound for the signal‐to‐noise ratio of the end‐to‐end relay path is applied and adaptive discrete rate is considered. Numerical and simulation results show that the proposed scheme, compared with the outage‐based AF incremental relaying, AF fixed relaying, and the conventional direct transmission, can achieve the maximum average spectral efficiency while maintaining the average BER and outage probability. Copyright © 2013 John Wiley & Sons, Ltd.     

SNR based secure communication via untrusted amplify-and-forward relay nodes using artificial noise

A two-phase beamforming solution for secure communication using untrusted relay nodes is presented. To thwart eavesdropping attempts of participant relay nodes, we deliberately introduce artificial noise in the source message. We observe that for certain scenarios, the source node prefers to allocate its full power to the message signal and, therefore, in the absence of artificial noise, such transmissions will be vulnerable to eavesdropping. Therefore, we provide a signal-to-noise ratio (SNR) based framework for secure communication. We intend to bring down the SNR at each of the untrusted relay nodes below a certain predefined threshold; whereas, using beamforming, we want to boost the SNR at the destination. With this motive, we evaluate the optimal scaling vector for the beamforming phase, which not only nullifies the artificial noise transmitted initially, but also maximizes the SNR at the destination. We discuss both the total and individual power constraint scenarios and provide an analytical optimal solution and an iterative algorithm, respectively.     

Two-way cooperative communications with statistical channel knowledge

We consider the problem of distributed beamforming for a two-way relay network which consists of two transceivers and multiple relay nodes. The main assumption in this work, which differentiates it from previously reported results, is that one of the transceivers is assumed to have only statistical information about channels between the other transceiver and the relay nodes. This assumption imposes less stringent restrictions on the bandwidth required to obtain channel state information via training. Based on this statistical modeling, we propose to use a chance-constrained programming approach to design a distributed beamforming algorithm. In this approach, we aim to minimize the total transmit power (consumed in the entire network) as perceived by one of the transceivers, subject to two probabilistic constraints. These constraints guarantee that the outage probability of the transceivers' received SNRs, as perceived by the master transceiver, is not less than certain given thresholds. We prove rigorously that such an approach leads to a relay selection algorithm where the relay with the strongest channel coefficient to the master transceiver participates in relaying and the remaining relays are shut off. As such, the optimal distributed beamforming algorithm is simplified to a power control solution. Closed-form solution to this problem is obtained and its performance is evaluated through numerical examples.