• 한국통신학회논문지
• /
• 제31권8A호
• /
• pp.769-774
• /
• 2006

선택결합을 갖는 협동 다이버시티 시스템의 성능을 만족시키는 연결노드의 전력제어 범위를 검토하였다. 그리고 전력제한이 있는 연결노드가 시스템의 성능에 미치는 영향을 분석하였다. 레일레이 페이딩 하에서 각 경로의 평균 신호 대 잡음비가 동일할 경우, 연결노드가 하나이며 선택결합을 갖는 협동 다이버시티의 이득은 수신오율 $1{\times}10^{-3}$에서 13.5 dB 이다. 그리고 전력제한이 있는 연결노드는 시스템의 성능에 많은 영향이 있음을 알 수 있었다. 그러므로 ad-hoc 네트워크에서 전력제한이 있는 노드는 협동 다이버시티의 연결노드로 바람직하지 않다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2095-2110
• /
• 2015

This paper presents a design for a throughput-efficient online relay selection scheme for dual-hop multi-relay cooperative networks. Problems arise with these networks due to unpredictability of the relaying link quality and high time-consumption to probe the dual-hop link. In this paper, we firstly propose a novel probing and relaying protocol, which greatly reduces the overhead of the dual-hop link estimation by leveraging the wireless broadcasting nature of the network. We then formulate an opportunistic relay selection process for the online decision-making, which uses a tradeoff between obtaining more link information to establish better cooperative relaying and minimizing the time cost for dual-hop link estimation to achieve higher throughput. Dynamic programming is used to construct the throughput-optimal control policy for a typically heterogeneous Rayleigh fading environment, and determines which relay to probe and when to transmit the data. Additionally, we extend the main results to mixed Rayleigh/Rician link scenarios, i.e., where one side of the relaying link experiences Rayleigh fading while the other has Rician distribution. Numerical results validate the effectiveness and superiority of our proposed relaying scheme, e.g., it achieves at least 107% throughput gain compared with the state of the art solution.

• Journal of Communications and Networks
• /
• 제15권3호
• /
• pp.266-275
• /
• 2013

The exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decode-and-forward (DF) relay networks in non-identical Rayleigh fading channels are derived. We also provide the approximate closed-form expression for the system ergodic capacity. Utilizing these tractable analytical formulas, we can study the impact of key network parameters on the performance of cognitive multi-hop relay networks under interference constraints. Using a linear network model, we derive an optimum relay position scheme by numerically solving an optimization problem of balancing average signal-to-noise ratio (SNR) of each hop. The numerical results show that the optimal scheme leads to SNR performance gains of more than 1 dB. All the analytical expressions are verified by Monte-Carlo simulations confirming the advantage of multihop DF relaying networks in cognitive environments.

• 한국정보통신학회논문지
• /
• 제12권3호
• /
• pp.575-580
• /
• 2008

최근 IPv4 주소의 고갈과 더블어 P2P 트래픽의 증가로 인해 NAT의 사용은 피할 수 없다. NAT 내부에 있는 서버는 외부의 릴레이 서버를 통해서만 접속이 이루어지는 속성을 가지고 있다. 따라서 NAT 외부에 있는 서버는 많은 자원을 소비하고 네트워크 트래픽을 증가시킨다. 본 논문에서는 NAT 외부에서 NAT 내부로의 세션을 형성 할 수 있고, NAT 외부의 릴레이 서버를 NAT 내부에 둠으로써 네트워크 트래픽을 감소시킬 수 있는 토폴로지를 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.593-607
• /
• 2016

This paper analyzes interference alignment in the two-way relay network with compute-and-forward in both single relay and multiple relays networks. The advantages of compute-and-forward over other relaying strategies are that it can relay only linear combinations of the useful signals and remove the noise. The algorithm proposed in this paper adopts the criterion of maximum SINR to derive the pre-coding matrix. The experimental results show that the performance of interference alignment in two-way relay channel via compute-and-forward is better than that of amplify-and-forward, and the total sum rate in the two-way multiple relay networks is larger than that in the two-way single relay networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권2호
• /
• pp.566-578
• /
• 2018

In this paper, we design a segment training based individual channel estimation (STICE) scheme for the classical two-way relay network (TWRN) with multi-pair sources (MPS) and amplify-and-forward (AF). We adopt the linear minimum mean square error (LMMSE) channel estimator to minimize the mean square error (MSE) without channel estimation error, where the optimal power allocation strategy from the relay for different sources is obtained. Then the MSE gains are given with different source pairs among the proposed power allocation scheme and the existing power allocation schemes. Numerical results show that the proposed method outperforms the existing ones.

• 전기전자학회논문지
• /
• 제22권2호
• /
• pp.402-407
• /
• 2018

효과적인 링크선택은 릴레이 네트워크의 성능을 결정짓는 중요한 기술적 이슈이다. 본 논문은 릴레이 버퍼의 상태와 릴레이 링크 상태 뿐만 아니라 유저 버퍼의 상태까지 고려한 링크선택 방안을 제시하고 그 성능을 분석하기 위한 마코프 체인 기반의 분석 모델을 제시하였다. 이를 통해 릴레이 네트워크의 쓰루풋과 지연 성능을 평가하였다.

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

• 한국통신학회논문지
• /
• 제36권4A호
• /
• pp.345-355
• /
• 2011

This paper introduces the coded cooperation protocol in wireless relay network. We propose a two relay based coded cooperation protocol with RCPC codes for wireless networks. The proposed two-relay based system can achieve a diversity of order 4 under slow fading environment. Under fast fading, the diversity order is 2 times of the free distance of the convolutional code. We develop upper bounds on BER and FER for the system under both slow and fast fading with Rayleigh distribution. The effect of various channel conditions on the cooperation is also examined in this work.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.97-98
• /
• 2007

In this paper, we investigate the throughput capacity of a multi-hop relay network with cognitive radio (CR) enabled relay stations (RS). We suggested a TDMA/FDMA based frame structure where RSs dynamically select unused channels to communicate with the base station (BS) using CR techniques to analyze the throughput capacity. We developed the throughput capacity model for the proposed system based on utilization factor. The analytical results based on those equations show significant improvement in throughput capacity for CR enabled multi-hop relay system.