• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3945-3964
• /
• 2015

Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권9호
• /
• pp.1513-1527
• /
• 2011

This paper investigates the capacity rate problems for a joint decode-and-forward (JDF) based two-way relaying with network coding. We first characterize the achievable rate region for a conventional three-node network scenario along with the calculation of the corresponding maximal sum-rate. Then, for the goal of maximizing the system sum-rate, opportunistic relay selection is examined for multi-relay networks. As a result, a novel strategy for the implementation of relay selection is proposed, which depends on the instantaneous channel state and allows a single best relay to help the two-way information exchange. The JDF scheme and the scheme using relay selection are analyzed in terms of outage probability, after which the corresponding exact expressions are developed over Rayleigh fading channels. For the purpose of comparison, outage probabilities of the amplify-and-forward (AF) scheme and those of the scheme using relay selection are also derived. Finally, simulation experiments are done and performance comparisons are conducted. The results verify that the proposed strategy is an appropriate method for the implementation of relay selection and can achieve significant performance gains in terms of outage probability regardless of the symmetry or asymmetry of the channels. Compared with the AF scheme and the scheme using relay selection, the conventional JDF scheme and that using relay selection perform well at low signal-to-noise ratios (SNRs).

• 한국정보통신학회논문지
• /
• 제22권3호
• /
• pp.520-526
• /
• 2018

본 논문에서는 다수의 중계 노드들과 목적지 노드들을 갖는 중첩 전송 기반의 무선 협력 멀티캐스트 통신 시스템을 고려하여, 멀티캐스트 통신의 데이터 전송률을 향상시키기 위한 중계 노드 선택 기법을 제안한다. 또한, 제안하는 중계 노드 선택 기법의 데이터 전송률을 극대화하기 위하여 중첩 전송시 최적의 전력 할당 계수를 이용한다. 중계 노드 선택 기법을 제안하기 위하여 중첩 전송 기반의 무선 협력 멀티캐스트 통신 시스템의 데이터 전송률의 근사식을 유도하고, 그 근사식을 토대로 부분적인 채널 상태 정보만을 이용하는 중계 노드 선택 기법을 제안한다. 또한, 제안하는 중계 노드 선택 기법에 대한 근사적인 평균 데이터 전송률을 유도한다. 수치적 결과에서, 제안하는 중계 노드 선택 기법과 전체 채널 상태 정보를 이용하는 최적의 중계 노드 선택 기법에 대한 평균 데이터 전송률을 비교하여, 높은 신호 대 잡음 전력비의 영역에서 제안하는 중계 노드 선택 기법이 최적의 중계 노드 선택 기법과 매우 유사한 성능을 제공함을 확인한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5343-5364
• /
• 2016

Considering the tradeoff between energy consumption and outage behavior in buffer-aided relay selection, a novel energy-efficient buffer-aided optimal relay selection scheme with power adaptation and Inter-Relay Interference (IRI) cancellation is proposed. In the proposed scheme, energy consumption minimization is the objective with the consideration of relay buffer state, outage probability and relay power control, in order to eliminate IRI. The proposed scheme selects a pair of optimal relays from multiple candidate relays, denoted as optimal receive relay and optimal transmit relay respectively. Source-relay and relay-destination communications can be performed within a time-slot, which performs as Full-Duplex (FD) relaying. Markov chain model is applied to analyze the evolution of relay buffer states. System steady state outage probability and achievable diversity order are derived respectively. In addition, packet transmission delay and power reduction performance are investigated with a specific analysis. Numerical results show that the proposed scheme outperforms other relay selection schemes in terms of outage behavior with power adaptation and IRI cancellation in the same relay number and buffer size scenario. Compared with Buffer State relay selection method, the proposed scheme reduces transmission delay significantly with the same amount of relays. Average transmit power reduction can be implemented to relays with the increasing of relay number and buffer size, which realizes the tradeoff between energy-efficiency, outage behavior and delay performance in green cooperative communications.

• 한국정보통신학회논문지
• /
• 제20권12호
• /
• pp.2213-2218
• /
• 2016

본 논문은 복수 개의 중계기와 도청자가 존재하는 중계기 통신 네트워크에서 보안 오류 확률을 낮출 수 있는 새로운 중계기 선택 기법을 제안한다. 도청자의 복호 확률을 낮추기 위해서 데이터와 함께 재밍 신호를 전송하는 기존의 중계기 선택 방식에서는 수신자의 데이터 복호 확률도 낮아지는 문제점이 있었다. 본 논문에서 제안하는 새로운 중계기 선택 기법은 수신자의 복호 확률을 높이면서 동시에 도청자의 복호 확률을 낮출 수 있는 중계기를 쌍으로 선택하여 보안 오류 확률을 개선하였다. Monte-Carlo 기반 컴퓨터 시뮬레이션을 통한 성능 분석 결과에 따르면, 제안 중계기 선택 방식은 기존 중계기 선택 방식 대비 보안 오류 확률을 약 10~50배 개선시킬 수 있음을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3524-3542
• /
• 2017

In a single-source and multi-relay amplify-forward (AF) cooperative network, the outage probability and the power allocation are two key factors to influence the performance of an entire system. In this paper, an optimized AF relay selection by an exclusive method and near optimal power allocation (NOPA) is proposed for both good outage probability and power efficiency. Given the same power at the source and the relay nodes, a threshold for selecting the relay nodes is deduced and employed to minimize the average outage probability. It mainly excludes the relay nodes with much higher thresholds over the aforementioned threshold and thus the remainders of the relay nodes participate in cooperative forwarding efficiently. So the proposed scheme can improve the utility of the resources in the cooperative multi-relay system, as well as reduce the computational complexity. In addition, based on the proposed scheme, a NOPA is also suggested to approach sub-optimal power efficiency with low complexity. Simulation results show that the proposed scheme obtains about 2.1dB and 5.8dB performance gain at outage probability of $10^{-4}$, when compared with the all-relay-forward (6 participated relays) and the single-relay-forward schemes. Furthermore, it obtains the minimum outage probability among all selective relay schemes with the same number of the relays. Meanwhile, it approaches closely to the optimal exhaustive scheme, thus reduce much complexity. Moreover, the proposed NOPA scheme achieves better outage probability than those of the equal power allocation schemes. Therefore, the proposed scheme can obtain good outage probability, low computational complexity and high power efficiency, which makes it pragmatic efficiently in the single-source and multi-relay AF based cooperative networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1111-1130
• /
• 2016

Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.377-384
• /
• 2011

Cooperative beamforming has previously been proven to be an efficient way to improve the cooperative diversity. This method generally requires all relay nodes to participate in beamforming, which can be seen as "all participate" cooperative beamforming. However, not all relay nodes have constructive impacts on the end-to-end bit error rate (BER) performance. Based on this observation, we propose a new cooperative scheme which only selects those "appropriate" relay nodes to perform cooperative beamforming. Such relay nodes can be simply determined with mean channel gains. Therefore, the selection complexity is significantly reduced as global instantaneous channel state information is not required. This scheme guarantees that energy is only allocated to the "appropriate" relay nodes, and hence provides superior diversity. We also prove that power allocation among source and selected relay nodes is a convex problem, and can be resolved with lower computational complexity. Simulation results demonstrate that our scheme achieves an essential improvement in terms of BER performance for both optimal and limited feedback scenarios, as well as high energy-efficiency for the energy-constrained networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권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.