• Journal of Communications and Networks
• /
• v.15 no.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.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.84-92
• /
• 2015

Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

• ETRI Journal
• /
• v.35 no.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.

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

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.266-275
• /
• 2013

The exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decode-and-forward (DF) relay networks in non-identical Rayleigh fading channels are derived. We also provide the approximate closed-form expression for the system ergodic capacity. Utilizing these tractable analytical formulas, we can study the impact of key network parameters on the performance of cognitive multi-hop relay networks under interference constraints. Using a linear network model, we derive an optimum relay position scheme by numerically solving an optimization problem of balancing average signal-to-noise ratio (SNR) of each hop. The numerical results show that the optimal scheme leads to SNR performance gains of more than 1 dB. All the analytical expressions are verified by Monte-Carlo simulations confirming the advantage of multihop DF relaying networks in cognitive environments.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.19-26
• /
• 2016

In this paper, the performance of dual-hop multi-relay maximum ratio transmission (MRT) over Rayleigh flat fading channels is studied with both conventional (all relays participate the transmission) and opportunistic (best relay is selected to maximize the received signal-to-noise ratio (SNR)) relaying. Performance analysis starts with the derivation of the probability density function, cumulative distribution function and moment generating function of the SNR. Then, both approximate and asymptotic expressions of symbol error rate (SER) and outage probability are derived for arbitrary numbers of antennas and relays. With the help of asymptotic SER and outage probability, diversity and array gains are obtained. In addition, impact of imperfect channel estimations is investigated and optimum power allocation factors for source and relay are calculated. Our analytical findings are validated by numerical examples which indicate that multi-relay MRT can be a low complexity and reliable option in cooperative networks.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.6
• /
• pp.671-676
• /
• 2015

Cooperative networks eliminate shadow area using relay and enhance communication performance by creating virtual multi input multi output (MIMO) system. In this paper, we analyze the performance of cooperative networks which use coherent modulation scheme in source-relay nodes and differential modulation scheme in relay-destination nodes depending on the relay location. We consider the performance analysis of systems with and without the direct transmission between source and destination node where the direct transmission adopts differential modulation scheme. In addition, the performance of the system with fully differential modulation scheme is compared with the system using partially differential modulation scheme. The performance of system is based on the symbol error rate between source and destination node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.566-578
• /
• 2018

In this paper, we design a segment training based individual channel estimation (STICE) scheme for the classical two-way relay network (TWRN) with multi-pair sources (MPS) and amplify-and-forward (AF). We adopt the linear minimum mean square error (LMMSE) channel estimator to minimize the mean square error (MSE) without channel estimation error, where the optimal power allocation strategy from the relay for different sources is obtained. Then the MSE gains are given with different source pairs among the proposed power allocation scheme and the existing power allocation schemes. Numerical results show that the proposed method outperforms the existing ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3789-3808
• /
• 2017

This paper studies a multi-antenna wireless relay network in the presence of a jammer. In this network, the source node transmits signals to the destination node through a multi-antenna relay node which adopts the amplify-and-forward scheme, and the jammer attempts to inject additive signals on all antennas of the relay node. With the linear beamforming scheme at the relay node, this network can be modeled as an equivalent Gaussian arbitrarily varying channel (GAVC). Based on this observation, we deduce the mathematical closed-forms of the capacities for two special cases and the suboptimal achievable rate for the general case, respectively. To reduce complexity, we further propose an optimal structure of the beamforming matrix. In addition, we present a second order cone programming (SOCP)-based algorithm to efficiently compute the optimal beamforming matrix so as to maximize the transmission rate between the source and the destination when the perfect channel state information (CSI) is available. Our numerical simulations show significant improvements of our propose scheme over other baseline ones.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.629-638
• /
• 2016

In this paper, we investigate an energy-efficient resource allocation problem in a two-way relay (TWR) network consisting of multiple user pairs and an amplify-and-forward (AF) relay. As the users and relay have individual energy efficiencies (EE), we formulate a multi-objective optimization problem (MOOP). A single-objective optimization problem (SOOP) of the MOOP is introduced using a weighted-sum method, which achieves a single Pareto optimal point of the MOOP. To derive the algorithm for the SOOP, we propose a more tractable equivalent problem using the Karush-Kuhn-Tucker conditions of the SOOP, which guarantees convergence at the local optimal points. The proposed equivalent problem can be efficiently solved by the proposed iterative algorithm. Numerical results demonstrate the effectiveness of the proposed algorithm in achieving the optimal EE in multi-user AF TWR networks.