• 제목/요약/키워드: Relay selection

검색결과 268건 처리시간 0.029초

Relay Selection Scheme Based on Quantum Differential Evolution Algorithm in Relay Networks

  • Gao, Hongyuan;Zhang, Shibo;Du, Yanan;Wang, Yu;Diao, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권7호
    • /
    • pp.3501-3523
    • /
    • 2017
  • It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.

Slotted ALOHA Based Greedy Relay Selection in Large-scale Wireless Networks

  • Ouyang, Fengchen;Ge, Jianhua;Gong, Fengkui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권10호
    • /
    • pp.3945-3964
    • /
    • 2015
  • Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.

Trust-based Relay Selection in Relay-based Networks

  • Wu, Di;Zhu, Gang;Zhu, Li;Ai, Bo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권10호
    • /
    • pp.2587-2600
    • /
    • 2012
  • It has been demonstrated that choosing an appropriate relay node can improve the transmission rate for the system. However, such system improvement brought by the relay selection may be degraded with the presence of the malicious relay nodes, which are selected but refuse to cooperate for transmissions deliberately. In this paper, we formulate the relay selection issue as a restless bandit problem with the objective to maximize the average rate, while considering the credibility of each relay node, which may be different at each time instant. Then the optimization problem is solved by using the priority-index heuristic method effectively. Furthermore, a low complexity algorithm is offered in order to facilitate the practical implementations. Simulation results are conducted to demonstrate the effectiveness of the proposed trust-based relay selection scheme.

Quantum Bee Colony Optimization and Non-dominated Sorting Quantum Bee Colony Optimization Based Multi-relay Selection Scheme

  • Ji, Qiang;Zhang, Shifeng;Zhao, Haoguang;Zhang, Tiankui;Cao, Jinlong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권9호
    • /
    • pp.4357-4378
    • /
    • 2017
  • In cooperative multi-relay networks, the relay nodes which are selected are very important to the system performance. How to choose the best cooperative relay nodes is an optimization problem. In this paper, multi-relay selection schemes which consider either single objective or multi-objective are proposed based on evolutionary algorithms. Firstly, the single objective optimization problems of multi-relay selection considering signal to noise ratio (SNR) or power efficiency maximization are solved based on the quantum bee colony optimization (QBCO). Then the multi-objective optimization problems of multi-relay selection considering SNR maximization and power consumption minimization (two contradictive objectives) or SNR maximization and power efficiency maximization (also two contradictive objectives) are solved based on non-dominated sorting quantum bee colony optimization (NSQBCO), which can obtain the Pareto front solutions considering two contradictive objectives simultaneously. Simulation results show that QBCO based multi-relay selection schemes have the ability to search global optimal solution compared with other multi-relay selection schemes in literature, while NSQBCO based multi-relay selection schemes can obtain the same Pareto front solutions as exhaustive search when the number of relays is not very large. When the number of relays is very large, exhaustive search cannot be used due to complexity but NSQBCO based multi-relay selection schemes can still be used to solve the problems. All simulation results demonstrate the effectiveness of the proposed schemes.

Distributed Relay Selection Algorithm for Cooperative Communication

  • Oo, Thant Zin;Hong, Choong-Seon
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(D)
    • /
    • pp.213-214
    • /
    • 2011
  • This paper presents a distributed relay selection algorithm for cooperative communication. The algorithm separates the decision making into two simple steps, decision making for employing cooperative communication and decision making for relay selection.

Energy-efficient Buffer-aided Optimal Relay Selection Scheme with Power Adaptation and Inter-relay Interference Cancellation

  • Xu, Xiaorong;Li, Liang;Yao, Yingbiao;Jiang, Xianyang;Hu, Sanqing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권11호
    • /
    • pp.5343-5364
    • /
    • 2016
  • Considering the tradeoff between energy consumption and outage behavior in buffer-aided relay selection, a novel energy-efficient buffer-aided optimal relay selection scheme with power adaptation and Inter-Relay Interference (IRI) cancellation is proposed. In the proposed scheme, energy consumption minimization is the objective with the consideration of relay buffer state, outage probability and relay power control, in order to eliminate IRI. The proposed scheme selects a pair of optimal relays from multiple candidate relays, denoted as optimal receive relay and optimal transmit relay respectively. Source-relay and relay-destination communications can be performed within a time-slot, which performs as Full-Duplex (FD) relaying. Markov chain model is applied to analyze the evolution of relay buffer states. System steady state outage probability and achievable diversity order are derived respectively. In addition, packet transmission delay and power reduction performance are investigated with a specific analysis. Numerical results show that the proposed scheme outperforms other relay selection schemes in terms of outage behavior with power adaptation and IRI cancellation in the same relay number and buffer size scenario. Compared with Buffer State relay selection method, the proposed scheme reduces transmission delay significantly with the same amount of relays. Average transmit power reduction can be implemented to relays with the increasing of relay number and buffer size, which realizes the tradeoff between energy-efficiency, outage behavior and delay performance in green cooperative communications.

