• 제목/요약/키워드: Optimal relay

검색결과 233건 처리시간 0.021초

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.

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.

Optimal Power Control in Cooperative Relay Networks Based on a Differential Game

  • Xu, Haitao;Zhou, Xianwei
    • ETRI Journal
    • /
    • 제36권2호
    • /
    • pp.280-285
    • /
    • 2014
  • In this paper, the optimal power control problem in a cooperative relay network is investigated and a new power control scheme is proposed based on a non-cooperative differential game. Optimal power allocated to each node for a relay is formulated using the Nash equilibrium in this paper, considering both the throughput and energy efficiency together. It is proved that the non-cooperative differential game algorithm is applicable and the optimal power level can be achieved.

적응진화연산을 이용한 배전계통의 과전류계전기 최적 정정치 결정 (Optimal Setting of Overcurrent Relay in Distribution Systems Using Adaptive Evolutionary Algorithm)

  • 정희명;이화석;박준호
    • 전기학회논문지
    • /
    • 제56권9호
    • /
    • pp.1521-1526
    • /
    • 2007
  • This paper presents the application of Adaptive Evolutionary Algorithm (AEA) to search an optimal setting of overcurrent relay coordination to protect ring distribution systems. The AEA takes the merits of both a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. The overcurrent relay settings and coordination requirements are formulated into a set of constraint equations and an objective function is developed to manage the overcurrent relay settings by the Time Coordination Method. The domain of overcurrent relays coordination for the ring-fed distribution systems is a non-linear system with a lot of local optimum points and a highly constrained optimization problem. Thus conventional methods fail in searching for the global optimum. AEA is employed to search for the optimum relay settings with maximum satisfaction of coordination constraints. The simulation results show that the proposed method can optimize the overcurrent relay settings, reduce relay mis-coordinated operations, and find better optimal overcurrent relay settings than the present available methods.

Optimal Diversity-Multiplexing Tradeoff of MIMO Multi-way Relay Channel

  • Su, Yuping;Li, Ying
    • ETRI Journal
    • /
    • 제35권5호
    • /
    • pp.919-922
    • /
    • 2013
  • A MIMO multi-way relay channel with full data exchange in which K users exchange messages with each other via the help of a single relay is considered. For the case in which each link is quasi-static Rayleigh fading and the relay is full-duplex, the fundamental diversity-multiplexing tradeoff (DMT) is investigated, and we show that a compress-and-forward relay protocol can achieve the optimal DMT.

Optimal Resource Planning with Interference Coordination for Relay-Based Cellular Networks

  • Kim, Taejoon;An, Kwanghoon;Yu, Heejung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5264-5281
    • /
    • 2017
  • Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.

Optimal Energy-Efficient Power Allocation and Outage Performance Analysis for Cognitive Multi-Antenna Relay Network Using Physical-Layer Network Coding

  • Liu, Jia;Zhu, Ying;Kang, GuiXia;Zhang, YiFan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권12호
    • /
    • pp.3018-3036
    • /
    • 2013
  • In this paper, we investigate power allocation scheme and outage performance for a physical-layer network coding (PNC) relay based secondary user (SU) communication in cognitive multi-antenna relay networks (CMRNs), in which two secondary transceivers exchange their information via a multi-antenna relay using PNC protocol. We propose an optimal energy-efficient power allocation (OE-PA) scheme to minimize total energy consumption per bit under the sum rate constraint and interference power threshold (IPT) constraints. A closed-form solution for optimal allocation of transmit power among the SU nodes, as well as the outage probability of the cognitive relay system, are then derived analytically and confirmed by numerical results. Numerical simulations demonstrate the PNC protocol has superiority in energy efficiency performance over conventional direct transmission protocol and Four-Time-Slot (4TS) Decode-and-Forward (DF) relay protocol, and the proposed system has the optimal outage performance when the relay is located at the center of two secondary transceivers.

Discrete-Time Gaussian Interfere-Relay Channel

  • Moon, Kiryang;Yoo, Do-Sik;Oh, Seong-Jun
    • Journal of Communications and Networks
    • /
    • 제18권3호
    • /
    • pp.299-310
    • /
    • 2016
  • In practical wireless relay communication systems, non-destination nodes are assumed to be idle not receiving signals while the relay sends messages to a particular destination node, which results in reduced bandwidth efficiency. To improve the bandwidth efficiency, we relax the idle assumption of non-destination nodes and assume that non-destination nodes may receive signals from sources. We note that the message relayed to a particular node in such a system gives rise to interference to other nodes. To study such a more general relay system, we consider, in this paper, a relay system in which the relay first listens to the source, then routes the source message to the destination, and finally produces interference to the destination in sending messages for other systems. We obtain capacity upper and lower bounds and study the optimal method to deal with the interference as well as the optimal routing schemes. From analytic results obtained, we find the conditions on which the direct transmission provides higher transmission rate. Next, we find the conditions, by numerical evaluation of the theoretical results, on which it is better for the destination to cancel and decode the interference. Also we find the optimal source power allocation scheme that achieves the lower bound depending on various channel conditions. We believe that the results provided in this paper will provide useful insights to system designers in strategically choosing the optimal routing algorithms depending on the channel conditions.

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

  • Kwon, Taehoon;Lim, Sungmook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권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 Decode-and-Forward Relaying Based on Optimal Relay Selection)

  • 이인호;김동우
    • 한국통신학회논문지
    • /
    • 제33권1A호
    • /
    • pp.36-43
    • /
    • 2008
  • 본 논문에서는 디코딩 후 전달 시스템을 위한 최적의 중계노드 선택방법을 제안한다. 그 최적의 중계노드 선택 방법은 디코딩 후 전달 시스템에서 신호 중계를 위해 사용되는 시간슬롯을 최소화하고 최종 신호 대 잡음비를 최대화한다. 그러나, 중계노드 선택을 위한 시스템의 오버 헤드가 요구된다. 독립적이고 동일한 레일레이 분포를 따르는 채널들을 가정하여, 제안된 최적의 중계노드 선택방법 기반의 디코딩 후 전달방식에 대한 용량 저하 확률과 평균 비트 오차율의 식들을 유도하고, 그 식들의 수치적 결과와 시뮬레이션 결과를 비교하여 수식들을 검증한다. 중계노드의 개수가 각각 2, 4, 8이고 오버 헤드에 대한 시간슬롯의 개수가 각각 1, 2, 4일 때, 제안된 방식은 기존의 디코딩 후 전달방식보다 1% 비트 오차율에서 각각 1 dB, 2 dB, 3 dB의 이득이 있고, 1 bps/Hz에 대한 1% 용량 저하 확률에서 각각 0.5 dB, 4 dB, 12 dB의 이득이 있다.