Energy efficient bidirectional relay network with spatial modulation

S patial modulation is a potential candidate for 5G wireless communication systems that provides high spectral efficiency with high reliability and low complexity. Spatial modulation conveys information in the index of transmitting antenna along with conventional modulation scheme. Also, energy efficiency communication plays a vital role in 5G wireless communication. In this article, energy efficiency and spectral efficiency are focused on a bidirectional relay network. In the proposed bidirectional relay network, the energy consumption burden at the relay node is reduced by placing a power splitter that coordinates the energy harvesting and information processing at the relay node. Spatial modulation is employed at all nodes to reduce the effect of interchannel interference and synchronization problem in the receiver. The combined effect of spatial modulation in all nodes and energy harvest at the relay node are analyzed in the bidirectional relay network. The end‐to‐end outage probability expression for the bidirectional relay network is derived in terms of power splitting factor at relay node. Analytical simulation results have been verified by Monte‐Carlo simulations. The overall performance of the proposed system is compared with an existing literature and found that the proposed system is having better spectral efficiency and energy harvesting.     

An amplify‐and‐forward and decode‐and‐forward mixed relay communication system and its performance analysis

A kind of amplify‐and‐forward (AF) and decode‐and‐forward (DF) mixed relay communication system is proposed in this letter. The source broadcasts the signal to all the relays. Relays that can decode the signal adopt DF scheme to retransmit the signal, while the rest adopt AF scheme for retransmission. The destination employs maximum ratio combining technique to maximize the received signal‐to‐noise ratio. Another situation concerned in this letter is that when the relay cannot decode the source signal, it may retransmit the interference signal with AF scheme. Closed‐form expressions of outage probability are derived. Simulation results show that the analytical curves agree with the simulated ones very well, and the AF‐DF mixed relay system can improve the availability of the relays. Copyright © 2013 John Wiley & Sons, Ltd.     

Optimal power‐aware relay placement for cooperative wireless sensor networks

We study the problem of optimizing the symbol error probability (SEP) performance of cluster‐based cooperative wireless sensor networks. Recent studies in literature show that an efficient relay selection protocol based on simple geographical information of the nodes to execute cooperative diversity can significantly improve the SEP performance at the destination of such networks. As well, similar line of research on optimal power allocation (for the source and relay nodes) can be found in literature. However, to achieve the best SEP performance at the destination of a cooperative wireless sensor network, joint optimization of power allocation and relay placement should be accomplished. To this aim, we reformulate the SEP of a multi‐hop cooperative communication in a general form and optimize transmitted power level and relay placement simultaneously. This analysis is developed for both amplify‐and‐forward and decode‐and‐forward relaying protocols. Simulation results demonstrate that the proposed joint optimization can effectively improve the SEP performance of the network. Copyright © 2013 John Wiley & Sons, Ltd.     

Performance analysis of two‐way wireless‐powered Amplify‐and‐Forward relaying in the presence of co‐channel interference

In this paper, we investigate the performance assessment of a bidirectional relaying system using energy harvesting techniques. We assume independent and nonidentically distributed (i.n.i.d.) Nakagami‐m fading channels where the amplify‐and‐forward relay is subject to co‐channel interference (CCI) due to transmissions of other transmitters. Two different scenarios, namely, scenario I and scenario II are evaluated. In scenario I, both end‐sources provide the required energy for the relay, whereas the relay also harvests energy from the co‐channel interferes. Then, in the first phase of cooperation, both end‐sources send the information to the relay, and after amplifying the received signal, relay transfers information to the appropriate destination in the second time‐slot. In the scenario II, both end‐sources harvest energy from the relay. After that, the information cooperative transmission is done similar to the first scenario. For both considered scenarios, tight closed‐form expressions of outage probability, symbol error probability, ergodic capacity, and throughput are obtained at arbitrary signal‐to‐noise‐ratios (SNRs). To get more insights, simplified high SNR results for both scenarios are also deduced where the diversity orders are obtained. Monte Carlo simulation results are presented to validate the correctness of our proposed analysis. Our results explicitly demonstrate that the first scenario has a better performance than the second one in the medium and high SNR region, whereas the second scenario outperforms the first one in the low SNR regime.     

