• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1016-1033
• /
• 2016

In this paper, we present a joint relay-and-antenna selection and power allocation strategy for multiple-input multi-output (MIMO) amplify-and-forward (AF) two-way relay networks (TWRNs). In our approach, we select the best transmit and receive antennas at the two sources, a best relay and a best transmit and receive antenna at the selected relay based on maximizing the minimum of the end-to-end received signal-to-noise-ratios (SNRs) under a total transmit power constraints. We obtained the closed-form solution for the optimal power allocation firstly. Then with the optimal allocation solution we found, we can reduce the joint relay-and-antenna selection to a simpler problem. Besides, the overall outage probability is investigated and a tight closed-form approximation is derived, which provides a method to evaluate the outage performance easily and fast. Simulation results are presented to verify the analysis.

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

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.118-127
• /
• 2007

We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to-end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay-to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end-to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.

• 한국통신학회논문지
• /
• 제35권6A호
• /
• pp.594-599
• /
• 2010

본 논문은 멀티홉 셀룰러 네트워크에서 릴레이 노드의 배치 위치가 하향링크 SINR에 미치는 영향을 분석한다. 분석 모델에서는 릴레이 노드가 셀 안쪽으로 배치되는 것과 인접한 두 셀의 경계지역에 배치되는 두 가지 시나리오를 가정한다. 본 논문에서는 위 두 가지 시나리오의 하향링크 SINR을 비교 분석하기 위한 수학적 모델을 도출한다. 제안하는 수학적 모델에서는 멀티-셀 구조 및 셀 간 간섭 등을 고려한다. 수학적 분석 결과는 릴레이 노드들을 셀 안쪽에 배치하는 경우에 셀 간 간섭의 증가에도 불구하고 수신 신호 세기의 증가로 인해 릴레이 노드들을 셀 경계에 배치하는 경우에 비해 SINR이 증가함을 보인다.

• 한국전자통신학회논문지
• /
• 제11권1호
• /
• pp.17-22
• /
• 2016

중계 네트워크에서는 중계기를 이용하여 송신기로 수신된 신호를 증폭 혹은 복조 후 재변조하여 수신기로 전송하는 역할을 수행한다. 수신기에서는 여러 중계기로부터 수신된 신호를 결합하여 신호를 복조함으로써 통신 성능을 향상 시킬 수 있다. 본 논문에서는 철도환경에서 에너지 할당에 따른 중계 네트워크의 성능을 분석한다. 변조방식은 중계기에서는 동기방식을 사용하고 수신기에서는 비동기 방식을 사용하는 부분차등변조 방식을 적용한다. 중계 네트워크에서 주어진 전체 에너지에 대해 수신기와 중계기의 다양한 에너지 할당에 따른 성능을 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4623-4643
• /
• 2015

This paper considers physical-layer security protocols in multicast cognitive radio (CR) networks. In particular, we propose dual-hop cooperative decode-and-forward (DF) and randomize-and-forward (RF) schemes using partial relay selection method to enhance secrecy performance for secondary networks. In the DF protocol, the secondary relay would use same codebook with the secondary source to forward the source's signals to the secondary destination. Hence, the secondary eavesdropper can employ either maximal-ratio combining (MRC) or selection combining (SC) to combine signals received from the source and the selected relay. In RF protocol, different codebooks are used by the source and the relay to forward the source message secretly. For each scheme, we derive exact and asymptotic closed-form expressions of secrecy outage probability (SOP), non-zero secrecy capacity probability (NzSCP) in both independent and identically distributed (i.i.d.) and independent but non-identically distributed (i.n.i.d.) networks. Moreover, we also give a unified formula in an integral form for average secrecy capacity (ASC). Finally, our derivations are then validated by Monte-Carlo simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권3호
• /
• pp.1301-1312
• /
• 2020

Using decode-and-forward relaying in the cognitive radio networks, the spectrum efficiency can improve furthermore. The optimization algorithm of the spectrum sensing estimation time is presented for the cognitive relay networks in this paper. The longer sensing time will bring two aspects of the consequences. On the one hand, the channel parameters are estimated more accurate so as to reduce the interferences to the authorized users and to improve the throughput of the cognitive users. On the other hand, it shortens the transmission time so as to decease the system throughput. In this time, it exists an optimal sensing time to maximize the throughput. The channel state information of the sub-bands is considered as the exponentially distributed, so a stochastic programming method is proposed to optimize the sensing time for the cognitive relay networks. The computer simulation results using the Matlab software show that the algorithm is effective, which has a certain engineering application value.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.162-171
• /
• 2015

This paper provides an analytic performance evaluation of the bit error rate (BER) of underlay decode-and-forward cognitive networks with best relay selection over Rayleigh multipath fading channels. A generalized BER expression valid for arbitrary operational parameters is firstly presented in the form of a single integral, which is then employed for determining the diversity order and coding gain for different best relay selection scenarios. Furthermore, a novel and highly accurate closed-form approximate BER expression is derived for the specific case where relays are located relatively close to each other. The presented results are rather convenient to handle both analytically and numerically, while they are shown to be in good agreement with results from respective computer simulations. In addition, it is shown that as in the case of conventional relaying networks, the behaviour of underlay relaying cognitive networks with best relay selection depends significantly on the number of involved relays.

• Journal of Communications and Networks
• /
• 제13권6호
• /
• pp.633-638
• /
• 2011

In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.288-298
• /
• 2016

Proactive relay selection in cognitive radio networks has recently received considerable attention. However, its outage probability analysis is limited to partially-identical fading distributions, uncorrelation among received signal-to-noise ratios (SNRs), and no direct channel. This paper completes this literature deficiency by generalizing the existing analysis for non-identical fading distributions, correlation among received SNRs, and with direct channel. Numerous results demonstrate that relay selection with a direct channel achieves a higher diversity order and superior performance than that without a direct channel at virtually no cost of power and bandwidth. Further, proactive relay selection suffers an error floor at either a large maximum transmit power or large maximum interference power; however, the error floor level can be significantly remedied with an increase in the number of relays.