• Title/Summary/Keyword: Relay network

Search Result 701, Processing Time 0.033 seconds

Development of an Under-Voltage Relay Algorithm Module for a Network Based Protective Relay Simulator (네트워크 기반 보호계전기 시뮬레이터용 저전압 계전 알고리즘 모듈 구현)

  • Kim, Cheol-Hun;Min, Seung-Ki;Choi, Dong-Sung;Kang, Sang-Hee
    • Proceedings of the KIEE Conference
    • /
    • 2011.07a
    • /
    • pp.370-371
    • /
    • 2011
  • This paper proposed an under-voltage relay algorithm module for a network based protective relay simulator. The simulation system is based on the client-server paradigm. The relaying simulator which consists of server-side relay models and user interface provides network-based simulation environment for a variety of protective relaying algorithms. The performance of the relay algorithm was verified by comparing the results of under-voltage relay algorithm in the simulator with the results of the C language implementation.

  • PDF

SER-Based Relay Selection for Two-Way Relaying with Physical Layer Network Coding

  • Li, Dandan;Xiong, Ke;Qiu, Zhengding;Du, Guanyao
    • ETRI Journal
    • /
    • v.35 no.2
    • /
    • pp.336-339
    • /
    • 2013
  • To enhance the symbol error rate (SER) performance of the two-way relay channels with physical layer network coding, this letter proposes a relay selection scheme, in which the relay with the maximal minimum distance between different points in its constellation among all relays is selected to assist two-way transmissions. We give the closed-form expression of minimum distance for binary phase-shift keying and quadrature phase-shift keying. Additionally, we design a low-complexity method for higher-order modulations based on look-up tables. Simulation results show that the proposed scheme improves the SER performance for two-way relay networks.

Dynamic IP Assignment Method for Wireless Internet Service of Visited Mobile ISP Subscriber on GPRS Network (GPRS망을 방문한 이동 ISP 가입자의 무선 인터넷 서비스를 위한 동적 IP 할당 방법)

  • Park, Jeong-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.951-958
    • /
    • 2004
  • This paper describes problems when visited ISP subscriber gets dynamic IP address in home ISP for wireless internet service on GPRS network. We propose a specific DHCP relay for wireless internet service of visited ISP subscriber on GPRS network. We designed and implemented the specific DHCP relay and installed it in ISP testbed. We show the allocated dynamic IP address using specific DHCP relay for visited ISP subscriber on GPRS network. Now we think it is possible the visited ISP subscriber can access wireless internet service on GPRS network using specific DHCP relay, and UMTS system can be managed IP address for subscriber roaming.

Access Control for D2D Systems in 5G Wireless Networks

  • Kim, Seog-Gyu;Kim, Jae-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.1
    • /
    • pp.103-110
    • /
    • 2021
  • In this paper, we compare two access control mechanisms for D2D(Device-to-Device) systems in 5G wireless networks and propose an effective access control for 5G D2D networks. Currently, there is no specified access control for 5G D2D networks but there can be two access control approaches for 5G D2D networks. One is the UE-to-Network Relay based access control and the other is the Remote UE(User Equipment) based access control. The former is a UE-to-Network Relay carries out the access control check for 5G D2D networks but the latter is a Remote UE performs the access control check for 5G D2D networks. Through simulation and evaluation, we finally propose the Remote UE based access control for D2D systems in 5G wireless networks. The proposed approach minimizes signalling overhead between the UE-to-Network Relay and the Remote UE and more efficiently performs the access control check, when the access control functionalities are different from the UE-to-Network Relay in 5G D2D networks.

Performance Analysis of a Double Opportunistic Cooperative Diversity System with Uniform Power Relay Selection (균일전력 릴레이 선택방식을 적용한 이중 기회전송 협동 다이버시티 시스템의 성능분석)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.6
    • /
    • pp.15-21
    • /
    • 2011
  • Cooperative diversity system can be applied to an ad-hoc network for reduction of the power consumption, for expansion of the communication range, and for improving the system performance. In a selection relay cooperative diversity system which selects the maximal SNR(Signal-to-noise ratio) relay for transmitting the source information, the selected strong relay transmits continuously under slow fading channel, consequently it reduces the network lifetime. To overcome this defect, recently the uniform power relay selection has been studied to expand the network life time. We apply the uniform power relay selection to a DOT(Double opportunistic transmit) cooperative system that select the transmit relays, of which the SNR of the transmit relays exceed both of the source-relay and the relay-destination threshold. And the performance of the system is analytically derived. The performance comparisons are made among SC(Selection combining), MRC(Maximal ratio combining), and uniform power relay selection of the cooperative diversity system. We noticed that the performance of the uniform power relay selection is inferior to that of others. It is interpreted that the uniform transmit opportunity to the selected relays for extension of the network lifetime degrades the performance.