Artificial noise–aided secure communication in a bidirectional relaying network

An artificial noise strategy is proposed for amplify‐and‐forward bi‐directional relay network where the eavesdropper can wiretap the relay channels in both hops. Artificial noise is used to confuse the eavesdropper and improve its secrecy. Specifically, the source and the relay are allowed to split their available transmit power into 2 parts: a useful information portion and a jamming portion to transmit a jamming signal. The mathematical model is established for 2‐way relay network with an eavesdropper. The secrecy rate achieved by using artificial jamming is derived from the above model. The optimal power allocation with individual power constraint is obtained via sequential quadratic programming to maximize the secrecy sum rate, and 2 special cases are investigated. Furthermore, the benchmark is provided for the purpose of performance comparison. Simulation results show that the proposed strategy can significantly improve the secrecy sum rate by using artificial noise to jam the eavesdropper.     

Secure communication in cognitive radio networks with untrusted AF relays

In this paper, two underlay based cognitive cooperative radio networks, each with one secondary source (SS), one secondary destination (SD), N untrusted secondary amplify and forward relays (USAFRs), one primary transmitter, and one primary receiver (PU‐RX), are considered for evaluating the secrecy performance. The SS sends the information to the SD in two time slots via multiple USAFRs in the absence of direct link between SS and SD. In the first time slot, SS and SD transmit the message and jamming signal to multiple USAFRs, respectively. In the second slot, a selected USAFR amplifies and forwards the combined received signals to the SD. The transmit powers of the secondary nodes are chosen so as to maintain the overall interference at PU‐RX below a specified limit. The transmit power of a selected USAFR is derived using the harvested energy from the RF signals of SS and SD. Two network scenarios of eavesdropping by USAFRs are studied: in one case, all USAFRs eavesdrop; while in the second case, only the selected USAFR eavesdrops the message during forwarding of the signal and power is allocated to secondary nodes on the basis of outage threshold of primary network. We investigate the secrecy outage probability (SOP) in both of the networks under several physical parameters. Analytical framework for evaluating SOP for both the cases are given while SOP in single integration form is given for the second case. MATLAB simulation results are presented for both the cases.     

Performance of cognitive relay network with energy harvesting relay under imperfect CSI

This paper evaluates the performance of an underlay cognitive relay network under imperfect channel state information (CSI) where a secondary user (SU) transmits using a secondary relay (SR) based on decode and forward scheme. The outage probability (OP) of SU is investigated in a scenario where the decode and forward relay harvests energy from radio frequency signal of SU. The relay uses a fraction of time for harvesting in time switching–based relaying (TSR) while a fraction of received power is used for harvesting in power splitting–based relaying (PSR) scheme. The SU and relay control their transmit power using a scaling factor, based on CSI of the interfering links (ie, links from SU transmitter and SR to the primary user [PU] receiver) to protect the quality of service of PU. The available CSI at the SU and SR are imperfect due to practical limitation. Analytical expressions of the OP are derived for TSR‐ and PSR‐based schemes. The impact of harvesting time, power splitting ratio, imperfect CSI, PU outage constraint and interference threshold on the OP of the SU network, and average transmit power of SR is indicated. Further, the impact of multiple SRs is also shown.     

能量收集双向中继网络的中继选择和功率分配

结合能量收集技术,研究了放大转发双向中继网络的系统性能。基于双向中继系统中的两个端到端信噪比平衡准则,推导出了单中继选择情况下信源最优的功率分配方案和中继最优的能量收集比例。仿真结果证明所提方法能够实现最好的系统性能。通过比较发现,能量收集双向中继网络比传统双向中继网络能够实现更高的传输速率。     

Quasi‐optimal power allocation based on ergodic capacity for wireless relay networks

