• Title/Summary/Keyword: Relay Communications

Search Result 439, Processing Time 0.023 seconds

Performance Analysis of IDF Relaying M2M Cooperative Networks over N-Nakagami Fading Channels

  • Xu, Lingwei;Zhang, Hao;Gulliver, T. Aaron
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3983-4001
    • /
    • 2015
  • Exact average bit error probability (BEP) expressions for mobile-relay-based mobile-to-mobile (M2M) cooperative networks with incremental decode-and-forward (IDF) relaying over N-Nakagami fading channels are derived in this paper. The average BEP performance under different conditions is evaluated numerically to confirm the accuracy of the analysis. Results are presented which show that the fading coefficient, the number of cascaded components, the relative geometrical gain, and the power allocation parameter have a significant influence on the average BEP performance.

Polar coded cooperative with Plotkin construction and quasi-uniform puncturing based on MIMO antennas in half duplex wireless relay network

  • Jiangli Zeng;Sanya Liu
    • ETRI Journal
    • /
    • v.46 no.2
    • /
    • pp.175-183
    • /
    • 2024
  • Recently, polar code has attracted the attention of many scholars and has been developed as a code technology in coded-cooperative communication. We propose a polar code scheme based on Plotkin structure and quasi-uniform punching (PC-QUP). Then we apply the PC-QUP to coded-cooperative scenario and built to a new coded-cooperative scheme, which is called PCC-QUP scheme. The coded-cooperative scheme based on polar code is studied on the aspects of codeword construction and performance optimization. Further, we apply the proposed schemes to space-time block coding (STBC) to explore the performance of the scheme. Monte Carlo simulation results show that the proposed cooperative PCC-QUP-STBC scheme can obtain a lower bit error ratio (BER) than its corresponding noncooperative scheme.

Secure Physical Layer Key Generation in Untrusted Wireless Relay Communications and Networks (비신뢰 무선 릴레이 통신 네트워크의 안전한 물리계층 키 생성 기법)

  • So-Hyun Park;Il-Gu Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2024.05a
    • /
    • pp.158-161
    • /
    • 2024
  • 물리계층 키 생성 기법은 두 단말 간의 채널 상태 정보를 이용해 일시적인 대칭키를 생성하는 경량 키 생성 기술이다. 하지만, 두 단말 사이에 다이렉트 링크가 없는 릴레이 기반 통신 네트워크 환경에서는 물리계층 키 생성이 어렵고, 비신뢰 릴레이에 의한 키 유출 가능성이 존재한다. 본 연구는 비신뢰 릴레이 통신 네트워크 환경에서 비밀키 정보를 노출하지 않고 안전하게 키를 생성하고 공유하는 방법을 제안하고 보안성을 평가한다. 실험 결과에 따르면 종래 방식보다 제안하는 방식의 키 유출률(key leakage rate, KLR)이 87.5% 감소하였고, 릴레이 수가 증가할수록 KLR이 감소하여 제안하는 방식이 비신뢰 릴레이 환경에서 높은 보안성을 보장함을 확인하였다.

Enhancing the Performance of 3GPP LTE Uplink Using Relays based on Hybrid OFDMA/SC-FDMA (3GPP LTE 기반 상향링크에서 Hybrid OFDMA/SC-FDMA 릴레이를 이용한 성능 향상)

  • Kang, Dong-Kwan;Xue, Peng;Kim, Duk-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12A
    • /
    • pp.941-948
    • /
    • 2009
  • In the 3GPP LTE systems, SC-FDMA is adopted for the uplink owing to its good PAPR efficiency. In the frequency domain, however, the performance of SC-FDMA is degraded due to frequency selective fading. As a compromise, a Hybrid OFDMA/SC-FDMA was proposed in the LTE-Advanced systems. Hybrid scheme uses SC-FDMA in the edge of cell area, while it uses OFDMA nearby the base-station. In this paper, uplink relays based on hybrid scheme is proposed to increase the performance of the 3GPP LTE systems. With different positions of mobile and relay, the proposed scheme can adaptively select SC-FDMA or OFDMA to improve the link performance. Our simulation results show that the proposed scheme achieves a better performance in terms of end-to-end BER and power consumption.

Novel Interference Cancellation Scheme in Cooperation Communication Environment (협력통신 환경에서의 새로운 간섭제거 기법)

  • Kim, Yoon Hyun;Park, Young Sik;Shin, Dong Soo;Hwang, Yu Min;Kim, Jin Young;Rho, Jung Kyu
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.3
    • /
    • pp.98-103
    • /
    • 2014
  • In this paper, we propose and analyze a novel interference cancellation scheme in cooperation communication environment in which a large number of users exist. In cooperative communication system consisting a source, destination, and relay, ad-hoc groups undergo a rapid degradation because of interference data form adjacent ad-hoc groups. To solve these problems, we propose Zero Forcing (FC) and Minimum Mean Square Error (MMSE) and make a dent in the magnitude of interference. Finally, we can obtain orignal data using Successive Interference Cancellation (SIC). The performance of proposed scheme is analyzed in terms of a bit error probability. The results of the paper can be applied to design of various ad-hoc networks for cooperation communication systems.

