• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.819-835
• /
• 2010

In this paper, two selection relaying schemes are proposed and compared with each other in terms of packet error rate (PER) and diversity order. Moreover, the comparison is performed over two different fading environments including fast and slow fading environments in which the diversity order is considered as the important factor to reach the decision which scheme is suitable for each fading environment. Numerical results validate the analytical results and indicate significant differences on the PER performance of two schemes over two fading environments.

• 한국통신학회논문지
• /
• 제35권1B호
• /
• pp.136-143
• /
• 2010

본 논문에서는 임의로 분포되어 있는 레일리 페이딩(Rayleigh fading) 채널 하에서 소스노드와 목적지 노드 사이의 직접 경로가 존재하고 복호 후 전송(decode-and-forward) 방식을 사용하여 중계하는 시스템을 고려한다. 이때, 다수의 릴레이 가운데 베스트 릴레이를 선택하여 이중 홉을 사용하여 통신하는 경우와 다중 홉을 사용하여 통신하는 경우의 아웃티지 확률을 구하고, 이를 통해 그 성능을 비교한다. 여기서 소스 노드와 릴레이들로부터 목적지 노드가 받은 모든 신호는 maximum ratio combining (MRC) 기법을 사용하여 결합하였고, 모든 경우에 대하여 목적지 노드에서 받은 수신 신호의 SNR이 갖는 확률 밀도 함수(probability density function, PDF)와 누적 확률 변수(cumulative density function, CDF)를 유도하였다. 이와 같이 구한 아웃티지 확률을 통해 릴레이의 개수가 2개일 때를 가정하고 실험한 결과, 채널 상태가 나쁠수록 다중 홉을 사용하여 통신하는 기법이 베스트 릴레이 선택 기법보다 좋은 성능을 보였다.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.162-171
• /
• 2015

This paper provides an analytic performance evaluation of the bit error rate (BER) of underlay decode-and-forward cognitive networks with best relay selection over Rayleigh multipath fading channels. A generalized BER expression valid for arbitrary operational parameters is firstly presented in the form of a single integral, which is then employed for determining the diversity order and coding gain for different best relay selection scenarios. Furthermore, a novel and highly accurate closed-form approximate BER expression is derived for the specific case where relays are located relatively close to each other. The presented results are rather convenient to handle both analytically and numerically, while they are shown to be in good agreement with results from respective computer simulations. In addition, it is shown that as in the case of conventional relaying networks, the behaviour of underlay relaying cognitive networks with best relay selection depends significantly on the number of involved relays.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권3호
• /
• pp.477-493
• /
• 2011

The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.

• Journal of electromagnetic engineering and science
• /
• 제12권1호
• /
• pp.8-12
• /
• 2012

In this paper, we evaluate performances of dual-hop decode-and-forward relaying systems with the $N^{th}$ best-relay selection scheme. In some schemes, such as scheduling or load balancing schemes, the best relay is unavailable and hence the system must resort the second best, third best, or generally the $N^{th}$ best relay. We derive the expressions of the outage probability and symbol error rate (SER) for this scenario over Rayleigh fading channels. Monte-Carlo simulations are presented to verify the analytical results.

• ETRI Journal
• /
• 제35권1호
• /
• pp.120-130
• /
• 2013

This paper presents an analysis of resource assignment for multihop communications in millimeter-wave (mm-wave) wireless personal area networks. The purpose of this paper is to figure out the effect of using directional antennas and relaying devices (DEVs) in communications. The analysis is performed based on a grouping algorithm, categorization of the flows, and the relaying DEV selection policy. Three schemes are compared: direct and relaying concurrent transmission (DRCT), direct concurrent transmission (DCT), and direct nonconcurrent transmission (DNCT). Numerical results show that DRCT is better than DCT and DCT is better than DNCT for any antenna beamwidths under the proposed algorithm and policy. The results also show that using relaying DEVs increases the throughput up to 30% and that there is an optimal beamwidth that maximizes spatial reuse and depends on parameters such as the number of flows in the networks. This analysis can provide guidelines for improving the performance of mm-wave band communications with relaying DEVs.

• ETRI Journal
• /
• 제40권3호
• /
• pp.291-302
• /
• 2018

The deployment of an incremental hybrid decode-amplify and forward relaying scheme is a promising and superior solution for cellular networks to meet ever-growing network traffic demands. However, the selection of a suitable relaying protocol based on the signal-to-noise ratio threshold is important in realizing an improved quality of service. In this paper, an incremental hybrid relaying protocol is proposed using polar codes. The proposed protocol achieves a better performance than existing turbo codes in terms of capacity. Simulation results show that the polar codes through an incremental hybrid decode-amplify-and-forward relay can provide a 38% gain when ${\gamma}_{th(1)}$ and ${\gamma}_{th(2)}$ are optimal. Further, the channel capacity is improved to 17.5 b/s/Hz and 23 b/s/Hz for $2{\times}2$ MIMO and $4{\times}4$ MIMO systems, respectively. Monte Carlo simulations are carried out to achieve the optimal solution.

• 대한전자공학회논문지TC
• /
• 제46권1호
• /
• pp.83-88
• /
• 2009

선택적 릴레이는 일반적으로 신호대잡음비(SNR)를 평가하여 재전송을 결정한다. 하지만, 이 방식은 릴레이에서 instantaneous 노이즈를 고려하지 않게 되므로 릴레이에서 오류가 있는 신호를 재전송할 위험이 있으며, 이는 결과적으로 목적지에서의 심볼 검출에 악영향을 끼친다. 이러한 문제를 극복하기 위하여 본 논문에서는 수신된 심볼의 신뢰성을 위해 SNR 대신 새로운 심볼에러확률(SEP)를 제안한다. 모의실험 결과는 제안한 SEP-based SR이 릴레이의 위치와 문턱 값에 상관없이 기존의 SNR-based SR에 비해 좋은 성능을 가짐을 알 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3542-3566
• /
• 2018

In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.