• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2416-2432
• /
• 2017

In this paper, we investigate the security performance for cooperative networks over Nakagami-m fading channels. Based on whether the channel state information (CSI) of wiretap link is available or not, optimal relay selection (ORS) and suboptimal relay selection (SRS) schemes are considered. Also, multiple relays combining (MRC) scheme is considered for comparison purpose. The exact and asymptotic closed-form expressions for secrecy outage probability (SOP) are derived and simulations are presented to validate the accuracy of our proposed analytical results. The numerical results illustrate that the ORS is the best scheme and SRS scheme is better than MRC scheme in some special scenarios such as when the destination is far away from the relays. Furthermore, through asymptotic analysis, we obtain the closed-form expressions for the secrecy diversity order and secrecy array gain for the three different selection schemes. The secrecy diversity order is closely related to the number of relays and fading parameter between relay and destination.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3589-3605
• /
• 2018

In this paper, we investigate an individual channel estimation problem for multiple-input multiple-output (MIMO) two-way amplify-and-forward (AF) relay networks. To avoid self-interference during the estimation of the individual MIMO channels, a novel blind interference cancellation (BIC) approach is proposed based on an orthogonal preceding framework, where a pair of orthogonal precoding matrices is utilized at the source nodes. By designing an optimal decoding scheme, we propose to decompose the bidirectional transmission into a pair of unidirectional transmissions. Unlike most existing approaches, we make the practical assumption that the nonreciprocal MIMO channel and the mutual interference of multiple antennas are both taken into consideration. Under the precoding framework, we employ an orthogonal superimposed training strategy to obtain the individual MIMO channels. However, the AF strategy causes the noise at the terminal to be the sum of the local noise and the relay-propagated noise. To remove the relay-propagated noise during the estimation of the second-hop channel, a partial noise-nulling method is designed. We also derive a closed-form expression for the total mean square error (MSE) of the MIMO channel from which we compute the optimal power allocation. The simulation results demonstrate that the analytical and simulated curves match fully.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3908-3920
• /
• 2015

In this paper, performance analysis of full-duplex (FD) relay selection under decode-and-forward (DF) relaying mode is carried out by taking into account several critical factors, including the distributions of the received signal-to-noise ratio (SNR) and the outage probability of wireless links. The tradeoff between the FD and half-duplex (HD) modes for relay selection techniques is also analyzed, where the former suffers from the impact of residual self-interference, but the latter requires more channel resources than the former (i.e., two orthogonal channels are required). Furthermore, the impact of optimal power allocation (OPA) on the proposed relay-selection scheme is analyzed. Particularly, the exact closed-form expressions for outage probability of the proposed scheme over Rayleigh fading channels are derived, followed by validating the proposed analysis using simulation. Numerical results show that the proposed FD based scheme outperforms the HD based scheme by more than 4 dB in terms of coding gain, provided that the residual self-interference level in the FD mode can be substantially suppressed to the level that is below the noise power.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2732-2749
• /
• 2023

Device-to-Device (D2D) communication has received increasing attention and been studied extensively thanks to its advantages in improving spectral efficiency and energy efficiency of cellular networks. This paper proposes a novel relay selection algorithm for multi-hop full-duplex D2D communications underlaying cellular networks. By selecting the relay of each hop in a reverse manner, the proposed algorithm reduces the heavy signaling overhead that traditional relay selection algorithms introduce. In addition, the social domain information of mobile terminals is taken into consideration and its influence on the performance of D2D communications studied, which is found significant enough not to be overlooked. Moreover, simulations show that the proposed algorithm, in absence of social relationship information, improves data throughput by around 70% and 7% and energy efficiency by 64% and 6%, compared with two benchmark algorithms, when D2D distance is 260 meters. In a more practical implementation considering social relationship information, although the proposed algorithm naturally achieves less throughput, it substantially increases the energy efficiency than the benchmarks.

• ETRI Journal
• /
• v.35 no.2
• /
• pp.336-339
• /
• 2013

To enhance the symbol error rate (SER) performance of the two-way relay channels with physical layer network coding, this letter proposes a relay selection scheme, in which the relay with the maximal minimum distance between different points in its constellation among all relays is selected to assist two-way transmissions. We give the closed-form expression of minimum distance for binary phase-shift keying and quadrature phase-shift keying. Additionally, we design a low-complexity method for higher-order modulations based on look-up tables. Simulation results show that the proposed scheme improves the SER performance for two-way relay networks.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.6
• /
• pp.443-449
• /
• 2015

This paper considers the physical layer security problem for a two-way vehicle-to-vehicle network, where the two source vehicles can only exchange information through an untrusted relay vehicle. The relay vehicle helps the two-way transmission but also acts as a potential eavesdropper. Each vehicle has a random velocity. By exploiting the random carrier frequency offsets (CFOs) caused by random motions, a secure double-differential two-way relay scheme is proposed. While achieving successful two-way transmission for the source vehicles, the proposed scheme guarantees a high decoding error floor at the untrusted relay vehicle. Average symbol error rate (SER) performance for the source vehicles and the untrusted relay vehicle is analyzed. Simulation results are provided to verify the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.565-581
• /
• 2019

This paper investigates the wireless powered two way relay network (WPTWRN), where two single-antenna users and one single-antenna relay firstly harvest energy from signals emitted by a multi-antenna power beacon (PB) and then two users exchange information with the help of the relay by using their harvested energies. In order to improve the energy transfer efficiency, energy beamforming at the PB is deployed. For such a network, to explore the performance limit of the presented WPTWRN, an optimization problem is formulated to obtain the achievable rate region bounds by jointly optimizing the time allocation and energy beamforming design. As the optimization problem is non-convex, it is first transformed to be a convex problem by using variable substitutions and semidefinite relaxation (SDR) and then solve it efficiently. It is proved that the proposed method achieves the global optimum. Simulation results show that the achievable rate region of the presented WPTWRN architecture outperforms that of wireless powered one way relay network architecture. Results also show that the relay location has significant impact on achievable rate region of the WPTWRN.

• 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 the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.46-51
• /
• 2012

In this paper, we investigate the power allocation for cognitive relay networks. Cognitive relay networks offer not only increasing spectral efficiency by spectrum sharing but also extending the coverage through the use of relays. For spectrum sharing, conventional works have assumed that secondary users know perfect channel information between the secondary and primary users. However, this channel information may be outdated at the secondary user because of the time-varying properties or feedback latency from the primary user. This causes the violation for interference constraint, and the secondary user cannot share the spectrum of the primary after all. To overcome this problem, we propose the power allocation scheme for the secondary user under the allowable primary user's outage probability constraint. Since the proposed power allocation scheme does not use the instantaneous channel information, the secondary users have lower feedback burden. In addition, the proposed scheme is also robust to the outdated channel environment.