Solar Energy Harvesting Using a Timer-Based Relay Selection

In this paper,the throughput and delay of cooperative communications are derived when solar energy is used and relay node is selected using a timer.The source and relays harvest energy from sun using a photo voltaic system.The harvested power is used by the source to transmit data to the relays.Then,a selected relay amplifies the signal to the destination.Opportunistic,partial and reactive relay selection are used.The relay transmits when its timer elapses.The timer is set to a value proportional to the inverse of its Signal to Noise Ratio(SNR).Therefore,the relay with largest SNR will transmit first and its signal will be detected by the other relays that will remain idle to avoid collisions.Harvesting duration is optimized to maximize the throughput.Packet’s waiting time and total delay are also computed.We also derive the statistics of SNR when solar energy is used.The harvested power from sun is proportional to the sum of a deterministic radiation intensity and a random attenuation due to weather effects and clouds occlusion.The fixed radiation intensity depends on season,month and time t in hour.The throughput of cooperative communications with energy harvesting from sun was not yet studied.

Symbol Error Probability of Incremental Relaying with Distributed/Centralized Relay Selection

In this paper,we derive the Symbol Error Probability(SEP)of cooperative systems with incremental relaying and Distributed Relay Selection(DRS).The relays remain idle when the Signal to Noise Ratio(SNR)between the source and destination is larger than T.Otherwise,we activate a relay using DRS.Relay nodes transmit only if their SNR is larger than thresholdβ.If the SNRs of more than two relays is larger thanβ,there is a collision and the destination uses only the received signal from the source.If all relays have SNR less thanβ,no relay is chosen.Thresholdβis optimized to yield the lowest SEP at the destination.Our results are compared to centralized relay selection using opportunistic Amplify and Forward(OAF),Partial and Reactive Relay Selection(PRS and RRS).We compare our results to computer simulations for Rayleigh fading channels.

Performance Analysis of NOMA-Based Cooperative Networks with Relay Selection

Non-orthogonal multiple access(NOMA)technique is an expert on channel differences exploiting.In this paper,a dual-hop NOMA-based cooperative relaying network where a best relay is selected as an active node to accomplish the communication between a source and a destination is discussed.We assume that both decode-and-forward(DF)and amplify-and-forward(AF)protocols are applied to the selected relay.The metrics that ergodic sum-rate and outage probability are investigated,and the closed-form expressions of the latter for DF and AF protocols are derived.Numerical and simulation results are conducted to verify the validity of the theoretical analysis,in which we can see that the NOMA based DF relaying is better than the NOMA based AF relaying and other existing NOMA-based cooperative communication schemes.

Joint power control and relay selection scheme for cognitive two-way relay networks

A joint power control and relay selection scheme is considered for a cooperative and cognitive radio system where a secondary network shares spectrum with the primary network. In the secondary network, two secondary users （SUs） communicate with each other via an assist relay. The main point is to provide the best system performance to SUs while maintaining the interference power at primary user （PU） under a certain level. Using convex optimization, a closed-form solution is obtained when optimizing the power allocation among the two nodes and relay. Based on this result, a joint power control and relay selection scheme with fewer variable dimensions is proposed to maximize the achievable rate of the secondary system. Simulation results demonstrate that the sum rate of the cognitive two-way relay network increases compared with a random relay selection and fixed power allocation.

Adaptive Relay Selection Scheme for Minimization of the Transmission Time

As the installation of small cells increases,the use of relay also increases.The relay operates as a base station as well as just an amplifier.As the roles and types of relays become more diverse,appropriate relay selection technology is an effective way to improve communication performance.Many researches for relay selection have been studied to secure the reliability of relay communication.In this paper,the relay selection scheme is proposed for a cooperative system using decode-and-forward(DF)relaying scheme in the mobile communication system.To maintain the transmission rate,the proposed scheme classifies a candidate group considering the outage probability of multiple relays.For the applicable candidate group,the proposed scheme selects the relay considering the amount of data allocated to each user.Therefore,the proposed scheme defines the unit transmission time through each user’s data and relay capacity.Finally,the proposed scheme selects a relay that minimizes the total transmission time through the relay transmission time that calculates the unit transmission time for all users.With this adaptive relay selection scheme,an optimal relay can be assigned for each user.For the same transmission rate and the amount of data,the proposed scheme improves the performance of transmission time and reliability.Simulation results show that the proposed scheme reduces the total transmission time for the same amount of data and signal to noise ratio(SNR).

