• Title/Summary/Keyword: Relay Networks

Search Result 528, Processing Time 0.035 seconds

Autonomous Adaptive Digital Over Current Relay (계통변화를 고려한 자율 적응형 과전류 계전기)

  • 윤준석;최면송;이승재;현승호
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.8
    • /
    • pp.444-449
    • /
    • 2003
  • In this paper present Autonomous Adaptive Digital Over Current Relay for distribution networks which acts autonomous setting using the short circuit impedance measured by relay of power systems. Automation of relay setting is one of the basic requirements for distribution automation, although manual relay setting is used at present. The short circuit impedance from a power source in distribution networks essential for the Autonomous Relay Setting changes frequently in distribution networks. In this paper the short circuit impedance is calculated with voltage and current measured in real time operation of digital relay using the Recursive Least Squares. A new method of digital relay setting is introduced using the the short circuit impedance and load current.

Impact of Power Control Optimization on the System Performance of Relay Based LTE-Advanced Heterogeneous Networks

  • Bulakci, Omer;Redana, Simone;Raaf, Bernhard;Hamalainen, Jyri
    • Journal of Communications and Networks
    • /
    • v.13 no.4
    • /
    • pp.345-359
    • /
    • 2011
  • Decode-and-forward relaying is a promising enhancement to existing radio access networks and is already standardized in 3rd generation partnership project (3GPP) as a part of long term evolution (LTE)-Advanced Release 10. Two inband operation modes of relay nodes are supported, namely type 1 and type lb. Relay nodes promise to offer considerable gain for system capacity or coverage, depending on the deployment prioritization, in a cost-efficient way. Yet, in order to fully exploit the benefits of relaying, the inter-cell interference which is increased due to the presence of relay nodes should be limited. Moreover, large differences in the received power levels from different users should be avoided. The goal is to keep the receiver dynamic range low in order to retain the orthogonality of the single carrier-frequency division multiple access system. In this paper, an evaluation of the relay based heterogeneous deployment within the LTE-Advanced uplink framework is carried out by applying the standardized LTE Release 8 power control scheme both at evolved node B and relay nodes. In order to enhance the overall system performance, different power control optimization strategies are proposed for 3GPP urban and suburban scenarios. A comparison between type 1 and type 1b relay nodes is as well presented to study the effect of the relaying overhead on the system performance in inband relay deployments. Comprehensive system level simulations show that the power control is a crucial means to increase the cell edge and system capacities, to mitigate inter-cell interference and to adjust the receiver dynamic range for both relay node types.

Power Allocation for OFDM-Based Cooperative Relay Systems

  • Wu, Victor K. Y.;Li, Ye (Geoffrey);Wylie-Green, Marilynn P.;Reid, Tony;Wang, Peter S. S.
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.156-162
    • /
    • 2008
  • Cooperative relays can provide spatial diversity and improve performance of wireless communications. In this paper, we study subcarrier power allocation at the relays for orthogonal frequency division multiplexing (OFDM)-based wireless systems. For cooperative relay with amplify-and-forward (AF) and decode-and-forward (DF) algorithms, we investigate the impact of power allocation to the mutual information between the source and destination. From our simulation results on word~error-rate (WER) performance, we find that the DF algorithm with power allocation provides better performance than that of AF algorithm in a single path relay network because the former is able to eliminate channel noise at each relay. For the multiple path relay network, however, the network structure is already resistant to noise and channel distortion, and AF approach is a more attractive choice due to its lower complexity.

Interference Alignment in Two-way Relay Channel with Compute-and-Forward

  • Jiang, Xue;Zheng, Baoyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.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.

Selection Based Cooperative Beamforming and Power Allocation for Relay Networks

  • Liu, Yi;Nie, Weiqing
    • Journal of Communications and Networks
    • /
    • v.13 no.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.

