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

검색결과 307건 처리시간 0.023초

증폭 후 전달 릴레이 시스템을 위한 송신 Maximum-Ratio-Combining과 릴레이 선택 다이버시티에 대한 Outage 확률 분석 (Outage Probability of Transmit Maximum-Ratio-Combining and Relay Selection Diversity for Amplify-and-Forward Relaying System)

  • 민현기;이성은;홍대식
    • 대한전자공학회논문지TC
    • /
    • 제45권2호
    • /
    • pp.13-18
    • /
    • 2008
  • 본 논문에서는 M 개의 전송 안테나를 가진 송신국(source)이 단일 안테나를 가진 R 개의 릴레이(relay)를 이용하여 단일 안테나를 가진 수신국(destination)에 신호를 전송하는 증폭 후 전달(amplify-and-forward, AF) 릴레이 시스템에서의 outage 확률 성능을 살펴본다. 이때, R 개의 릴레이 중에서 수신국에서의 수신 신호에 대한 가장 큰 신호 대 잡음비(signal-to-noise ratio, SNR)를 보장하는 하나의 릴레이를 선택하는 최적 릴레이 선택(best relay selection) 기법이 사용되고, 송신국과 선택된 릴레이 링크에서 송신 maximum-ratio-combining(transmit MRC)이 적용되었을 때의 AF 릴레이 시스템의 outage 확률을 분석한다. 또한, 분석의 타당성을 입증하기 위해 모의실험들을 제공한다.

레일레이 페이딩 채널을 고려한 듀얼 홉 디코딩 후 전달 중계 시스템에서 부분 중계 노드 선택 기법의 정확한 비트 오차율 분석 (Exact Bit Error Rate Analysis of Partial Relay Selection in Dual-Hop Decode-and-Forward Relaying Systems over Rayleigh Fading Channels)

  • 이상준;이인호
    • 한국정보통신학회논문지
    • /
    • 제18권1호
    • /
    • pp.42-49
    • /
    • 2014
  • 듀얼 홉 시스템에서 기존의 두 홉에 대한 채널 정보를 이용하여 가장 좋은 성능을 나타내는 중계 노드 선택 기법은 채널 피드백을 위한 자원의 소모가 크다. 본 논문에서는 듀얼 홉 디코딩 후 전달 중계 시스템에서 첫 번째 홉에 대한 채널 정보만을 필요로 하는 부분 중계 노드 선택 기법을 이용하여 정확한 평균 비트 오차율을 분석한다. 이 때, 독립적인 레일레이 페이딩 채널을 가정하여 M-ary QAM에 대한 정확한 비트 오차율의 표현식을 유도한다. 또한, 수치적 결과를 통해 두 홉에 대한 채널 정보를 이용하여 가장 좋은 성능을 나타내는 중계 노드 선택 기법과 부분 중계 노드 선택 기법에 대한 성능을 비교한다. 여기서, 중계 노드의 수와 첫 번째 홉과 두 번째 홉 간 평균 채널 전력비를 다양하게 가정하여 평균 비트 오차율을 분석한다.

Swarm Intelligence-based Power Allocation and Relay Selection Algorithm for wireless cooperative network

  • Xing, Yaxin;Chen, Yueyun;Lv, Chen;Gong, Zheng;Xu, Ling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1111-1130
    • /
    • 2016
  • Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.

Decode-and-Forward Relaying Systems with Nth Best-Relay Selection over Rayleigh Fading Channels

  • Duy, Tran Trung;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • 제12권1호
    • /
    • pp.8-12
    • /
    • 2012
  • In this paper, we evaluate performances of dual-hop decode-and-forward relaying systems with the $N^{th}$ best-relay selection scheme. In some schemes, such as scheduling or load balancing schemes, the best relay is unavailable and hence the system must resort the second best, third best, or generally the $N^{th}$ best relay. We derive the expressions of the outage probability and symbol error rate (SER) for this scenario over Rayleigh fading channels. Monte-Carlo simulations are presented to verify the analytical results.

Joint Relay Selection and Resource Allocation for Cooperative OFDMA Network

  • Lv, Linshu;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권11호
    • /
    • pp.3008-3025
    • /
    • 2012
  • In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

