• Title/Summary/Keyword: Relay Systems

Search Result 739, Processing Time 0.027 seconds

Outage Probability of Two-Hop Relay Networks with Related Interference

  • Pan, Peisheng;Zheng, Baoyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.1786-1804
    • /
    • 2013
  • We consider a specific interference-limited wireless relay system that comprises several cooperation units (CUs) which are defined as a source and destination node pair with an associated relay node. In the wireless relay system, all source nodes simultaneously transmit their own signals and the relay node in each CU then forwards the received signal to the destination node, causing co-channel interference at both the relay node and the destination node in each CU. The co-channel interference at the relay node is closely related to that at the destination node in each CU. We first derive the end-to-end outage probability in a CU over Rayleigh slow-fading channels with interference for the decode-and-forward (DF) relaying strategy. Then, on the assumption that each CU is allocated with equal power we design an optimal power allocation between the source node and the relay node in each CU to minimize the outage probability of the investigated CU. At last, in the case that each CU is not allocated with equal power and the sum of their power is constrained, we present an optimal power allocation between CUs to minimize the sum of the outage probability of all CUs. The analytical results are verified by simulations.

Slotted ALOHA Based Greedy Relay Selection in Large-scale Wireless Networks

  • Ouyang, Fengchen;Ge, Jianhua;Gong, Fengkui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3945-3964
    • /
    • 2015
  • Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.

Joint Relay Selection and Resource Allocation for Delay-Sensitive Traffic in Multi-Hop Relay Networks

  • Sha, Yan;Hu, Jufeng;Hao, Shuang;Wang, Dan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3008-3028
    • /
    • 2022
  • In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

Performance analysis of cooperative communication algorithm with various relay conditions (다양한 릴레이 조건에 따른 협력 통신 기법의 성능 분석)

  • Kim, Yoon-Hyun;Park, Jae-Sung;Kim, Jin-Young
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.329-332
    • /
    • 2009
  • In this paper, performance of cooperative communication system is analyzed with various relay conditions for mobile communication system using OFDM. We research mainly on the performance analysis of amplify-and-forward scheme. First, we analyzed the diversity gain between the number of antenna on the relay is one and two. And then, in this paper, we analyzed difference of the performance with distance between relay and mobile. Amplify-and-forward scheme has the problem that the noise components are also amplified in low sinal-to-noise (SNR) condition. The results of this paper can be applicable to the cooperative relay systems.

  • PDF

Rate Bounds for MIMO Relay Channels

  • Lo, Caleb K.;Vishwanath, Sriram;Heath, Jr., Robert W.
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.194-203
    • /
    • 2008
  • This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of freedom, making the design and analysis of optimal cooperative strategies more complex. In this paper, a partial cooperation strategy that combines transmit-side message splitting and block-Markov encoding is presented. Lower bounds on capacity that improve on a previously proposed non-cooperative lower bound are derived for Gaussian MIMO relay channels.

Half-Duplex Relaying Strategy Suitable for a Relay with Mobility

  • Hwang, Inho;Lee, Jeong Woo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.108-125
    • /
    • 2015
  • We propose a new time-division half-duplex estimate-and-forward (EF) relaying strategy suitable for a relay with mobility. We reconfigure EF relaying to guarantee a strong relay-destination link which is required to achieve a high rate using EF relaying. Based on the reconfigured model, we optimize the relaying strategy to attain a high rate irrespective of the relay position with preserving the total transmit bandwidth and energy. The proposed relaying strategy achieves high communication reliability for any relay position, which differs from conventional EF and decode-and-forward (DF) relaying schemes.

Setting Considerations of Distance Relay for Transmission Line with STATCOM

  • Zhang, Wen-Hao;Lee, Seung-Jae;Choi, Myeon-Song
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.4
    • /
    • pp.522-529
    • /
    • 2010
  • Distance relay plays an important role in the protection of transmission lines. The application of flexible AC transmission systems (FACTS) devices, such as the static synchronous compensator (STATCOM), could affect the performance of the distance relay because of compensation effect. This paper analyzes the application of distance relay on the protection of a transmission line containing STATCOM. New setting principles for different protection zones are proposed based on this analysis. A typical 500 kV transmission system employing STATCOM is modeled using Matlab/Simulink. The impact of STATCOM on distance protection scheme is studied for different fault types, fault locations, and system configurations. Based on simulation results, the performance of distance relay is evaluated. The setting principle can be verified for the transmission line with STATCOM.

A Probabilistic Approach to the Protection Capability Evaluation of Distance Relay in Transmission Systems

  • Zhang, Wen-Hao;Lee, Seung-Jae;Choi, Myeon-Song
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.3
    • /
    • pp.407-414
    • /
    • 2010
  • This paper proposes a probability measure for the evaluation of relay performance from two aspects, namely, correct trip and no-unwanted trip. They are developed based on the relationship between relay settings and relay measurements, which follow a Gaussian probability model. The proposed method based on strict mathematical derivation is applied to protection capability evaluation of distance relays under various settings. Considering the specific attributes of each protection zone, the optimal settings are also determined accordingly. The protection capability could demonstrate clearly the relay performance under various settings and the optimal settings could provide good references for engineering applications.

Interference Cancellation for Relay-Assisted D2D Communication

  • Zhao, Hongyi;Cao, Yang;Liu, Yingzhuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3276-3292
    • /
    • 2015
  • Relay-assisted D2D communication extends the communication range of the D2D pairs and helps users to form D2D pairs effectively. However, due to the introduction of the multi-hop relaying, the D2D communication has to occupy extra transmission time, which may decrease the efficiency of the communication system. In this paper, we propose a scheme to make node receive D2D signal and BS signal at overlapping time to improve the spectrum efficiency according to ZigZag decoding and successive-interference-cancellation (SIC). In this way, more data can be delivered during the same duration, thus the network throughput can be further improved. Numerical results verify the performance improvement of the proposed scheme when compared with a baseline scheme. Moreover, we expand the proposed scheme from one-hop relay scenario to multi-hop relay scenario.

Geometric Programming Applied to Multipoint-to-Multipoint MIMO Relay Networks

  • Kim, Jaesin;Kim, Suil;Pak, Ui-Young
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.241-246
    • /
    • 2015
  • In this paper, we consider a relaying system which employs a single relay in a wireless network with distributed sources and destinations. Here, all source, destination, and relay nodes are equipped with multiple antennas. For amplify-and-forward relay systems, we confirm the achievable sum rate through a joint multiple source precoders and a single relay filter design. To this end, we propose a new linear processing scheme in terms of maximizing the sum rate performance by applying a blockwise relaying method combined with geometric programming techniques. By allowing the global channel knowledge at the source nodes, we show that this joint design problem is formulated as a standard geometric program, which can guarantees a global optimal value under the modified sum rate criterion. Simulation results show that the proposed blockwise relaying scheme with the joint power allocation method provides substantial sum rate gain compared to the conventional schemes.