• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2686-2708
• /
• 2020

This paper investigates the energy efficiency of energy harvesting (EH) bidirectional cooperative sensor networks, in which the considered system model enables the uplink information transmission from the sensor (SN) to access point (AP) and the energy supply for the amplify-and-forward (AF) relay and SN using power-splitting (PS) or time-switching (TS) protocol. Considering the minimum EH activation constraint and quality of service (QoS) requirement, energy efficiency is maximized by jointly optimizing the resource division ratio and transmission power. To cope with the non-convexity of the optimizations, we propose the low complexity iterative algorithm based on fractional programming and alternative search method (FAS). The key idea of the proposed algorithm first transforms the objective function into the parameterized polynomial subtractive form. Then we decompose the optimization into two convex sub-problems, which can be solved by conventional convex programming. Simulation results validate that the proposed schemes have better output performance and the iterative algorithm has a fast convergence rate.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.313-318
• /
• 2011

When wireless channels undergo fast fading, non-coherent frequency shift keying (FSK) (de)modulation schemes may be considered for amplify-and-forward (AF) cooperative communications. In this paper, we derive the bit-error-rate performance of partial non-coherent receiver as a lower bound of the optimal non-coherent receiver for FSK modulated AF cooperative communications. From the simulation and analytical results, it is found that the derived lower bound is very closed to simulation results. This result shows that knowing partial channel state information may not improve system performance significantly. On the other hand, conventional optimal non-coherent receiver involves complicated integration operation. To address the above complexity issue, we also propose a near optimal non-coherent receiver which does not involve integration operation. Simulation results have shown that the performance gap between the proposed near optimal receiver and the optimal receiver is small.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.336-342
• /
• 2008

We proposed a simple power allocation scheme to maximize network lifetime for "amplify and forward(AF)" and "decode and forward(DF)". To maximize network lifetime, it is important to allocate power fairly among nodes in a network as well as to minimize total transmitted power. In the proposed scheme, the allocated power is proportional to the residual power and also satisfies the required SNR at destination node. In this paper, we calculate power allocation in model of AF and DF. We evaluated the proposed power allocation scheme using extensive simulation and simulation results show that proposed power allocation obtains much longer network lifetime than the equal power allocation.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.371-383
• /
• 2008

Application of network coding in wireless two-way relay channels (TWRC) has received much attention recently because its ability to improve throughput significantly. In traditional designs, network coding operates at upper layers above (including) the link layer and it requires the input packets to be correctly decoded. However, this requirement may limit the performance and application of network coding due to the unavoidable fading and noise in wireless networks. In this paper, we propose a new wireless network coding scheme for TWRC, which is referred to as soft network coding (SoftNC), where the relay nodes applies symbol-by-symbol soft decisions on the received signals from the two end nodes to come up with the network coded information to be forwarded. We do not assume further channel coding on top of SoftNC at the relay node (channel coding is assumed at the end nodes). According to measures of the soft information adopted, two kinds of SoftNC are proposed: amplify-and-forward SoftNC (AF-SoftNC) and soft-bit-forward SoftNC (SBF-SoftNC). We analyze the both the ergodic capacity and the outage capacity of the two SoftNC schemes. Specifically, analytical form approximations of the ergodic capacity and the outage capacity of the two schemes are given and validated. Numerical simulation shows that our SoftNC schemes can outperform the traditional network coding based two-way relay protocol, where channel decoding and re-encoding are used at the relay node. Notable is the fact that performance improvement is achieved using only simple symbol-level operations at the relay node.

• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.57-75
• /
• 2015