Power Allocation Framework for OFDMA-based Decode-and-Forward Cellular Relay Networks

  • Farazmand, Yalda;Alfa, Attahiru S.
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.559-567
    • /
    • 2014
  • In this paper, a framework for power allocation of downlink transmissions in orthogonal frequency division multiple access-based decode-and-forward cellular relay networks is investigated. We consider a system with a single base station communicating with multiple users assisted by multiple relays. The relays have limited power which must be divided among the users they support in order to maximize the data rate of the whole network. Advanced power allocation schemes are crucial for such networks. The optimal relay power allocation which maximizes the data rate is proposed as an upper bound, by finding the optimal power requirement for each user based on knapsack problem formulation. Then by considering the fairness, a new relay power allocation scheme, called weighted-based scheme, is proposed. Finally, an efficient power reallocation scheme is proposed to efficiently utilize the power and improve the data rate of the network. Simulation results demonstrate that the proposed power allocation schemes can significantly improve the data rate of the network compared to the traditional scheme.

Effect of Relay Location in Cooperative Networks with Partially Differential Modulation Scheme (부분차등변조 방식을 이용한 협력네트워크에서의 중계기 위치의 영향)

  • Cho, Woong;Cho, Han-Byeog
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.6
    • /
    • pp.671-676
    • /
    • 2015
  • Cooperative networks eliminate shadow area using relay and enhance communication performance by creating virtual multi input multi output (MIMO) system. In this paper, we analyze the performance of cooperative networks which use coherent modulation scheme in source-relay nodes and differential modulation scheme in relay-destination nodes depending on the relay location. We consider the performance analysis of systems with and without the direct transmission between source and destination node where the direct transmission adopts differential modulation scheme. In addition, the performance of the system with fully differential modulation scheme is compared with the system using partially differential modulation scheme. The performance of system is based on the symbol error rate between source and destination node.

Spectrum Sharing-Based Multi-Hop Decode-and-Forward Relay Networks under Interference Constraints: Performance Analysis and Relay Position Optimization

  • Bao, Vo Nguyen Quoc;Thanh, Tran Thien;Nguyen, Tuan Duc;Vu, Thanh Dinh
    • Journal of Communications and Networks
    • /
    • v.15 no.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.

Optimal Diversity-Multiplexing Tradeoff of MIMO Multi-way Relay Channel

  • Su, Yuping;Li, Ying
    • ETRI Journal
    • /
    • v.35 no.5
    • /
    • pp.919-922
    • /
    • 2013
  • A MIMO multi-way relay channel with full data exchange in which K users exchange messages with each other via the help of a single relay is considered. For the case in which each link is quasi-static Rayleigh fading and the relay is full-duplex, the fundamental diversity-multiplexing tradeoff (DMT) is investigated, and we show that a compress-and-forward relay protocol can achieve the optimal DMT.

Traffic-Aware Relay Sleep Control for Joint Macro-Relay Network Energy Efficiency

  • Deng, Na;Zhao, Ming;Zhu, Jinkang;Zhou, Wuyang
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.47-57
    • /
    • 2015
  • With the ever growing demand of data applications, the joint macro-relay networks are emerging as a promising heterogeneous deployment to provide coverage extension and throughput enhancement. However, the current cellular networks are usually designed to be performance-oriented without enough considerations on the traffic variation, causing substantial energy waste. In this paper, we consider a joint macro-relay network with densely deployed relay stations (RSs), where the traffic load varies in both time and spatial domains. An energy-efficient scheme is proposed to dynamically adjust the RS working modes (active or sleeping) according to the traffic variations, which is called traffic-aware relay sleep control (TRSC). To evaluate the performance of TRSC,we establish an analytical model using stochastic geometry theory and derive explicit expressions of coverage probability, mean achievable rate and network energy efficiency (NEE). Simulation results demonstrate that the derived analytic results are reasonable and the proposed TRSC can significantly improve the NEE when the network traffic varies dynamically.