Relay Selection Strategy in the Secure Cooperative Communications System

With the low cost and low hardware complex considerations,cooperative systems are a tendency in the future communications.This work considers the secure cooperative communications systems.For a practical situation in the system,the scenario includes multiple source stations,multiple relay stations,multiple destination stations,and eavesdroppers.To analyze the optimal relay selection in the system,we begin with the performance analysis for a single source station and a single destination station.By applying two cooperative models,the amplify-andforward（AF） mode and decode-and-forward（DF）mode,the secrecy capacity is derived.Then,we apply the derived results to the considered environment to find the optimal relay assignment.By the way,the relay selection can be obtained by the exhaustive search algorithm.However,there are a lot of steps needed if the number of source stations is large.Hence,applying the characters of the cooperative modes in the relay selection,the pre-selection step is proposed with a mathematical derivation.It could be used for the practical situation without a long-time calculation.

Two-Phase Bidirectional Dual-Relay Selection Strategy for Wireless Relay Networks

In this article,we introduce a new bi-directional dual-relay selection strategy with its bit error rate(BER)performance analysis.During the first step of the proposed strategy,two relays out of a set of N relay-nodes are selected in a way to optimize the system performance in terms of BER,based on the suggested algorithm which checks if the selected relays using the maxmin criterion are the best ones.In the second step,the chosen relay-nodes perform an orthogonal space-time coding scheme using the two-phase relaying protocol to establish a bi-directional communication between the communicating terminals,leading to a significant improvement in the achievable coding and diversity gain.To further improve the overall system performance,the selected relay-nodes apply also a digital network coding scheme.Furthermore,this paper discusses the analytical approximation of the BER performance of the proposed strategy,where we prove that the analytical results match almost perfectly the simulated ones.Finally,our simulation results show that the proposed strategy outperforms the current state-of-the-art ones.

Greedy Algorithm Applied to Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode

Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward （AF） mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.

Improved Bi-Directional Three-Phase Single-Relay Selection Technique for Cooperative Wireless Communications

Single-relay selection techniques based on themax-min criterion can achieve the highest bit error rate(BER)performance with full diversity gain as compared to the state-of-the-art single-relay selection techniques.Therefore,in this work,we propose a modified max-min criterion by considering the differences among the close value channels of all relays while selecting the best relay node.The proposed criterion not only enjoys full diversity gain but also offers a significant improvement in the achievable coding gain as compared to the conventional one.Basically,in this article,an improved bi-directional three-phase single-relay selection technique using the decodeand-forward protocol for wireless cooperative communication networks that enhances the overall network performance in terms of BER is proposed and its performance is proved analytically and through Monte-Carlo simulations.More specifically,the proposed criterion is first used to select the best relaynode.After that the selected relay-node forwards the information symbols of the communicating terminals after performing a digital network coding to minimize power consumptions.In our simulations,we show that our proposed technique outperforms the best-known single relay selection techniques.Furthermore,we prove that the BER results obtained from our conducted simulations perfectly match those obtained from the theoretical analysis.

Distributed optimal relay selection for spectral efficiency improvement in underlay-paradigm based cognitive radio networks

A distributed best-relay node selection scheme is investigated for cooperative communications with adaptive modulation and coding （MAC） strategy over underlay-paradigm based cognitive radio （CR） networks. The scheme aims to maximize the average spectral efficiency and meanwhile to guarantee that the primary link is provided with a minimum-rate for a certain percentage of time. Simulation results demonstrate that the proposed scheme can significantly improve the spectral efficiency compared with other existing schemes.

BER-based relay selection strategy for cooperative communication

In this paper, a bit error ratio(BER)-based relay selection strategy is investigated under opportunistic relay selection.The challenging problem is to design the relay selection rule so that the relay is able to measure the performance of the cooperative system at the destination exactly with low computation costs.This paper derives a closed-form expression of the end-to-end bit error rate firstly. Then, an approximate BER expression based on the relationship between the instantaneous signal-to-noise ratio(SNR) of the relay-to-destination link and the probability of error propagation is derived. Finally, a simplified relay selection formula is proposed. Simulation results prove that the proposed relay selection rule can reflect the BER of each relay properly as well.