Opportunistic Relay Selection for Joint Decode-and-Forward Based Two-Way Relaying with Network Coding

  • Ji, Xiaodong;Zheng, Baoyu;Zou, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.9
    • /
    • pp.1513-1527
    • /
    • 2011
  • This paper investigates the capacity rate problems for a joint decode-and-forward (JDF) based two-way relaying with network coding. We first characterize the achievable rate region for a conventional three-node network scenario along with the calculation of the corresponding maximal sum-rate. Then, for the goal of maximizing the system sum-rate, opportunistic relay selection is examined for multi-relay networks. As a result, a novel strategy for the implementation of relay selection is proposed, which depends on the instantaneous channel state and allows a single best relay to help the two-way information exchange. The JDF scheme and the scheme using relay selection are analyzed in terms of outage probability, after which the corresponding exact expressions are developed over Rayleigh fading channels. For the purpose of comparison, outage probabilities of the amplify-and-forward (AF) scheme and those of the scheme using relay selection are also derived. Finally, simulation experiments are done and performance comparisons are conducted. The results verify that the proposed strategy is an appropriate method for the implementation of relay selection and can achieve significant performance gains in terms of outage probability regardless of the symmetry or asymmetry of the channels. Compared with the AF scheme and the scheme using relay selection, the conventional JDF scheme and that using relay selection perform well at low signal-to-noise ratios (SNRs).

Outage Probability Analysis of Adaptive Two-Way Relay Cooperative Communication (적응형 양방향 중계기 협력 통신의 오수신 확률 분석)

  • Lee, Jin-Hee;Kong, Hyung-Yun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.4
    • /
    • pp.392-398
    • /
    • 2010
  • In this paper, we proposed adaptive two-way relay cooperative communication considering the quality of the user-relay links, and derived outage probability. Network-coding based two-way relay communication can achieve more throughput since it can reduce transmission time compared conventional two-way relay communication. However, Network-coding based two-way relay communication assume that the relay can decode received signal correctly. If relay cannot decode the signal, it leads to error propagation at the relay. In this paper, we proposed adaptive two-way relay cooperative communication scheme. In proposed scheme, the user "A" transmits the signal to relay and another user "B". The relay operates adaptively depend on quality of user-relay links. Simulation result show that proposed scheme has better performance when the quality of the user-relay links are poor. Also it can get diversity order 2.

Secrecy Performance of Multi-Antenna Satellite-Terrestrial Relay Networks with Jamming in the Presence of Spatial Eavesdroppers

  • Wang, Xiaoqi;Hou, Zheng;Zhang, Hanwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3152-3171
    • /
    • 2022
  • This work investigates the physical layer secrecy of a multi-antenna hybrid satellite-terrestrial relay networks (HSTRN) with jamming, in which a satellite aims to make communication with a destination user by means of a relay, along with spatially random eavesdroppers. In order to weaken the signals of eavesdroppers, the conventional relay can also generate intentional interference, besides forwarding the received signal. Shadowed-Rician fading is adopted in satellite link, while Rayleigh fading is adopted in terrestrial link, eavesdropper link and jamming link. The analytical and asymptotic formulas for the system secrecy outage probability (SOP) are characterized. Practical insights on the diversity order of the network are revealed according to the asymptotic behavior of SOP at high signal-to-noise ratio (SNR) regime. Then, analysis of the system throughput is examined to assess the secrecy performance. In the end, numerical simulation results are presented to validate the theoretical analysis and point out: (1) The secrecy performance of the considered network is affected by the channel fading scenario, the system configuration; (2) Decrease of the relay coverage airspace can provide better SOP performance; (3) Jamming from the relay can improve secrecy performance without additional network resources.

Opportunistic Data Relay Scheme for Narrowband Multihop Combat Radio Networks (협대역 다중홉 전투무선망에서 기회적 데이터 중계 기법)

  • Lee, Jongkwan
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.25 no.1
    • /
    • pp.65-71
    • /
    • 2022
  • In this paper, we propose an opportunistic data relay scheme in narrowband multihop combat radio networks. Narrowband networks have physical restrictions on high-speed transmission. Furthermore, the topology changes dynamically due to the jamming of the enemy, signal interference between friendly forces, and movement of network entities. Therefore, the traditional relay scheme that collects topology information and calculates a relay path before transmission is unsuitable for such networks. Our proposed scheme does not collect topology information and transmits data opportunistically. The scheme can cause unnecessary data relaying that is not related to data delivery to the destination node. However, for small networks, the effect of increasing network throughput by not gathering topology information is much greater than the effect of reducing throughput by unnecessary data relays. We demonstrate the performance superiority of the proposed scheme through simulation in the worst case of network topology.

Achievable Rate of Beamforming Dual-hop Multi-antenna Relay Network in the Presence of a Jammer

  • Feng, Guiguo;Guo, Wangmei;Gao, Jingliang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3789-3808
    • /
    • 2017
  • This paper studies a multi-antenna wireless relay network in the presence of a jammer. In this network, the source node transmits signals to the destination node through a multi-antenna relay node which adopts the amplify-and-forward scheme, and the jammer attempts to inject additive signals on all antennas of the relay node. With the linear beamforming scheme at the relay node, this network can be modeled as an equivalent Gaussian arbitrarily varying channel (GAVC). Based on this observation, we deduce the mathematical closed-forms of the capacities for two special cases and the suboptimal achievable rate for the general case, respectively. To reduce complexity, we further propose an optimal structure of the beamforming matrix. In addition, we present a second order cone programming (SOCP)-based algorithm to efficiently compute the optimal beamforming matrix so as to maximize the transmission rate between the source and the destination when the perfect channel state information (CSI) is available. Our numerical simulations show significant improvements of our propose scheme over other baseline ones.