The Admissible Multiperiod Mean Variance Portfolio Selection Problem with Cardinality Constraints

  • Zhang, Peng;Li, Bing
    • Industrial Engineering and Management Systems
    • /
    • 제16권1호
    • /
    • pp.118-128
    • /
    • 2017
  • Uncertain factors in finical markets make the prediction of future returns and risk of asset much difficult. In this paper, a model,assuming the admissible errors on expected returns and risks of assets, assisted in the multiperiod mean variance portfolio selection problem is built. The model considers transaction costs, upper bound on borrowing risk-free asset constraints, cardinality constraints and threshold constraints. Cardinality constraints limit the number of assets to be held in an efficient portfolio. At the same time, threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Because of these limitations, the proposed model is a mix integer dynamic optimization problem with path dependence. The forward dynamic programming method is designed to obtain the optimal portfolio strategy. Finally, to evaluate the model, our result of a meaning example is compared to the terminal wealth under different constraints.

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

  • Jeong, Hyun-Doo;Lee, Jae-Hong
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2009년도 IWAIT
    • /
    • 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 Power Allocation and Relay Selection for Cognitive Relay Networks using Non-orthogonal Cooperative Protocol

  • Lan, Peng;Chen, Lizhen;Zhang, Guowei;Sun, Fenggang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.2047-2066
    • /
    • 2016
  • In this paper, we investigate joint power allocation and relay selection (PARS) schemes in non-orthogonal cooperative protocol (NOCP) based cognitive relay networks. Generally, NOCP outperforms the orthogonal cooperative protocol (OCP), since it can provide more transmit diversity. However, most existing PARS schemes in cognitive relay networks focus on OCP, which are not suitable for NOCP. In the context of NOCP, we first derive the joint constraints of transmit power limit for secondary user (SU) and interference constraint for primary user (PU). Then we formulate optimization problems under the aforementioned constraints to maximize the capacity of SU in amplify-and-forward (AF) and decode-and-forward (DF) modes, respectively. Correspondingly, we derive the closed form solutions with respect to different parameters. Numerical results are provided to verify the performance improvement of the proposed PARS schemes.

한국형 기동무기체계 양산비 비용추정관계식 개발에 관한 연구 (A Study on Developing a CER Using Production Cost Data in Korean Maneuver Weapon System)

  • 이두현;김각규
    • 한국경영과학회지
    • /
    • 제39권3호
    • /
    • pp.51-61
    • /
    • 2014
  • In this paper, we deal with developing a cost estimation relationships (CER) for Korean maneuverable weapons systems using historical production cost. To develop the CER, we collected the historical data of the production cost of four tanks and five armored vehicles. We also analyzed the Required Operational Capability (ROC) of the weapons systems and chose cost drivers that can compare operational capabilities of the weapons systems We used Forward selection, Backward selection, Stepwise Regression and $R^2$ selection as the cost drivers which have the greatest influence with the dependent variables. And we used Principle Component Regression, Robust Regression and Weighted Regression to deal with multicollinearity and outlier among the data to develop a more appropriate CER. As a result, we were able to develop a production cost CER for Korean maneuverable weapons systems that have the lowest cost errors. Thus, this research is meaningful in terms of developing a CER based on Korean original cost data without foreign data and these methods will contribute to developing a Korean cost analysis program in the future.

Joint Relay Selection and Power Allocation for Two-way Relay Channels with Asymmetric Traffic Requirements

  • Lou, Sijia;Yang, Longxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권8호
    • /
    • pp.1955-1971
    • /
    • 2013
  • This paper studies relay selection and power allocation for amplify-and-forward (AF) based two-way relay networks (TWRN) with asymmetric traffic requirements (ATR). A joint relay selection and power allocation algorithm is proposed to decrease the outage probability of TWRN with ATR. In this algorithm, two sources exchange information with the help of the relay during two time slots. We first calculate the optimal power allocation parameters based on instantaneous channel state information (CSI), and then derive a tight lower bound of outage probability. Furthermore, we propose a simplified relay selection criterion, which can be easily calculated as harmonic mean of instantaneous channel gains, according to the outage probability expressions. Simulation results verified the theoretical analyses we presented. It is shown that the outage probability of our algorithm improves 3-4dB comparing with that of other existing algorithms, and the lower bound is tight comparing with actual value for the entire signal-to-noise ratio (SNR) region.