Half‐duplex amplify‐and‐forward (AF) transmissions may result in insufficient use of degrees of freedom if they always use the cooperative mode regardless of the fading states. In this paper, we investigate the conditions under which cooperation offers better performance and the corresponding optimal power allocation during cooperation. Specifically, we first derive an expression of ergodic capacity and its upper bound for an AF cooperative communication system with n relay nodes. Secondly, we propose a novel quasi‐optimal power allocation (QOPA) scheme to maximize the upper bound of the derived ergodic capacity. For the QOPA scheme, the cooperative mode is only adopted when the channel gain of source‐to‐destination is worse than that of relay‐to‐destination. Moreover, we analyze the performance of the system with QOPA scheme when the relay moves, which is based on the random direction model, in a single‐relay wireless network. For a multi‐relay AF network, we compare the ergodic capacity and symbol error rate, corresponding to the proposed QOPA and equal power allocation schemes, respectively. Extensive simulations were conducted to validate analytical results, showing that both ergodic capacity and symbol error rate of the system with QOPA scheme are better than those of the system with equal power allocation scheme in a multi‐relay AF network. Copyright © 2011 John Wiley & Sons, Ltd.     

Particle swarm optimization–based power allocation for Alamouti amplify and forward relaying protocol

The performance of wireless communication systems is improved over flat fading channel by using Alamouti coding scheme, which provides the quality of diversity gain. In this paper, performance analysis of symbol error rate (SER) and particle swarm optimization (PSO)–based power allocation (PA) for Alamouti amplify and forward (AF) relaying protocol using maximum ratio combining (MRC) technique is presented. Analytical expression of SER upper bound and SER approximation is derived for Alamouti AF relaying protocol with quadrature phase shift keying (QPSK) modulation over Rayleigh fading channel and Rician fading channel. In addition, PSO‐based optimum PA factor is calculated on the basis of the minimum SER of proposed method. PSO‐based optimum PA gives 0.5 dB of improved signal‐to‐noise ratio (SNR) compared with the equal power allocation (EPA). The theoretical approximate SER result is compared with the simulated SER. The proposed protocol provides full diversity gain and reduces SER compared with the existing AF and decode and forward (DF) relaying protocols over Rayleigh fading channel and Rician fading channel.     

A POMDP‐based long‐term transmission rate maximization for cognitive radio networks with wireless‐powered ambient backscatter

Wireless energy harvesting enables wireless‐powered communications to accommodate data services in a self‐sustainable manner over a long operational time. Along with energy harvesting, an ambient backscatter technique helps a secondary transmitter reflect existing radio frequency (RF) signal sources to communicate with a secondary receiver when the primary channel (PC) is utilized. However, secondary system performance is significantly affected by factors such as the availability of the primary channel, imperfect spectrum sensing, and energy‐constrained problems. Therefore, we propose a novel approach for wireless‐powered cognitive radio networks (CRNs) to improve the transmission performance of secondary systems. To reduce the dependence of the secondary system on RF sources, in the paper, we provide a new paradigm by integrating ambient backscattering with both RF and non‐RF wireless‐powered communications to facilitate secondary communications. On the basis of the sensing result in a time slot, the secondary transmitter can dynamically select the operational action: (a) backscattering, (b) harvesting, or (c) transmitting to maximize the long‐term achievable data transmission rate at the secondary receiver. In addition, the optimal action set for CRNs with wireless‐powered ambient backscatter is selected by the partially observable Markov decision process (POMDP), which maximizes an expected transmission rate calculated over a number of subsequent time slots. The proposed scheme aims to improve long‐term transmission rate of CRNs with wireless‐powered ambient backscatter in comparison with conventional schemes where an action is taken only to maximize the immediate reward in every single time slot.     

Two‐pilot channel estimation scheme for amplify‐and‐forward relay networks

In amplify‐and‐forward relay networks, the equivalent channel to the destination node is not independent of equivalent noise and the equivalent noise does not follow a Gaussian distribution. Therefore, it is difficult to directly estimate the equivalent channel based on traditional optimal rules. In this paper, we propose a two‐pilot estimation (TPE) scheme that decomposes a non‐Gaussian noise channel estimation problem into two channel estimation problems in Gaussian noise. In TPE scheme, the relay‐destination channel is first estimated by one pilot and the other pilot is used to estimate the equivalent channel with the aid of the estimated relay‐destination channel. Simulation results show that the TPE scheme can achieve less estimation error and larger system throughput than other existing channel estimators in slow fading case. Copyright © 2012 John Wiley & Sons, Ltd.     

