• Title/Summary/Keyword: Relay-based

Search Result 895, Processing Time 0.025 seconds

The Relay Circuits Translation to EMFGs (릴레이 회로의 확장된 마크흐름선도 변환)

  • 여정모;백형구
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.11
    • /
    • pp.952-957
    • /
    • 2003
  • We propose how to translate relay circuits to the EMFGs(Extended Mark Flow Graphs) formally and analyze the original one by using the mark flow of it. Firstly, the concepts of the output condition, the output-on condition and the output-off condition are introduced in the relay circuits. These can be used to find the structure and the operation of respective relay outputs but the sequential operations of them cannot be obtained from these. Secondly, a relay circuit is translated to the corresponding EMFG as the all output-on conditions and all output-off conditions of it are translated to EMFGs. For the adequate translation, the condition arc and the concepts of the generation transition and the degeneration transition are introduced, and the duality for the simplification of the result. Thirdly, we analyze the operation of the original circuit by analyzing the mark flow of the resulting EMFG. We can achieve easy and fast analysis based on the EMFG's operation algorithm. Finally, we apply these to the relay circuit for an electric furnace and analyze its operation with the mark flow of the resulting EMFG. The formal translation from relay circuits to EMFGs makes the analysis easy so that these results can be used to design, modelling, the fault detection and the maintenance.

Robust Relay Design for Two-Way Multi-Antenna Relay Systems with Imperfect CSI

  • Wang, Chenyuan;Dong, Xiaodai;Shi, Yi
    • Journal of Communications and Networks
    • /
    • v.16 no.1
    • /
    • pp.45-55
    • /
    • 2014
  • The paper investigates the problem of designing the multiple-antenna relay in a two-way relay network by taking into account the imperfect channel state information (CSI). The objective is to design the multiple-antenna relay based upon the CSI estimates, where the estimation errors are included to attain the robust design under the worst-case philosophy. In particular, the worst-case transmit power at the multiple-antenna relay is minimized while guaranteeing the worst-case quality of service requirements that the received signal-to-noise ratio (SNR) at both sources are above a prescribed threshold value. Since the worst-case received SNR expression is too complex for subsequent derivation and processing, its lower bound is explored instead by minimizing the numerator and maximizing the denominator of the worst-case SNR. The aforementioned problem is mathematically formulated and shown to be nonconvex. This motivates the pursuit of semidefinite relaxation coupled with a randomization technique to obtain computationally efficient high-quality approximate solutions. This paper has shown that the original optimization problem can be reformulated and then relaxed to a convex problem that can be solved by utilizing suitable randomization loop. Numerical results compare the proposed multiple-antenna relay with the existing nonrobust method, and therefore validate its robustness against the channel uncertainty. Finally, the feasibility of the proposed design and the associated influencing factors are discussed by means of extensive Monte Carlo simulations.

A Simple $N^{th}$ Best-Relay Selection Criterion for Opportunistic Two-Way Relay Networks under Outdated Channel State Information

  • Ou, Jinglan;Wu, Haowei;Wang, Qi;Zou, Yutao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3409-3422
    • /
    • 2014
  • The frequency spectrum available for the wireless communication is extremely crowded. In order to improve the spectral efficiency, the two-way relay networks have aroused great attention. A simple $N^{th}$ best-relay selection criterion for the opportunistic two-way relay networks is proposed, which can be implemented easily by extending the distributed timer technique in practice, since the proposed criterion is mainly based on the channel gains. The outage performance of the proposed relay selection scheme is analyzed under the outdated channel state information (CSI), and a tight closed-form lower bound and asymptotic value of the outage probability over Rayleigh fading channels are obtained. Simulation results demonstrate that the tight closed-form lower bound of the outage probability very closely matches with simulated ones in the whole SNR region, and the asymptotic results provide good tight approximations to the simulation ones, especially in the high SNR region.

Approximated Outage Probability for ADF Relay Systems with Burst MPSK and MQAM Symbol Transmission

  • Ko, Kyunbyoung;Lim, Sungmook
    • International Journal of Contents
    • /
    • v.11 no.1
    • /
    • pp.7-14
    • /
    • 2015
  • In this paper, we derive the outage probability for M-ary phase shifting keying (MPSK) and M-ary quadrature amplitude modulation (MQAM) burst transmission (BT) of adaptive decode-and-forward (ADF) cooperative relay systems over quasi-static Rayleigh fading channels. Within a burst, there are pilot symbols and data symbols. Pilot symbols are used for channel estimation schemes and each relay node's transmission mode selection schemes. At first, we focus on ADF relay systems in which the probability density function (PDF) is derived on the basis of error events at relay nodes corresponding to channel estimation errors. Next, the average outage probability is derived as an approximate expression for an arbitrary link signal-to-noise ratio (SNR) for different modulation orders. Its accuracy is demonstrated by comparison with simulation results. Further, it is confirmed that BT-ADF relay systems with pilot symbol based channel estimation schemes enables to select correctly decoded relay nodes without additional signaling between relay nodes and the destination node, and it is verified that the ideal performance is achieved with small SNR loss.

