• Title/Summary/Keyword: Relay Selection

Search Result 267, Processing Time 0.029 seconds

Power Allocation for Opportunistic Full-Duplex based Relay Selection in Cooperative Systems

  • Zhong, Bin;Zhang, Dandan;Zhang, Zhongshan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3908-3920
    • /
    • 2015
  • In this paper, performance analysis of full-duplex (FD) relay selection under decode-and-forward (DF) relaying mode is carried out by taking into account several critical factors, including the distributions of the received signal-to-noise ratio (SNR) and the outage probability of wireless links. The tradeoff between the FD and half-duplex (HD) modes for relay selection techniques is also analyzed, where the former suffers from the impact of residual self-interference, but the latter requires more channel resources than the former (i.e., two orthogonal channels are required). Furthermore, the impact of optimal power allocation (OPA) on the proposed relay-selection scheme is analyzed. Particularly, the exact closed-form expressions for outage probability of the proposed scheme over Rayleigh fading channels are derived, followed by validating the proposed analysis using simulation. Numerical results show that the proposed FD based scheme outperforms the HD based scheme by more than 4 dB in terms of coding gain, provided that the residual self-interference level in the FD mode can be substantially suppressed to the level that is below the noise power.

A distributed relay selection algorithm for two-hop wireless body area networks

  • Kim, Seung-Ku;Joo, Yang-Ick
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.41 no.2
    • /
    • pp.156-162
    • /
    • 2017
  • This paper investigates two-hop extension communication in wireless body area networks. Many previous studies have demonstrated that two-hop extended topology outperforms single-hop topology. Although many researchers have proposed using two-hop extension communication to improve link reliability, no one has considered using a relay selection algorithm or provided a suitable solution for wireless body area networks. The design goal of the proposed algorithm is selecting a proper relay node to retransmit failed packets distributively. The proposed algorithm configures the carrier sensing period to choose one relay node promptly without requiring additional interaction. We analyze the link conditions corresponding to various body postures and investigate which factors are proper to determine the carrier sensing period. The empirical results show that the proposed algorithm reduces the expected number of transmissions required to deliver a packet successfully.

An Efficient Channel Estimation for Amplify and Forward Cooperative Diversity with Relay Selection

  • Jeong, Hyun-Doo;Lee, Jae-Hong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.94-98
    • /
    • 2009
  • In this paper, we propose a new channel estimation scheme for amplify and forward cooperative diversity with relay selection. In order to select best relay, it is necessary to know channel state information (CSI) at the destination. Most of the previous works, however, assume that perfect CSI is available at the destination. In addition, when the number of relay is increased it is difficult to estimate CSI through all relays within coherence time of a channel because of the large amount of frame overhead for channel estimation. In a proposed channel estimation scheme, each terminal has distinct pilot signal which is orthogonal each other. By using orthogonal property of pilot signals, CSI is estimated over two pilot signal transmission phases so that frame overhead is reduced significantly. Due to the orthogonal property among pilot signals, estimation error does not depend on the number of relays. Simulation result shows that the proposed channel estimation scheme provides accurate CSI at the destination.

  • PDF

Optimal Duplex Selection for Decode and Forward Relay Systems with Power Allocation

  • Kwon, Taehoon;Lim, Sungmook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5347-5360
    • /
    • 2016
  • In decode and forward relay systems, choosing the duplex mode is an important factor to the performance. To satisfy the performance requirement, self-interference must be mitigated for the full-duplex relay (FDR), and the resource efficiency must be increased for the half-duplex ratio (HDR). Therefore, if a wise scheme to consider these two factors exists, decode and forward relay systems are used more effectively. This study proposes a new duplex selection scheme for decode and forward relay systems. The proposed duplex selection scheme chooses the better duplex mode according to the channel statistical conditions with optimal power allocation. The simulation results show that the proposed duplex scheme with optimal power allocation has lower outage probability than the FDR and the HDR.

Performance Analysis of Adaptive Link-Selection Scheme considering Buffer and Channel State Information (버퍼와 채널 상태를 고려한 적응형 링크선택 방안의 성능 분석)

  • Kim, Hyujun;Chung, Young-uk
    • Journal of IKEEE
    • /
    • v.22 no.2
    • /
    • pp.402-407
    • /
    • 2018
  • Link selection strategy has been an important technical issues of relay network. In this paper, we introduce a link selection scheme in the bidirectional, buffer-aided relay network. Three kinds of information such as the states of the queue at the relay buffer, the qualities of the links, and the states of the queues at the user buffer are considered. Throughput and delay performance is evaluated under three cases with different available information.

A Cooperative Transmission Strategy using Entropy-based Relay Selection in Mobile Ad-hoc Wireless Sensor Networks with Rayleigh Fading Environments

  • An, Beong-Ku;Duy, Tran Trung;Kong, Hyung-Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.147-162
    • /
    • 2009
  • In this paper, we propose a Cooperative Transmission Strategy using Entropy-based Relay Selection in Mobile Ad-hoc Wireless Sensor Networks(MAWSN) with Rayleigh Fading Environments. The main features and contributions of the proposed cooperative transmission strategy are as follows. First, entropy-based relay selection is used to improve data transmission reliability from a source node to a destination node. Second, we present a theoretical analysis model for the proposed cooperative transmission strategy with the outage probability of the end-to-end performance. The performance of our protocol is evaluated using analysis and simulation.

Resilient Routing Overlay Network Construction with Super-Relay Nodes

  • Tian, Shengwen;Liao, Jianxin;Li, Tonghong;Wang, Jingyu;Cui, Guanghai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1911-1930
    • /
    • 2017
  • Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.

Exact and Approximate Symbol Error Probability of cooperative systems with best relay selection and all participating relaying using Amplify and Forward or Decode and Forward Relaying over Nakagami-m fading channels

  • Halima, Nadhir Ben;Boujemaa, Hatem
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.81-108
    • /
    • 2018
  • In this paper, we derive the theoretical Symbol Error Probability (SEP) of cooperative systems with best relay selection for Nakagami-m fading channels. For Amplify and Forward (AF) relaying, the selected relay offers the best instantaneous Signal to Noise Ratio (SNR) of the relaying link (source-relay-destination). In cooperative networks using Decode and Forward (DF), the selected relay offers the best instantaneous SNR of the link between the relay and the destination among the relays that have correctly decoded the transmitted information by the source. In the second part of the paper, we derive the SEP when all participating AF and DF relaying is performed. In the last part of the paper, we extend our results to cognitive radio networks where there is interference constraints : only relays that generate interference to primary receiver lower than a predefined threshold T can transmit. Both AF and DF relaying with and without relay selection are considered.

Network Coding and Relay Selection for a Bidirectional Ship-to-Ship Relay Communication System (양방향 선박-대-선박 릴레이 통신 시스템을 위한 네트워크 부호화와 릴레이 선택)

  • Do, Thinh Phu;Jeong, Hyun Woo;Jung, Min-A;Kim, Yun Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1420-1423
    • /
    • 2015
  • This letter considers a ship-to-ship communication system in which two ships exchange their information with the help of multiple relay ships. For the system, we propose a novel relay scheme that allows relay ships to select a method between analog network coding (ANC) and digital network coding (DNC) adaptively based on channel state information. We also provide a relay selection criterion in supporting the proposed adaptive network coding. The simulation results show that the proposed scheme outperforms the conventional scheme employing only the ANC or only the DNC.

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.