Single Carrier Frequency Domain Equalization in 3-slot Based Amplify-and-Forward Relaying Network for Shadow Area (음영 지역을 위한 3-슬롯 기반의 AF 방식 중계기 네트워크에서의 단일 반송파 주파수 대역 등화 기법)

  • Won, Hui-Chul
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.7
    • /
    • pp.9-16
    • /
    • 2012
  • In order to extend cell coverage and to cope with shadow areas, a relay-assisted wireless communications system has been widely studied. In this paper, we propose new equalization method for single carrier (SC) frequency domain equalizer (FDE) in amplify-and-forward (AF) relaying multi-path networks to improve the performance at shadow areas. The performance of SC-FDE system in 3-slot based multi-path networks can be improved considerably with the diversity gain which we obtain by equalizing the combined signal from relays by means of the minimum mean square error (MMSE) criteria. We find the weighting coefficients of maximum ratio combining (MRC) and the tap coefficients of MMSE equalizer for SC-FDE in AF relaying multi-path networks. Simulation results show that the proposed system considerably outperforms the conventional SC-FDE system.

Minimum Energy-per-Bit Wireless Multi-Hop Networks with Spatial Reuse

  • Bae, Chang-Hun;Stark, Wayne E.
    • Journal of Communications and Networks
    • /
    • v.12 no.2
    • /
    • pp.103-113
    • /
    • 2010
  • In this paper, a tradeoff between the total energy consumption-per-bit and the end-to-end rate under spatial reuse in wireless multi-hop network is developed and analyzed. The end-to-end rate of the network is the number of information bits transmitted (end-to-end) per channel use by any node in the network that is forwarding the data. In order to increase the bandwidth efficiency, spatial reuse is considered whereby simultaneous relay transmissions are allowed provided there is a minimum separation between such transmitters. The total energy consumption-per-bit includes the energy transmitted and the energy consumed by the receiver to process (demodulate and decoder) the received signal. The total energy consumption-per-bit is normalized by the distance between a source-destination pair in order to be consistent with a direct (single-hop) communication network. Lower bounds on this energy-bandwidth tradeoff are analyzed using convex optimization methods. For a given location of relays, it is shown that the total energy consumption-per-bit is minimized by optimally selecting the end-to-end rate. It is also demonstrated that spatial reuse can improve the bandwidth efficiency for a given total energy consumption-per-bit. However, at the rate that minimizes the total energy consumption-per-bit, spatial reuse does not provide lower energy consumption-per-bit compared to the case without spatial reuse. This is because spatial reuse requires more receiver energy consumption at a given end-to-end rate. Such degraded energy efficiency can be compensated by varying the minimum separation of hops between simultaneous transmitters. In the case of equi-spaced relays, analytical results for the energy-bandwidth tradeoff are provided and it is shown that the minimum energy consumption-per-bit decreases linearly with the end-to-end distance.

UWB-based Class 4 Active RFID Protocol for USN Application (USN 응용을 위한 UWB 기반의 Class 4 능동형 RFID 프로토콜)

  • Hong, Sung-Hyun;Zhang, Hong;Chang, Kyung-Hi;Shin, Dong-Beom;Lee, Heyung-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7A
    • /
    • pp.669-681
    • /
    • 2010
  • In this paper, we analyze the active RFID system ISO/IEC 18000-7. In order to apply to USN, which consists active RFID tags and sensor nodes, we propose UWB-based Class 4 active RFID protocol using active RFID relay tag as relay AP. To compare the performance between the existing ISO/IEC 18000-7 system and the proposed system, we introduce sensitivity-based measurement of achieved coverage and system efficiency. Also, we analyze the performance of the proposed system and compare it with that of the existing system through MCL analysis and SLS analysis.

On Deploying Relays for Connected Indoor Sensor Networks

  • Zhu, Yanmin;Xue, Cuiyao;Cai, Haibin;Yu, Jiadi;Ni, Lei;Li, Minglu;Li, Bo
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.335-343
    • /
    • 2014
  • This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios; wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a $H_n$ factor approximation to the theoretical optimum, where $H_n=1+{\frac{1}{2}}+{\cdots}+{\frac{1}{n}}={\ln}(n)+1$, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms.

A Hierarchical Preamble Design Technique for Efficient Handover in OFDM-based Multi-hop Relay Systems (OFDM 기반 다중 홉 릴레이시스템에서 효율적인 핸드오버를 위한 계층적 프리앰블 설계 기법)

  • Yoo, Hyun-Il;Kim, Yeong-Jun;Woo, Kyung-Soo;Kim, Jae-Kwon;Yun, Sang-Boh;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4A
    • /
    • pp.342-351
    • /
    • 2008
  • In this paper, a new handover procedure for OFDM-based multi-hop relay systems is proposed to reduce the handover overhead by distinguishing inter-cell handover event from intra-cell handover event at the level of physical layer using a hierarchical design concept of preamble. A Subcell ID concept for identifying RS in a cell is proposed in the design of hierarchical manner, in addition to the existing Cell ID for identifying BS. The decision on either inter-cell handover or intra-cell handover is made by the signal quality measure of CBINR(Carrier of BS to Interference and Noise Ratio) and CRINR(Carrier of RS to Interference and Noise Ratio), provided by the hierarchical preamble. The proposed handover procedure can simplify scanning procedure and skip/simplify network re-entry procedure (capability negotiation, authorization, registration), resulting in a significant reduction of handover overhead.