Optimal Energy-Efficient Power Allocation and Outage Performance Analysis for Cognitive Multi-Antenna Relay Network Using Physical-Layer Network Coding

  • Liu, Jia;Zhu, Ying;Kang, GuiXia;Zhang, YiFan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3018-3036
    • /
    • 2013
  • In this paper, we investigate power allocation scheme and outage performance for a physical-layer network coding (PNC) relay based secondary user (SU) communication in cognitive multi-antenna relay networks (CMRNs), in which two secondary transceivers exchange their information via a multi-antenna relay using PNC protocol. We propose an optimal energy-efficient power allocation (OE-PA) scheme to minimize total energy consumption per bit under the sum rate constraint and interference power threshold (IPT) constraints. A closed-form solution for optimal allocation of transmit power among the SU nodes, as well as the outage probability of the cognitive relay system, are then derived analytically and confirmed by numerical results. Numerical simulations demonstrate the PNC protocol has superiority in energy efficiency performance over conventional direct transmission protocol and Four-Time-Slot (4TS) Decode-and-Forward (DF) relay protocol, and the proposed system has the optimal outage performance when the relay is located at the center of two secondary transceivers.

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.

Adaptive Success Rate-based Sensor Relocation for IoT Applications

  • Kim, Moonseong;Lee, Woochan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3120-3137
    • /
    • 2021
  • Small-sized IoT wireless sensing devices can be deployed with small aircraft such as drones, and the deployment of mobile IoT devices can be relocated to suit data collection with efficient relocation algorithms. However, the terrain may not be able to predict its shape. Mobile IoT devices suitable for these terrains are hopping devices that can move with jumps. So far, most hopping sensor relocation studies have made the unrealistic assumption that all hopping devices know the overall state of the entire network and each device's current state. Recent work has proposed the most realistic distributed network environment-based relocation algorithms that do not require sharing all information simultaneously. However, since the shortest path-based algorithm performs communication and movement requests with terminals, it is not suitable for an area where the distribution of obstacles is uneven. The proposed scheme applies a simple Monte Carlo method based on relay nodes selection random variables that reflect the obstacle distribution's characteristics to choose the best relay node as reinforcement learning, not specific relay nodes. Using the relay node selection random variable could significantly reduce the generation of additional messages that occur to select the shortest path. This paper's additional contribution is that the world's first distributed environment-based relocation protocol is proposed reflecting real-world physical devices' characteristics through the OMNeT++ simulator. We also reconstruct the three days-long disaster environment, and performance evaluation has been performed by applying the proposed protocol to the simulated real-world environment.

Cooperative Diversity Based on Interleavers and Its efficient Algorithm in Amplify-And-Forward Relay Networks (Amplify-Forward Relay Network의 인터리버에 근거한 협동 다이버시티와 그 효과적 알고리즘)

  • Yan, Yier;Jo, Gye-Mun;Balakannan, S.P.;Lee, Moon-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.6
    • /
    • pp.94-102
    • /
    • 2009
  • In [1], the authors have proposed a novel scheme to achieve full diversity and to combat the time delays from each relay node, but decode-and-forward (DF) model operation mode puts more processing burden on the relay. In this paper, we not only extend their model into amplify and forward (AF) model proposed in [2],[3], but also propose an efficient decoding algorithm, which is able to order the joint channel coefficients of overall channel consisting of source-relay link and relay-destination link and cancels the previous decoded symbols at the next decoding procedure. The simulation results show that this algorithm efficiently improves its performance achieving 2-3dB gain compared to [1] in high SNR region and also useful to DF achieving more than 3dB gain compared to an original algorithm.

Trust Degree Information based Relay Selection in Cooperative Communication with Multiple Relays (다수의 릴레이가 존재하는 협력 통신 환경에서 신뢰도 정보 기반의 릴레이 선택 기법)

  • Ryu, Jong Yeol;Kim, Seong Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.3
    • /
    • pp.509-515
    • /
    • 2017
  • In this paper, for a cooperative communication system with multiple relays, we consider a relay selection method by exploiting the trust degree information of relay nodes. In the cooperative communication system, we interpret the trust degree of relays as the probability that relay helps the communication between the transmitter and receiver. We first provide an expected achievable rate at the receiver by taking into account the both cases that the relay helps the transmission of transmitter and the relay does not help the transmission of transmitter according to its trust degree. For given trust degree information, we propose an efficient relay selection method to maximize the expected achievable rate at the receiver. For the various configurations, the simulation results confirm that the proposed relay selection method outperforms the conventional relay selection method, which does not consider the trust degree of relay nodes.

Relay Selection Algorithm for Two-way Multiple Relay Channels (양방향 다중 중계기 채널에서의 중계기 선택 기법)

  • Kang, Yoo-Keun;Lee, Jae-Hong
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.134-143
    • /
    • 2009
  • In this paper, we propose a new relay selection algorithm for a two-way multiple relay channel. In the two-way multiple relay channel, two users exchange information with each other via multiple relays. The relays use a decode-and-forward or amplify-and-forward protocol, and exploit the combining process of the received packets to reduce the required channel resources. In the multiple relay network, diversity gain is achieved as the number of relays increases, and various schemes are proposed. In this paper, we propose a single best relay selection scheme based on instantaneous channel conditions. First of all, relays obtain the instantaneous channel state information in the handshaking process, and a single best relay is selected in a distributed methods prior to data transmissions. The relay selection metric is proposed so that the end-to-end channel condition is evaluated based on the intantaneous channel state informations. Simulation results show that the proposed relay selection algorithm achieve the increased throughput and diversity order when the number of potential relays is increased.