Mobile-Based Relay Selection Schemes for Multi-Hop Cellular Networks

  • Zhang, Hao;Hong, Peilin;Xue, Kaiping
    • Journal of Communications and Networks
    • /
    • 제15권1호
    • /
    • pp.45-53
    • /
    • 2013
  • Multi-hop cellular networks (MCNs), which reduce the transmit power, mitigate the inter-cell interference, and improve the system performance, have been widely studied nowadays. The relay selection scheme is a key technique that achieves these advantages, and inappropriate relay selection causes frequent relay switchings, which deteriorates the overall performance. In this study, we analyze the conditions for relay switching in MCNs and obtain the expressions for the relay switching rate and relay activation time. Two mobile-based relay selection schemes are proposed on the basis of this analysis. These schemes select the relay node with the longest relay activation time and minimal relay switching rate through mobility prediction of the mobile node requiring relay and available relay nodes. We compare the system performances via simulation and analyze the impact of various parameters on the system performance. The results show that the two proposed schemes can obtain a lower relay switching rate and longer relay activation time when there is no reduction in the system throughput as compared with the existing schemes.

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

  • 김남수
    • 한국인터넷방송통신학회논문지
    • /
    • 제11권6호
    • /
    • pp.15-21
    • /
    • 2011
  • 애드혹 네트워크에서는 협동 다이버시티를 적용하여 네트워크의 전력소모를 줄이고, 통달거리의 확장 및 시스템의 성능을 향상시키고 있다. 그러나 가장 큰 신호 대 잡음비(SNR, Signal-to-noise ratio)을 갖는 릴레이를 선택하여 송신하는 선택 릴레이 협동 다이버시티 방식은 느린 페이딩 채널에서 특정 릴레이가 계속 송신하므로 네트워크의 생존시간을 줄이게 된다. 그러므로 최근에 네트워크의 생존 시간을 늘이기 위하여 균일전력 릴레이 선택방식이 연구되었다. 본 논문에서는 소스-릴레이 및 릴레이-목적지간의 수신 신호 대 잡음비가 일정수준 이상이 되는 릴레이를 선택하여 송신할 수 있는 하는 이중 기회전송 협동 다이버시티(DOT, Double opportunistic cooperative diversity) 시스템에 균일전력 릴레이 선택방식을 적용하고 시스템의 성능을 유도하였다. 유도한 결과는 선택결합(SC, Selection combining) 방식과 최대비 합성결합(MRC, Maximal ratio combining) 방식과 비교하였다. 균일전력 릴레이 방식을 사용하였을 때 다른 방식에 비해서 시스템의 성능저하가 있었는데, 이는 네트워크의 생존 시간을 늘이기 위해서 릴레이에 균일한 송신기회를 주었기 때문으로 해석되었다.

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)
    • /
    • 제5권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).

성능향상을 위한 네트워크 부호화 기반 양방향 중계기 통신에서의 릴레이 선택 기법 (Relay Selection Schemes in Network-Coding based Two-Way Relay Communication to Improve Performance)

  • 이진희;공형윤
    • 한국인터넷방송통신학회논문지
    • /
    • 제9권5호
    • /
    • pp.7-13
    • /
    • 2009
  • 본 논문에서는 다수의 릴레이(Relay)가 존재하는 환경에서 네트워크 부호화 기반 양방향 중계기 통신의 릴레이 선택 기법을 제안한다. 양방향 중계기 통신은 두 사용자가 릴레이의 도움을 받아 서로의 데이터를 교환하는 통신 방법이다. 네트워크 부호화 기반 양방향 중계기 통신은 기존의 양방향 통신에 비해 데이터 전송에 필요한 시간을 줄임으로써 더 높은 전송량을 얻을 수 있다. 본 논문에서는 다수의 릴레이가 존재하는 환경을 고려하며, 순시 신호 대 잡음비를 기준으로 최대의 성능을 가지는 릴레이를 선택하는 방법을 제안한다. 모의실험을 통하여 제안한 릴레이 선택 기법이 릴레이 개수에 따른 다이버시티 이득을 얻을 수 있음을 보인다.

  • PDF