Power allocation and relay selection for AF two‐path successive relaying networks

Two‐path or successive relaying, which aims to establish two relay links transmitting different information symbols in adjacent time slots, has recently emerged as an attractive wireless communication protocol to improve the spectral efficiency in half‐duplex cooperative systems. In this paper, we investigate power allocation and relay selection techniques for amplify‐and‐forward two‐path successive relaying networks. Our approach is based on the maximization of the received SNR subject to a total power budget consumed by the source and the relay assisting this specific transmission. Two scenarios including with and without direct link are considered here. We show that the main problem has a closed‐form solution and only requires a few amounts of feedback bits to be broadcasted. Numerical results reveal that the proposed approaches are more insensitive to the inter‐relay interference and robust to channel estimation errors; meanwhile, they perform better than the existing schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

Iterative receiver for amplify‐and‐forward relay networks with unknown noise correlation

For amplify‐and‐forward relay networks, we propose an iterative scheme to estimate channel and detect information symbols for the multi‐antenna destination in spatially correlated noise. The equivalent channel coefficients and noise covariance are estimated by expectation–maximization algorithm. In addition, we discuss the initialization of iteration and analyze the modified Cramér–Rao bound to show the performance of the proposed iterative estimation. Moreover, on the basis of the structure of the proposed iterative estimator, a joint channel estimation and detection receiver is also provided. Finally, simulation results show that the proposed channel estimator and receiver can achieve the optimal performances in amplify‐and‐forward relay networks with unknown noise correlation. Copyright © 2012 John Wiley & Sons, Ltd.     

Power allocation in OFDM cognitive radio relay networks with outdated channel state information

In this paper, we study power allocation in OFDM cognitive radio (CR) relay networks. The objective of power allocation is to maximize the instantaneous capacity of the CR network. It is assumed that the available channel state information between the secondary and primary users is an outdated but correlated version of the actual instantaneous channel state information. Optimal power allocation schemes are developed for both decode‐and‐forward and amplify‐and‐forward relay assisted CR transmission, assuming that the primary users are subject to average interference constraints and the CR transmitters are subject to maximum transmit power constraint. In addition, suboptimal power allocation schemes with reduced complexity are also proposed. Performance of the proposed schemes is compared with uniform power allocation and numerical results confirm that the proposed power allocation schemes achieve significant capacity improvement in comparison to uniform power loading. Furthermore, the proposed suboptimal power allocation schemes can be used as less complex alternatives for optimal power allocation with some capacity degradation. Copyright © 2014 John Wiley & Sons, Ltd.     

Exact capacity analysis of multi‐relay multiuser cooperative networks based on two‐step selection

This paper advocates the capacity analysis of an amplify‐and‐forward cooperative communication system model in multi‐relay multiuser networks. A two‐step selection scheme is adopted, and both relay and user selection are based on the outdated channel state information. Exact expression of channel capacity for independent, but not necessarily identically distributed, Rayleigh fading channels is derived. Finally, simulations are carried out to verify the correctness of theoretical analysis and illustrate the effect of parameters on the performance. Results show that although the performance of our scheme is inferior to the optimal joint selection scheme, it is still a practical scheme because its complexity is much lower than that of the optimal scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

Nelder‐Mead–based power optimization for secrecy enhancement in amplify‐and‐forward cooperative relay networks

