• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.389-405
• /
• 2014

Outdated Channel State Information (CSI) was proved to have negative effect on performance in two-way relay networks. The diversity order of widely used opportunistic relay selection (ORS) was degraded to unity in networks with outdated CSI. This paper proposed a multiple relay selection scheme for amplify-and-forward (AF) based two-way relay networks (TWRN) with outdated CSI. In this scheme, two sources exchange information through more than one relays. We firstly select N best relays out of all candidate relays with respect to signal-noise ratio (SNR). Then, the ratios of the SNRs on the rest of the candidate relays to that of the Nth highest SNR are tested against a normalized threshold ${\mu}{\in}[0,1]$, and only those relays passing this test are selected in addition to the N best relays. Expressions of outage probability, average bit error rate (BER) and ergodic channel capacity were obtained in closed-form for the proposed scheme. Numerical results and Simulations verified our theoretical analyses, and showed that the proposed scheme had significant gains comparing with conventional ORS.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3501-3523
• /
• 2017

It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.

• Journal of Broadcast Engineering
• /
• v.21 no.1
• /
• pp.105-108
• /
• 2016

In this paper, a cooperative jamming network with multiple relays and multiple eavesdroppers is investigated. Among the relays, one best relay is selected to amplify and forward the signal to destination through two phases. To confuse eavesdroppers, the destination transmits a jamming signal in the first phase and the source transmits jamming signal in the second phase. Secrecy rate of this system is derived, and based on the available channel state information (CSI), relay selection schemes are proposed, respectively. Numerical results show that the performance of the proposed relay selection scheme outperforms than that of random relay selection scheme.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.310-313
• /
• 2011

Broadcasting nature of wireless communications makes it possible to apply opportunistic network coding (OPNC) by overhearing transmitted packets from a source to sink nodes. However, it is difficult to apply network coding to the topology of multiple relay and sink nodes. We propose to use relay node selection, which finds a proper node for network coding since the OPNC alone in the topology of multiple relays and sink nodes cannot guarantee network coding gain. The proposed system is a novel combination of wireless network coding and relay selection, which is a key contribution of this paper. In this paper, with the consideration of channel state and potential network coding gain, we propose relay node selection techniques, and show performance gain over the conventional OPNC and a channel-based selection algorithm in terms of average system throughput.

• Journal of Broadcast Engineering
• /
• v.14 no.2
• /
• pp.134-143
• /
• 2009

In this paper, we propose a new relay selection algorithm for a two-way multiple relay channel. In the two-way multiple relay channel, two users exchange information with each other via multiple relays. The relays use a decode-and-forward or amplify-and-forward protocol, and exploit the combining process of the received packets to reduce the required channel resources. In the multiple relay network, diversity gain is achieved as the number of relays increases, and various schemes are proposed. In this paper, we propose a single best relay selection scheme based on instantaneous channel conditions. First of all, relays obtain the instantaneous channel state information in the handshaking process, and a single best relay is selected in a distributed methods prior to data transmissions. The relay selection metric is proposed so that the end-to-end channel condition is evaluated based on the intantaneous channel state informations. Simulation results show that the proposed relay selection algorithm achieve the increased throughput and diversity order when the number of potential relays is increased.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.509-515
• /
• 2017

In this paper, for a cooperative communication system with multiple relays, we consider a relay selection method by exploiting the trust degree information of relay nodes. In the cooperative communication system, we interpret the trust degree of relays as the probability that relay helps the communication between the transmitter and receiver. We first provide an expected achievable rate at the receiver by taking into account the both cases that the relay helps the transmission of transmitter and the relay does not help the transmission of transmitter according to its trust degree. For given trust degree information, we propose an efficient relay selection method to maximize the expected achievable rate at the receiver. For the various configurations, the simulation results confirm that the proposed relay selection method outperforms the conventional relay selection method, which does not consider the trust degree of relay nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.431-439
• /
• 2010

In this paper, multiple-relay cooperative communication network with multiple antennas is considered. Applying the soft-decision-and-forward protocol to this system, pairwise error probability(PEP) is derived and then symbol error rate(SER) is also calculated. However, in general, signals are transmitted through the orthogonal channel in the multiple-relay cooperative communication network for the prevention of interference, which is inefficient in terms of the throughput. For the improvement of throughput, the relay selection is considered, where the relay having the maximum instantaneous end-to-end signal-to-noise ratio is chosen. Performance of the system is analyzed in terms of PEP and SER. As the number of the relay increases, relay selection method outperforms the conventional multiple-relay transmission system where all relays participate in the second time slot.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4326-4341
• /
• 2016

In this paper, an adjustable multiple relay selection (MRS) scheme for cooperative communication with amplify-and-forward (AF) relay under frequency selective channels is proposed. In the proposed scheme, the relays are ordered firstly by the steady-state mean square error (MSE), then the relays are sequentially selected out from N relays and the number of cooperating relays is adjusted dynamically according to the steady-state mean square joint error (MSJE). The aim of this work is to dynamically estimate the optimum number N_o of cooperating relays. Optimum means the minimum number of cooperating relays, N_o, achieving the minimum level of steady-state MSJE. Numerical results verify the analyses and show that the scheme can adaptively adjust the number of cooperating relays, and outperform conventional relay selection schemes. Hence, the proposed scheme provides better tradeoff between BER performance and spectral efficiency and to save more energy in cooperative wireless networks.

• Journal of Korea Multimedia Society
• /
• v.18 no.4
• /
• pp.533-540
• /
• 2015

We study relay selection in decode-and-forward (DF)-based relay networks consisting of a source, a destination, an eavesdropper, and multiple relays, where each terminal has a single antenna and operates in a half-duplex mode. In these networks, it is desirable to protect the confidential message from the source to the destination against the eavesdropper with the help of a single selected relay. Specifically, we begin by investigating DF-based networks for the scenario instantaneous signal-to-noise ratios (SNRs) related to the eavesdropper are available. For the scenario, we propose relay selection to maximize the secrecy rate of DF-based networks with and without direct-paths, and we derive the exact secrecy outage probabilities in closed-form.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.118-127
• /
• 2007

We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to-end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay-to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end-to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.