• 한국전자파학회논문지
• /
• 제8권6호
• /
• pp.656-664
• /
• 1997

대용량, 장거리 고정 무선국의 설치장소 선정 및 주파수 선택을 사전에 분석하고 시스팀 성능평가를 수행하는 시율레이터를 개발하였다. 구현된 시율레이터는 지형데이터 베이스, 국내 강우강도 분포 데이터베이스, 한국통 신에서 운용 중인 고정 무선국 데이터베이스를 포함하고 있으며 각 데이터베이스와 연계하여 지형프로파일 작성, 페이딩 분석, 가용율 분석, 강우감쇠 및 전파간섭 계산 등을 수행한다. 본 시뮬레이터에서 요구되는 계산 알고리즘은 ITU 권고사항에 의거 구현하였으며, 특히 사용자가 일련의 설계과정에 따라 편리하게 시뮬레이션을 할 수 있도록 화면을 구성 제공하는 특징이 있다. 본 시뮬레이터는 고정 무선국 설계시 사용될 뿐 아니라 국간 중 계무선국 및 LMDS, LMCS 등의 초기 설계용으로도 사용될 수 있다.

• 한국전자파학회논문지
• /
• 제21권10호
• /
• pp.1128-1135
• /
• 2010

릴레이 기반 셀룰러 시스템은 사용자의 요구를 충족시키는 서비스를 제공하기 위해 도입되었다. 릴레이 중계기를 사용하는 주된 요인은 서비스 영역 확장 및 요구 서비스를 만족시킬 수 있는 시스템 처리율 증가이다. 본 논문에서는 직교 주파수 분할 다중 접속(OFDMA: Orthogonal Frequency Division Multiple Access) 기술이 적용된 고정 릴레이(fixed relay) 기반 셀룰러 시스템에서 공평성을 고려한 효율적인 부반송파 할당 방안을 제시한다. 릴레이 중계기에 적합한 효율적인 자원 할당 방법을 통해서 사용자의 QoS를 보장할 수 있도록 하며, outage 확률 및 사용자 당 평균 데이터 처리율(throughput)의 관점에서 기존의 비례 공정 알고리즘(proportional fairness algorithm)과의 성능 비교를 통해 제시된 알고리즘의 유용성을 관찰한다.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권9호
• /
• pp.411-416
• /
• 2001

Distance relay is the most widely used in transmission line protection because it is applicable not only as main protection but also as back-up protection. However, the protection range of the distance relay is always fixed in the unchangeable operating range while the power system varies, and therefore the distance relay is the device that is the highly influenced by the power system changes. In this regard, this paper describes an approach to minimize the mal-operation of the distance relay due to the power system changes through changing protection range of the distance relay into optimal condition in response to the load variation and power system condition. Also mal-function of the distance repay in case of high resistance ground faults could be minimized through modeling the protection range into quadratic function.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5249-5267
• /
• 2016

Cognitive radio is an efficient technique to improve spectrum efficiency and relieve the pressure of spectrum resources. In this paper, we investigate the spectrum sensing period in cooperative relay cognitive radio networks; analyze the relationship between the available capacity and the signal-to-noise ratio of the received signal of second users, the target probability of detection and the active probability of primary users. Finally, we derive the closed form expression of the optimal spectrum sensing period in terms of maximum throughput. We simulate the probability of false alarm and available capacity of cognitive radio networks and compare optimal spectrum sensing period scheme with fixed sensing period one in these performance. Simulation results show that the optimal sensing period makes the cognitive networks achieve the higher throughput and better spectrum sensing performance than the fixed sensing period does. Cooperative relay cognitive radio networks with optimal spectrum sensing period can achieve the high capacity and steady probability of false alarm in different target probability of detection. It provides a valuable reference for choosing the optimal spectrum sensing period in cooperative relay cognitive radio networks.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부A
• /
• pp.220-222
• /
• 1998

This paper presents a method, which develops an ability of Zero-phase Overcurrent Relay. Zero-phase current is very useful factor of Fault decision in Protect Relaying system. Actually, the setting-point value of Designed Relay, using Zero-phase current, is fixed. So in the case of deciding fault, Fixed setting-point value is not suitable for changing Load. and cause errors in Distributions system. For solving this problem, This paper proposes the Changed setting point value Algorithm, which can be adaptive for changing Distributions system using Zero-phase current r.m.s. indexes. The results of simulation under Load changing and High impedance fault show that proposed algorithm is useful for changing Distributions system and decreasing errors.

• 한국통신학회논문지
• /
• 제33권12A호
• /
• pp.1138-1146
• /
• 2008

This paper considers 2-hop wireless cooperative communications networks with fixed decode-and-forward relays. Specifically, we first derive the closed-form BER expression for theoretically evaluating the end-to-end performance of these networks. Then, based on this expression and long-tenn fading statistics, we propose a power allocation method for source and relay. Such a method brings about multiple advantages in tenn of spectral efficiency and implementation complexity over other power allocation methods based on instantaneous fading statistics. A variety of numerical results reveal that the cooperative communications scheme with the proposed power allocation significantly outperforms that with the equal power allocation and the direct transmission scheme for any position of the relay subject to the same total transmit power constraint.

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

• 한국통신학회논문지
• /
• 제35권6A호
• /
• pp.568-576
• /
• 2010

본 논문은 복호 후 전달 (decode-and-forward, DF) 프로토콜 하에서 전이중 통신방식 릴레이 (full duplex relay, FDR) 의 오수신 확률 (outage probability) 성능을 페이딩 채널하에서 유도하였다. 준기지국 형태의 고정된 릴레이를 가정하여 송신단과 릴레이 사이의 채널은 LOS (line of sight) 전파가 존재하는 Rician 채널을, 다른 링크 채널은 Rayleigh 채널을 고려하였다. 또한, 이 분석을 통해 전이중 통신 (full duplex, FD)으로 인한 간섭 문제와 자원의 효율성 향상 측면을 고려하여 실제적으로 FDR이 반이중 통신방식 릴레이 (half duplex relay, HDR) 보다 낮은 오수신 확률 성능을 가지기 위한 조건을 제시하였다. 분석된 오수신 확률 성능의 정확성은 모의 실험을 통하여 검증되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2722-2742
• /
• 2014

We propose methods of linear transceiver design for two different power constraints, sum relay power constraint and per relay power constraint, which determine signal processing matrices such as base station (BS) transmitter, relay precoders and user receivers to minimize sum mean square error (SMSE) for multi-relay multi-user (MRMU) networks. However, since the formulated problem is non-convex one which is hard to be solved, we suboptimally solve the problems by defining convex subproblems with some fixed variables. We adopt iterative sequential designs of which each iteration stage corresponds to each subproblem. Karush-Kuhn-Tucker (KKT) theorem and SMSE duality are employed as specific methods to solve subproblems. The numerical results verify that the proposed methods provide comparable performance to that of a full relay cooperation bound (FRCB) method while outperforming the simple amplify-and-forward (SAF) and minimum mean square error (MMSE) relaying in terms of not only SMSE, but also the sum rate.

• Journal of electromagnetic engineering and science
• /
• 제11권2호
• /
• pp.133-142
• /
• 2011

Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.