• Title/Summary/Keyword: 릴레이 선택

Search Result 104, Processing Time 0.023 seconds

Average Data Rate Analysis for Data Exchanging Nodes via Relay by Concurrent Transmission (데이타 교환 노드의 동시 전송 릴레이 이용을 위한 평균 데이터 전송률 분석)

  • Kwon, Taehoon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.6
    • /
    • pp.638-644
    • /
    • 2018
  • Relay systems have recently gained attentions because of its capability of cell coverage extension and the power gain as the one of key technologies for 5G. Relays can be exploited for small-cell base stations and the autonomous network, where communication devices communicate with each other cooperatively. Therefore, the relay technology is expected to enable the low power and large capacity communication. In order to maximize the benefits of using a limited number of relays, the efficient relay selection method is required. Especially, when two nodes exchange their data with each other via relay, the relay selection can maximize the average data rate by the spatial location of the relay. For this purpose, the average data rate is analyzed first according to the relay selection. In this paper, we analyzed the average data rate when two nodes exchange their data via dual-hop decode and forward relaying considering the interference by the concurrent transmission under Nakagami-m fading channel. The correctness of the analysis is verified by the Monte Carlo simulation. The results show that the concurrent transmission is superior to the non-concurrent transmission in the high required data rate region rather than in the low required data rate region.

Performance Analysis of Single Hop Cooperative Relay Spectrum Sensing (단일 홉 릴레이 협력 스펙트럼 센싱의 성능 분석)

  • Lee, Mi Sun;Kim, Yoon Hyun;Kim, Jin Young
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.2
    • /
    • pp.30-35
    • /
    • 2012
  • In this paper, we proposed spectrum sensing using cooperative relay to solve problem of sensing performance degradation due to CPE (Customer-Primise equipments) which causes low SNR (signal-to-noise ratio) problem. This system model is expected that cooperative relay scheme guarantees the high sensing performance by its diversity gain. Based on these backgrounds, in this paper, we apply to cooperative relay scheme to the CR (cognitive radio) system, and simulation results show comparison of the sensing performance combining method EGC and MRC.

Power-aware Relay Selection Algorithm for Cooperative Diversity in the Energy-constrained Wireless Sensor Networks (전력 제한된 무선 센서네트워크에서 협력 다이버시티를 위한 전력인지 릴레이 선택 알고리즘)

  • Xiang, Gao;Park, Hyung-Kun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10A
    • /
    • pp.752-759
    • /
    • 2009
  • Cooperative diversity is an effective technique to combat multi-path fading. When this technique is applied to energy-constrained wireless sensor networks, it is a key issue to design appropriate relay selection and power allocation strategies. In this paper, we proposed a new multi-relay selection and power allocation algorithm to maximize network lifetime. The algorithm are composed of two relay selection stages, where the channel condition and residual power of each node were considered in multi-relay selection and the power is fairly allocated proportional to the residual power, satisfies the required SNR at destination and minimizes the total transmit power. In this paper, proposed algorithm is based on AF (amplify and forward) model. We evaluated the proposed algorithm by using extensive simulation and simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.

Performance of Overlay Cognitive Radio NOMA Systems with Selected Relay for Non-licensed Receiver (비면허 수신기를 위한 선택 릴레이를 갖는 오버레이 상황인지 NOMA 시스템의 성능)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.39-45
    • /
    • 2019
  • Recently, Cognitive radio (CR) has been focused for the effective utilization of the limited spectrum. Since an overlay CR system shares the given spectrum with the unlicensed system simultaneously, its spectral efficiency is high. However, most of the studies on an overlay CR system have been focused on the performance enhancement of the licensed receiver (LR). Correspondingly, the performance of the unlicensed receiver (UR) is degraded. Therefore, we propose an overlay CR NOMA system to improve the performance both of the LR and UR, which has a selected relay for the UR and adjusts the power allocation for the LR. The analytical performance of the proposed system is derived and verified the results through simulation. It is noticed that the UR can be obtained signal-to-noise ratio (SNR) gains by the selected relay, consequently, the system performance can be improved. Also, we show that the performance of the proposed system can be controlled by the number of the relays as well as the power allocation ratio. The results reveal that the required performance of the system can be satisfied with the use of the selected relay under the limited transmit power.

A Relay Selection Scheme with Q-Learning (Q-Learning을 이용한 릴레이 선택 기법)

  • Jung, Hong-Kyu;Kim, Kwang-Yul;Shin, Yo-An
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.6
    • /
    • pp.39-47
    • /
    • 2012
  • As a scheme to efficiently reduce the effects of multipath fading in next generation wireless communication systems, cooperative communication systems have recently come into the spotlight. Since these cooperative communication systems use cooperative relays with diverse fading coefficients to transmit information, having all relays participate in cooperative communication may result in unnecessary waste of resources, and thus relay selection schemes are required to efficiently use wireless resources. In this paper, we propose an efficient relay selection scheme through self-learning in cooperative wireless networks using Q-learning algorithm. In this scheme, we define states, actions and two rewards to achieve good SER (Symbol Error Rate) performance, while selecting a small number of cooperative relays. When these parameters are well-defined, we can obtain good performance. For demonstrating the superiority of the proposed Q-learning, We compared the proposed scheme with Q-learning and a relay selection scheme with a mathematical analysis. The simulation results show that, compared to a scheme that obtains optimum relays through a mathematical analysis, the proposed scheme uses resources efficiently by using smaller numbers of relays with comparable SER performance. According to these simulation results, the proposed scheme can be considered as a good attempt for future wireless communication.

