• Title/Summary/Keyword: fixed relay

Search Result 81, Processing Time 0.018 seconds

Development of a Fixed Radio-Relay Link Design Simulator (M/W 회선설계 시뮬레이터 개발)

  • 김혁제;조삼모;이성수
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.8 no.6
    • /
    • pp.656-664
    • /
    • 1997
  • This paper introduces a fixed radio-relay link design simulator with which we can select the station site and the frequency and can predict the performance of the radio-relay links. The simulator analyzes the path profile, the fading effects, the availability, the rain attenuation and the interference of the cosidered radio path using the digital terrain data and the rain intensity data. The calculation algorithms used in this simulator are mostly from the recommendations of the ITU-R. All the modules of the simulator are performed in full GUI mode and the input and output parameters are displayed interactively. This simulator could be used to the fixed radio-relay link design and the LMDS design.

  • PDF

Efficient Resource Allocation to Support QoS in a Fixed Relay Based Cellular System (고정 릴레이 기반 셀룰러 시스템에서 QoS를 보장하기 위한 효율적인 자원 할당)

  • Kim, Geun-Bae;Shin, Hee-Young;Park, Sang-Kyu
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.10
    • /
    • pp.1128-1135
    • /
    • 2010
  • The relay based cellular system has been introduced to provide the service to satisfy the user requirement. The main reasons of using relay station are to expand a service coverage and to increase a system throughput with satisfying the service requirement level. This paper proposes a new resource allocation algorithm which supports the users' throughput fairness and service coverage in the Fixed Relay Based Cellular system with OFDMA. The performance of proposed algorithm is compared with the performances of proportional fairness(PF) algorithm. The simulation result shows that the proposed algorithm increases the number of active users in the service coverage while paying small amount of throughput loss.

Digital Adaptive Distance Relay for Transmission Line Protection (송전선로 보호용 디지털 지능형 거리계전기)

  • Jeong, Chang-Ho;Kim, Jin-O
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.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.

  • PDF

Optimal sensing period in cooperative relay cognitive radio networks

  • Zhang, Shibing;Guo, Xin;Zhang, Xiaoge;Qiu, Gongan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.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.

Developed Ability of Zero-phase Overcurrent Relay by Changed setting point value (설정치 변경에 의한 영상과전류계전기의 성능개선)

  • Kim, N.H.;Yoon, D.S.;Chang, S.I.;Choi, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 1998.11a
    • /
    • 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.

  • PDF

Long-term Fading Statistics-Based Power Allocation for Fixed Decode-and-Forward Relays

  • Kong, Hyung-Yun;Bao, Vo Nguyen Quae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.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.

Swarm Intelligence-based Power Allocation and Relay Selection Algorithm for wireless cooperative network

  • Xing, Yaxin;Chen, Yueyun;Lv, Chen;Gong, Zheng;Xu, Ling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.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.

Outage Probability Analysis of Full Duplex Relay with Decode and Forward Protocol (복호 후 전달 방식을 사용하는 전이중 통신 릴레이 시스템에서의 오수신 확률 성능 분석)

  • Kwon, Tae-Hoon;Lim, Sung-Mook;Park, Sung-Soo;Hong, Dae-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6A
    • /
    • pp.568-576
    • /
    • 2010
  • In this paper, we analyze the outage probability of full duplex relay (FDR) with decode-and-forward (DF) protocol is derived under fading channels. The fading channel for source-relay link is assumed to be Rician fading to consider the infrastructured fixed relay with line of sight (LOS) propagation, and the other fading channels are assumed to be Rayleigh fading. Based on this analytical result, we provide the criterion that FDR shows a lower outage probability than HDR to consider the interference problem and the resource efficiency improvement by full duplex (FD) operation. The accuracy of the analysis is confirmed throughout the simulation results.

Sum MSE Minimization for Downlink Multi-Relay Multi-User MIMO Network

  • Cho, Young-Min;Yang, Janghoon;Seo, Jeongwook;Kim, Dong Ku
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.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.

Performance Analysis of Coded Cooperation Protocol with Reactive and Proactive Relay Selection

  • Asaduzzaman, Asaduzzaman;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.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.