In evaluating the performance of a dual-hop wireless link, the effects of large and small scale fading has to be considered. To overcome this fading effect, several schemes, such as multiple-input multiple-output (MIMO) with orthogonal space time block codes (OSTBC), different combining schemes at the relay and receiving end, and orthogonal frequency division multiplexing (OFDM) are used in both the transmitting and the relay links. In this paper, we first make compare the performance of a two-hop wireless link under a different combination of space diversity in the first and second hop of the amplify-and-forward (AF) case. Our second task in this paper is to incorporate the weak signal of a direct link and then by applying the channel model of two random variables (one for a direct link and another for a relayed link) we get very impressive result at a low signal-to-noise ratio (SNR) that is comparable with other models at a higher SNR. Our third task is to bring other three schemes under a two-hop wireless link: use of transmit antenna selection (TAS) on both link with weak direct link, distributed Alamouti scheme in two-hop link and single relay antenna with OFDM subcarrier. Finally, all of the schemes mentioned above are compared to select the best possible model. The main finding of the paper is as follows: the use of MIMO on both hops but application TAS on both links with weak direct link and the full rate OFDM with the sub-carrier for an individual link provide a better result as compared to other models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.338-344
• /
• 2017

In this paper, two-way amplify-and-forward relay methods are investigated where two terminals and one relay node are equipped with multiple antennas. In two-way relay channels, it is assumed that one terminal can eliminate its own self-interference but the other cannot. For this channel, we first maximize the sum-rate performance by employing an iterative gradient descent (GD) algorithm. Then, a simple singular value decomposition (SVD) based block triangularization is developed to null the self-interference. Simulation results show the proposed methods outperform the conventional schemes for various environments.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.1
• /
• pp.55-62
• /
• 2009

In this paper, we propose a method on the training sequence based on channel estimation issues for relay networks that employ amplify-and-forward(AF) transmission scheme. In $^{[1]}$ and $^{[2]}$, we have to point out that jointly estimating the channel from source to relay and from relay to destination suffers from many drawbacks in fast fading case because the estimation of previous pilots is not suitable for current channel. In this paper, we consider a new joint estimation of overall channel impulse response(CIR) using one OFDM signal without pilots. Using the maximum likelihood(ML) function, we derive a channel estimator by taking the frequency domain of transmitted signal as Gaussian and averaging the ML function over the resulting Gaussian distribution. Simulation results show that our proposed channel estimator performs a fraction of 1dB compared with $^{[1]}$ in high SNR region.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.361-370
• /
• 2008

Cooperative relaying permits one or more relay to transmit a signal from the source to the destination, thereby increasing network coverage and spectral efficiency. The performance of cooperative relaying is often measured as outage probability. However, appropriate measure for the channel quality is outage capacity. Although the outage probability for cooperative relaying protocol has been analyzed before, very little research has been addressed for the outage capacity. This paper is the first of its kind to derive a closed-form analytical solution of outage capacity using fixed decode and forward relaying and amplify and forward relaying in dissimilar Rayleigh fading channels, considering channel coefficients known to the receiver side. The analytical results show a tradeoff between the SNR and the number of relays for specific outage capacity. A comparison between decode and forward relaying and amplify and forward relaying shows that decode and forward relaying outperforms amplify and forward relaying for a large number of relays.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2350-2364
• /
• 2014

This paper addresses the problem of resource allocation in amplify-and-forward (AF) relayed OFDM based cognitive radio networks (CRNs). The purpose of resource allocation is to maximize the overall throughput, while satisfying the constraints on the individual power and the interference induced to the primary users (PUs). Additionally, different from the conventional resource allocation problem, the rate-guarantee constraints of the subcarriers are considered. We formulate the problem as a mixed integer programming task and adopt the dual decomposition technique to obtain an asymptotically optimal power allocation, subcarrier pairing and relay selection. Moreover, we further design a suboptimal algorithm that sacrifices little on performance but could significantly reduce computational complexity. Numerical simulation results confirm the optimality of the proposed algorithms and demonstrate the impact of the different constraints.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.257-265
• /
• 2011

In this paper, a cooperative relaying protocol called soft-decision-and-forward (SDF) with multiple antennas in each node is introduced. SDF protocol exploits the soft decision source symbol values from the received signal at the relay node. For orthogonal transmission (OT), orthogonal codes including Alamouti code are used and for non-orthogonal transmission (NT), distributed space-time codes are designed by using a quasi-orthogonal space-time block code. The optimal maximum likelihood (ML) decoders for the proposed protocol with low decoding complexity are proposed. For OT, the ML decoders are derived as symbolwise decoders while for NT, the ML decoders are derived as pairwise decoders. It can be seen through simulations that SDF protocol outperforms AF protocol for both OT and NT.