• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.13-18
• /
• 2008

In this paper, we consider an amplifying-and-forward(AF) dual-hop relaying system where the source node transmits to a destination node with the help of R relay nodes. We assume that the source node equips M transmit antennas, but only one antenna is equipped at the each node of relay and destination. The outage probabilities are presented when the transmit maximum-ratio-combining(MRC) is used at the source-relay(S-R) links, and the best relay selection, which selects only one relay that contributes the most to the received signal-to-noise ratio(SNR) as active relay, is combined. Simulation results validate these analytical results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.42-49
• /
• 2014

The conventional best relay selection based on all the channel information for the first and second hops in dual-hop systems has a large consumption of resources for channel feedback. In this paper, we analyze the average bit error rate for partial relay selection based on the channel information only for the first hop in dual-hop decode-and-forward relaying systems, where we assume independent Rayleigh fading channels. In particular, we provide an exact and closed-form expression for the average bit error rate of M-ary QAM. Also, through numerical investigation, the performance of the partial relay selection is compared with the performance of the best relay selection, and the performance is evaluated for different numbers of relays and various average channel power ratios for the first and second hops.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.

• Journal of electromagnetic engineering and science
• /
• v.12 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.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.

• Industrial Engineering and Management Systems
• /
• v.16 no.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.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.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.