A Pricing-Based Cooperative Relay Selection Scheme for Reliable Communications

With the rapid development and application of energy harvesting technology,it has become a prominent research area due to its significant benefits in terms of green environmental protection,convenience,and high safety and efficiency.However,the uneven energy collection and consumption among IoT devices at varying distances may lead to resource imbalance within energy harvesting networks,thereby resulting in low energy transmission efficiency.To enhance the energy transmission efficiency of IoT devices in energy harvesting,this paper focuses on the utilization of collaborative communication,along with pricing-based incentive mechanisms and auction strategies.We propose a dynamic relay selection scheme,including a ladder pricing mechanism based on energy level and a Kuhn-Munkre Algorithm based on an auction theory employing a negotiation mechanism,to encourage more IoT devices to participate in the collaboration process.Simulation results demonstrate that the proposed algorithm outperforms traditional algorithms in terms of improving the energy efficiency of the system.

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.

Relay selection region and system performance analysis for interfered cooperative ad-hoc networks

The performance of interfered cooperative ad-hoc networks is analyzed by stochastic geometry analysis and a selection region of relay is presented. First, assuming that the distribution of nodes in the random network follows the Poisson point process （PPP）, a closed-form expression of the outage probability is derived for the best relay selection （BRS） scheme. Secondly, the capacity of the network is presented for this scheme. Finally, a performance factor is defined to evaluate the performance gain obtained from the BRS. By using this factor, a relay selection region is found to guarantee the performance gain from the BRS. The analysis and simulation results show that the performance of the BRS not only depends on the densities of source nodes and relay nodes but also on the factors of networks such as the path loss factor and the decoding threshold. And the BRS has a greater advantage than direct transmission （DT） in hush environments such as the long transmission distances, much interference and the high decoding thresholds.

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.

Energy Saving Cooperative Communication over Fading Channels with Relay Selection and Power Control

In order to save energy and make more efficient use of wireless channel, this article puts forward an energy saving cooperative relaying scheme which actuates the cooperative transmis- sion only when the feedback from the destination indicates failure of the direct transmission. The proposed scheme selects the optimal relay and its corresponding transmission power in each time slot based on channel condition and residual ener- gy with the objective of minimizing energy con- sumption and extending network lifetime. In the study, the f＇mite-state Markov channel model is used to characterize the correlation structure of channel fading in wireless networks, and the pro- cedure of relay selection and transmission power decision is formulated as a M arkov decision process. Numerical and simulation results show that the proposed scheme consumes less energy and prolongs the network lifetime.

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.

Optimal joint relay selection and resource allocation with QoS constraints in multiuser OFDM-based cellular networks

This paper investigates the relay selection and resource allocation problem in multiuser orthogonal frequency division multiplexing （OFDM） based cooperative cellular networks, in which user nodes could relay information for each other using the decode-and-forward （DF） protocol to achieve spatial diversity gain. Specifically, the paper proposes an optimal joint relay selection and resource allocation （0RSRA） algorithm whose objective is to maximize system total achievable data rate with the constraints of each user＇ s individual quality of service （QoS） requirement and transmission power. Due to being a mixed binary integer programming （MBIP） problem, a novel two-level Lagrangian dual-primal decomposition and subgradient projection approach is proposed to not only select the appropriate cooperative relay nodes, but also allocate subcarries and power optimally. Simulation re- suits demonstrate that our proposed scheme can efficiently enhance overall system data rate and guarantee each user＇ s QoS requirement. Meanwhile, the fairness among users can be improved dramatically.

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).

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.

Distributed Secure Relay Selection Approach over Wireless Cooperative Networks

Cloud computing is always adopted to enhance the computing capability of mobile systems, especially when the mobile users prefer to use some computation intensive applications. Consequently, the distributed wireless relay infrastructure should be deployed to aid the traffic transmission. To further enhance the QoS provisioning goals of wireless cooperative network, this paper puts forward a multi-objective approach for distributed optimal relay selection, which takes Bit Error Rate (BER) and Secrecy Capacity (SC) into account simultaneously. Firstly, our proposal partitions the channel state into several levels according to the received signal-to-noise ratio (SNR) and describes the time-varying Rayleigh fading channel characteristics by using first order finite-state Markov model. Secondly, we model the relay selection as Restless Multi-armed Bandit optimal solution problem with respect to the channel state and the state transition probability. Finally, simulation results demonstrate the efficiency of the proposed approach which outperforms the existing ones.

Channel Allocation and Relay Selection Scheme in Relay-Based Networks

It has been demonstrated that either Channel Allocation （CA） or Relay Selection （RS） can improve the performance in relaying networks separately. However, there is little work concerning their combination in multi-cell uplink scenarios. In this paper, we investigate the issue which considers the CA and RS to optimize the system transmission rate in an uplink scenario, while maintaining the resource distribution fairness among users. This is first formulated as an optimization problem for a linear cellular system, where the same frequency channels can be reused in different cells. Based on the link and co-channel interference conditions, two low-complexity CA and RS schemes are then proposed with different decomposition se quences. Finally, numerical results are con ducted to verify the effectiveness of the pro posed CA and RS methods. Simulations re suits show that the proposed methods can yield significant improvements in system per formance in terms of average sum rate.

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.

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.

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.

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.

On the energy efficiency of relay selection in multi-relay cooperative network using Vickrey auction game

This paper focuses on the energy efficient relay selection problem in a cooperative multi-relay network,aims to find the most energy efficient relay node for the source node while ensuring its minimum data rate requirement.The interaction between the source node and the relay nodes is modeled as a Vickrey auction game,when the source node broadcasts a cooperation request,the relay nodes compete for the cooperation,and the one with the minimum bid will be chosen which denotes the cost of the source node during the cooperation process,but it only needs to provide the minimum bid provided by the other relay nodes,which can encourage all the relay nodes to give the true bid.Besides,the minimum rate requirement of the source node will be ensured and the relay node taking part in the cooperation will gain some reward and the reward can be maximized by reinforcement learning(RL).