Cooperative communication based on relaying nodes has been considered as a promising technique to increase the physical layer security (PLS) performance in wireless communications. In this paper, an optimal power allocation (OPA) scheme based on Nelder‐Mead (NM) algorithm is proposed for improving the secrecy rate of amplify‐and‐forward (AF) cooperative relay networks employing cooperative jamming (CJ) scheme. The proposed hybrid jamming scheme allows the source and selected relay to transmit the jamming signal along with the information to confound the eavesdropper. The path selection probability of ant colony optimization (ACO) algorithm is used for selecting the relay for transmission. The performance based on secrecy rate is evaluated for “n” trusted relays distributed dispersedly between the source and destination. Gradient‐based optimization and three‐dimensional exhaustive search methods are used as benchmark schemes for comparison of the proposed power optimization algorithm. The secrecy performance is also compared with conventional AF scheme and CJ scheme without power optimization (EPA). The impact of single and multiple relays on secrecy performance is also evaluated. Numerical results reveal that, compared with the gradient method and exhaustive search algorithm, the proposed power allocation strategy achieves optimal performance. Also, the derived OPA results show a significantly higher secrecy rate than the EPA strategy for both CJ and AF schemes.     

Cooperative quadrature physical layer network coding in wireless relay networks

This paper proposes a cooperative quadrature physical layer network coding (CQPNC) scheme for a dual‐hop cooperative relay network, which consists of two source nodes, one relay node and one destination node. All nodes in the network have one antenna, and the two source nodes transmit their signals modulated with quadrature carriers. In this paper, a cooperative quadrature physical layer network coded decode‐and‐forward (DF) relay protocol (CQPNC‐DF) is proposed to transmit the composite information from the two source nodes via the relay node to the destination node simultaneously to reduce the number of time slots required for a transmission. The proposed CQPNC‐DF relay protocol is compared with time‐division multiple‐access amplify‐and‐forward (TDMA‐AF), TDMA‐DF, cooperative network coded DF (CNC‐DF) and cooperative analog network coded AF (CANC‐AF) relay protocols to demonstrate its effectiveness in terms of bit error rate (BER) and system throughput under different propagation conditions. The simulation results reveal that the proposed CQPNC‐DF relay protocol can significantly improve the network performance. Compared with two TDMA schemes and CNC‐DF, the proposal can provide up to 100% and 50% throughput gains, respectively. Moreover, no matter what the scene, the proposed scheme always has the lowest BER in the low SNR region. Copyright © 2013 John Wiley & Sons, Ltd.     

Performance analysis of multi‐antenna relay communication systems with MRC

The performance of multi‐antenna relay communication systems is investigated in this letter. The source broadcasts the signal to all the relays and the destination. Decode‐and‐forward scheme is adopted at the relays, and the destination employs maximum ratio combining (MRC) technique to maximize the received signal‐to‐noise ratio. Closed‐form expressions of outage probability are derived in the MRC case and minimum routes MRC case. An adaptive grouping algorithm of relay antennas is also presented under the constraint of total antenna number. Simulation results show that the analytical curves agree with the simulated ones very well, and the performance of the proposed grouping algorithm is very close to the upper bound mentioned in other papers. Copyright © 2012 John Wiley & Sons, Ltd.     

Achieving energy‐neutral data transmission by adjusting transmission power for energy‐harvesting wireless sensor networks

Recently, benefiting from rapid development of energy harvesting technologies, the research trend of wireless sensor networks has shifted from the battery‐powered network to the one that can harvest energy from ambient environments. In such networks, a proper use of harvested energy poses plenty of challenges caused by numerous influence factors and complex application environments. Although numerous works have been based on the energy status of sensor nodes, no work refers to the issue of minimizing the overall data transmission cost by adjusting transmission power of nodes in energy‐harvesting wireless sensor networks. In this paper, we consider the optimization problem of deriving the energy‐neutral minimum cost paths between the source nodes and the sink node. By introducing the concept of energy‐neutral operation, we first propose a polynomial‐time optimal algorithm for finding the optimal path from a single source to the sink by adjusting the transmission powers. Based on the work earlier, another polynomial‐time algorithm is further proposed for finding the approximated optimal paths from multiple sources to the sink node. Also, we analyze the network capacity and present a near‐optimal algorithm based on the Ford–Fulkerson algorithm for approaching the maximum flow in the given network. We have validated our algorithms by various numerical results in terms of path capacity, least energy of nodes, energy ratio, and path cost. Simulation results show that the proposed algorithms achieve significant performance enhancements over existing schemes. Copyright © 2016 John Wiley & Sons, Ltd.