BER Performance of SEP-based Selection Relaying in Cooperative Communications (협력통신에서 SEP 기반의 선택적 릴레이의 BER 성능)

  • Kong, Hyung-Yun;Choi, Dae-Kyu
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.1
    • /
    • pp.83-88
    • /
    • 2009
  • Selection relaying(SR) is usually based on signal-to-noise ratio(SNR) to decide whether or not to forward recovered symbols. However, instantaneous noise at relay is ignored, leading to the risk of erroneous retransmission induced by the relay that can be detrimental to the eventual detection of symbols at destination. To overcome this problem, we propose using new symbol error probability(SEP) related directly to reliability of received symbols instead of SNR. Simulation results show that the proposed SEP-based SR is considerably better than the conventional SNR-based SR under any relay position and threshold.

Distributive V2V Multi-hop Pre-caching scheme based on bidirectional vehicle mobility information in CCVNs (콘텐츠 중심 차량 네트워크에서 차량의 양방향 이동성 정보를 기반한 다중 홉 차량 분산 사전 캐싱 기법)

  • Min-Kyu Kim;Tae-Hyun Kim;Geon-Yong Shim;Ga-Yeong Kim;Eui-Sin Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.113-114
    • /
    • 2023
  • 본 논문은 다양한 방향성과 멀티 홉을 고려하여 최적의 콘텐츠 제공을 위한 릴레이 차량 선택 방안을 제안한다. 도로변 기지국의 제한성으로 인해 자율 주행 차량에 탑승한 승객들이 콘텐츠를 충분히 전달받는 데에 있어서, 지연시간과 버퍼링 등의 문제가 발생할 수 있다. 따라서, 도로변 기지국의 보조를 위하여 주위의 다른 차량들을 활용하여 요청된 콘텐츠를 원활하게 제공할 수 있다. 하지만, 기존 방안들은 한 대 또는 너무 많은 차량을 무분별하게 선택함으로써 최적화된 성능을 도출할 수 없었다. 그러므로, 본 논문은 요청 차량과 같은 방향으로 이동하는 1 차 릴레이 차량을 선발하는 데에 있어서 반대쪽에서 오는 2 차 릴레이 차량의 사전 캐싱량을 활용하는 방안을 제안한다. 1차 릴레이 차량의 충분한 요청 차량과의 연결 시간에 비교하여 부족한 사전 캐싱량을 2 차 릴레이 차량들로 보충함으로써 지연시간과 버려지는 패킷을 최소화할 수 있다.

Energy Efficient Relay Selection in a Multi-hop Ad-hoc Environment (다중홉 Ad-hoc 환경에서 에너지 효율적인 릴레이 선택 방안)

  • Jung, Hae-Beom;Kim, Song-Hee;Kim, Duk-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5B
    • /
    • pp.327-337
    • /
    • 2012
  • There have been lots of researches on the optimal relay selection in relay-based systems. However, most researches have been focused on the maximization of transmission capacity with a constraint of sum power at both transmitter and relays. In Ad-hoc networks where relays have batteries of limited power, it is imperative to minimize the energy consumption while maintaining the required quality-of-service (QoS). In this paper, we propose an optimal relay selection strategy to minimize the relay power consumption while satisfying the required signal-to-noise ratio (SNR). Through intensive simulations, we show the proposed method is more effective in terms of energy consumption and guarantee lower transmission failure probability in multi-hop Ad-hoc environments.

Opportunistic Transmit Cognitive Radio Relay Systems with CSI Delay (CSI 지연을 갖는 기회전송 상황 인지 릴레이 시스템)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.39-44
    • /
    • 2010
  • In this paper, we analyze the performance of the cooperative cognitive radio relay system which is adapted the recently highly focused cognitive radio system. The performance comparison is made between the system with and that without the opportunistic transmission relay. Especially the selection combining is considered at the destination for simple implementation. In this case, the effect of the channel state information (CSI) delay, which is caused essentially by the process during the CSI delivery, to the system performance is considered. It is noticed that the performance of the system with the opportunistic relay degrades up to 0.6 dB at a given condition compared to the system without the opportunistic relay. And it is shown that the system performance is more sensitive to the CSI delay compared to the frequency acquisition probability of the cognitive radio relay.

Farthest-k relay selection algorithm for efficient D2D message dissemination (효율적인 D2D 메시지 확산을 위한 최외곽 k개의 릴레이 선택 알고리즘)

  • Han, Seho;Lee, Howon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.3
    • /
    • pp.543-548
    • /
    • 2017
  • In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.