Outage Probability Based on Relay Selection Method for Multi-Hop Device-to-Device Communication

To improve the connectivity of device-to-device(D2D)communication between delay-assisted vehicles,a multi-hop D2D relay selection strategy based on outage probability is proposed.The algorithm firstly clusters the relay users based on the distance of D2D users,and determines the number of one-hop relay nodes through the outage probability threshold.Two-hop relay nodes directly select the same number of relays as one-hop relay nodes according to the descending order of signal noise ratio(SNR)to establish a square matrix.The Hungarian algorithm is used to assign the relay nodes of two clusters to complete the inter relay communication.Finally,the information is sent to the D2D receiver by combining technology.The simulation results show that this algorithm can reduce the cost of relay probing process and the outage probability of system in multi-hop D2D relay communication.

Optimal power allocation for complex field network coding scheme with the K-th best relay selection

Wireless relay and network coding are two critical techniques to increase the reliability and throughput of wireless cooperative communication systems. In this paper, a complex field network coding （CFNC） scheme with the K-th best relay selection （KBS） is proposed and investigated, wherein the K-th best relay is selected to forward the multiplexed signal to the destination. First, the upper bound of the symbol error probability （SEP）, the diversity order, and the coding gain are derived for the CFNC scheme with KBS. Then, the coding gain is utilized as the optimized cri- terion to determine the optimal power allocation. It is validated through analysis and simulation that the CFNC scheme with KBS can achieve full diversity only when K=I, while the diversity order decreases with increasing parameter K, and the optimal power allocation can significantly improve the performance of the CFNC scheme with KBS.

Relay Selection Scheme for AF System with Partial CSI and Optimal Stopping Theory

Relay selection for Relay Assisted(RA)networks is an economical and effective method to improve the spectrum efficiency.Relay selection performs especially well when the source node has accurate and timely Channel State Information(CSI).However,since perfect CSI knowledge is rarely available,research of relay selection with partial(statistical)CSI is of paramount importance.In this paper,relay selection for RA networks with statistical CSI is formulated as a Multiple-Decision(MD)problem.And,the cost of obtaining the CSI is also considered in the formulated problem.Two relay selection schemes,Maximal Selection Probability(MSP)and Maximal Spectrum Efficiency Expectation(MSEE),are proposed to solve the formulated MD problem under different optimal criteria assumptions based on the optimal stopping theory.The MSP scheme maximizes the probability that the Best Assisted Relay Candidate(BARC)can be selected,whereas the MSEE scheme provides the maximal expectation of the spectrum efficiency.Experimental results show that the proposed schemes effectively improve the spectrum efficiency,and the MSEE scheme is more suitable for stable communication cases.Meanwhile,the MSP scheme is more suitable for burst communication cases.

Energy-efficient relay selection and optimal relay location in cooperative cellular networks with asymmetric traffic

Energy-efficient communication is an important requirement for mobile relay networks due to the limited battery power of user terminals. This paper considers energy-efficient relaying schemes through selection of mobile relays in cooperative cellular systems with asymmetric traffic. The total energy consumption per information bit of the battery-powered terminals,i.e.,the mobile station （MS） and the relay,is derived in theory. In the joint uplink and downlink relay selection （JUDRS） scheme we proposed,the relay which minimizes the total energy consumption is selected. Additionally,the energy-efficient cooperation regions are investigated,and the optimal relay location is found for cooperative cellular systems with asymmetric traffic. The results reveal that the MS-relay and the relay-base station （BS） channels have different influence over relay selection decisions for optimal energy-efficiency. Information theoretic analysis of the diversity-multiplexing tradeoff （DMT） demonstrates that the proposed scheme achieves full spatial diversity in the quantity of cooperating terminals in this network. Finally,numerical results further confirm a significant energy efficiency gain of the proposed algorithm comparing to the previous best worse channel selection and best harmonic mean selection algorithms.

Improving amplify-and-forward relay selection algorithm based on partial relay link

