• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.260-279
• /
• 2015

In this paper, we investigate physical layer security for multiple decode-and-forward (DF) relaying underlay cognitive radio networks (CRNs) with fixed transmit power at the secondary network against passive eavesdropping attacks. We propose a simple relay selection scheme to improve wireless transmission security based on the instantaneous channel information of all legitimate users and the statistical information about the eavesdropper channels. The closed-form expressions of the probability of non-zero secrecy capacity and the secrecy outage probability (SOP) are derived over independent and non-identically distributed Rayleigh fading environments. Furthermore, we conduct the asymptotic analysis to evaluate the secrecy diversity order performance and prove that full diversity is achieved by using the proposed relay selection. Finally, numerical results are presented to verify the theoretical analysis and depict that primary interference constrain has a significant impact on the secure performance and a proper transmit power for the second transmitters is preferred to be energy-efficient and improve the secure performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5455-5475
• /
• 2016

In this article, we model the distributed relay assignment network as a many-to-one matching market with peer effects. We discuss two scenarios for throughput optimization of relay networks: the scenario of aggregate throughput optimization and the scenario of fairness performance optimization. For the first scenario, we propose a Mutual Benefit-based Deferred Acceptance (MBDA) algorithm to increase the aggregate network throughput. For the second scenario, instead of using the alternative matching scheme, a non-substitution matching algorithm (NSA) is designed to solve the fairness problem. The NSA improves the fairness performance. We prove that both two algorithms converge to a globally stable matching, and discuss the practical implementation. Simulation results show that the performance of MBDA algorithm outperforms existing schemes and is almost the same with the optimal solution in terms of aggregate throughput. Meanwhile, the proposed NSA improves fairness as the scale of the relay network expands.

• 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.12 no.8
• /
• pp.3542-3566
• /
• 2018

In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

• International Journal of Contents
• /
• v.14 no.1
• /
• pp.18-27
• /
• 2018

The objective of this study was to derive approximate closed-form error rates for M-ary burst symbol transmission (MBST) of dual-hop adaptive decode-and-forward (ADF) cooperative relay systems over quasi-static Rayleigh fading channels. Within a burst, there are pilot symbols and data symbols. Pilot symbols are used for channel estimation schemes and each relay node's transmission mode selection schemes. At first, our focus was on ADF relay systems' error-events at relay nodes. Each event's occurrence probability and probability density function (PDF) were then derived. With error-event based approach, we derived a tractable form of PDF for combined signal-to-noise ratio (SNR). Averaged error rates were then derived as approximate expressions for arbitrary link SNR with different modulation orders and numbers of relays. Its accuracy was verified by comparison with simulation results.

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

• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.352-363
• /
• 2012

In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.290-296
• /
• 2007

We propose new routing scheme, Cooperative Diversity-based Routing (CDR) which utilizes the cooperative space diversity for power saving and performance enhancement of wireless ad-hoc networks. The improved performance is compared with Multi-hop Relay Routing (NRR) by analytical methods. When the required outage probability is $1\times10^{-3}$ at the destination node in ad-hoc networks with 7 nodes, we noticed that each node can save power consumption by 15.5 dB in average, by using our proposed CDR compared to MRR.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.94-102
• /
• 2009

In [1], the authors have proposed a novel scheme to achieve full diversity and to combat the time delays from each relay node, but decode-and-forward (DF) model operation mode puts more processing burden on the relay. In this paper, we not only extend their model into amplify and forward (AF) model proposed in [2],[3], but also propose an efficient decoding algorithm, which is able to order the joint channel coefficients of overall channel consisting of source-relay link and relay-destination link and cancels the previous decoded symbols at the next decoding procedure. The simulation results show that this algorithm efficiently improves its performance achieving 2-3dB gain compared to [1] in high SNR region and also useful to DF achieving more than 3dB gain compared to an original algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3447-3469
• /
• 2019

It is well-known that the cooperative communication and error control technology can improve the network performance, but most existing cooperative MAC protocols have not focused on how to cope with the contention process caused by cooperation and how to reduce the bad influence of channel packet error rate on the system performance. Inspired by this, this paper first modifies and improves the basic rules of the IEEE 802.11 Medium Access Control (MAC) protocol to optimize the contention among the multi-relay in a cooperative ARQ scheme. Secondly, a hybrid ARQ protocol with soft combining is adopted to make full use of the effective information in the error data packet and hence improve the ability of the receiver to decode the data packet correctly. The closed expressions of network performance including throughput and average packet transmission delay in a saturated network are then analyzed and derived by establishing a dedicated two-dimensional Markov model and solving its steady-state distribution. Finally, the performance evaluation and superiority of the proposed protocol are validated in different representative study cases through MATLAB simulations.