This article addresses the design problem of selecting an appropriate relay in amplify-and-forward （AF） cooperative diversity systems. In this regard, this article focuses on relay selection based on partial channel knowledge only across the source and relay links. In particular, the two fundamental questions will be answered, that is, whether to cooperate and whom to cooperate with. Through answering these two questions, an improved relay selection strategy based on partial relay link, which emphasizes that cooperation happens when necessary, is proposed to aim at maximizing the average mutual information. Then a joint optimization, in terms of power allocation and relay selection, is employed to guarantee a robust performance for relay selection based on partial relay link. Optimum power is allocated between the source and the selected relay to maximize the output signal-to-noise （SNR） at the destination. Simulation results turn out that the improved scheme can achieve better performance than previous work and the robust performance can be guaranteed by employing joint optimization.

Optimal resource allocation scheme for cognitive radio networks with relay selection based on game theory

In this paper, we present a non-transferable utility coalition graph game （NTU-CGG） based resource allocation scheme with relay selection for a downlink orthogonal frequency division multiplexing （OFDMA） based cognitive radio networks to maximize both system throughput and system faimess. In this algorithm, with the assistance of others SUs, SUs with less available channels to improve their throughput and fairness by forming a directed tree graph according to spectrum availability and traffic demands of SUs. So this scheme can effectively exploit both space and frequency diversity of the system. Performance results show that, NTU-CGG significantly improves system faimess level while not reducing the throughput comparing with other existing algorithms.

Full-Duplex Energy-Harvesting Relay Networks:Capacity-Maximizing Relay Selection

In this study,we investigate the relay selection(RS)problem in full-duplex energy-harvesting(FDEH)relay networks,where the relays are wirelessly powered by harvesting a portion of the received signal power from the source.We extend the investigation of the relay selection problem in FDEH relay networks to enable multiple relays to be selected simultaneously for improved performance.This is in contrast with existing studies on RS in similar setups,where only one relay can be selected in a transmission cycle.Our simulations show that selecting only a single relay is not always optimal,especially at low signal-to-noise ratios(SNRs).Furthermore,in this paper,we present the design of a greedy RS method with quadratic complexity for FDEH relay networks.Compared with the exhaustive-search-based RS,the proposed greedy RS achieves near-optimum performance in terms of the end-to-end capacity with significantly reduced complexity.

Relay selection based on MAP estimation for cooperative communication with outdated channel state information

In this paper, we consider an amplify-and-forward （AF） cooperative communication system when the channel state information （CSI） used in relay selection differs from that during data transmission, i.e., the CSI used in relay selection is outdated. The selected relay may not be actually the best for data transmission and the outage performance of the cooperative system will deteriorate. To improve its performance, we propose a relay selection strategy based on maximum a posteriori （MAP） estimation, where relay is selected based on predicted signal-to-noise ratio （SNR）. To reduce the computation complexity, we approximate the a posteriori probability density of SNR and obtain a closed-form predicted SNR, and a relay selection strategy based on the approximate MAP estimation （RS-AMAP） is proposed. The simulation results show that this approximation leads to trivial performance loss from the perspective of outage probability. Compared with relay selection strategies given in the literature, the outage probability is reduced largely through RS-AMAP for medium-to-large transmitting powers and medium-to-high channel correlation coefficients.

QoS-guaranteed multi-relay selection and power allocation optimization in cooperative systems

This paper investigates the relay selection and power allocation problem in multi-user based cooperative networks,where intermediate relay nodes help source forward information to destination using decode-and-forward （DF） relaying protocol. Specifically,we propose a novel multi-relay nodes selection strategy taking both instantaneous channel state information （I-CSI） and residual energy into consideration,by which ＇emergence＇ diversity gain can be achieved and the imbalance of resource utilization can be overcome. Besides,using Largangian dual-primal decomposition and subgradient projection approach,an optimal power allocation algorithm at source and cooperative relay nodes is presented with the constraints of each user＇s individual quality of service （QoS） requirements and system total transmit power. Theoretical analysis and simulation results demonstrate that the proposed scheme can significantly improve energy efficiency,while guaranteeing a good balance between achievable data rate and average network lifetime with relatively low implementation complexity.