• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4957-4976
• /
• 2016

This paper investigates the error performance of the amplify-and-forward (AF) relaying systems in the context of full-duplex (FD) communication. In addition to the inherent self-interference (SI) due to simultaneous transmission and reception, coexistent FD terminals may cause crosstalk. In this paper, we utilize the information exchange via the crosstalk channel to construct a particular distributed space-time code (DSTC). The residual SI is also considered. Closed-form pairwise error probability (PEP) is first derived. Then we obtain the upper bound of PEP in high transmit power region to provide more insights of diversity and coding gain. The proposed DSTC scheme can attain full cooperative diversity if the variance of SI is not a function of the transmit power. The coding gain can be improved by lengthening the frame and proper power control. Feasibility and efficiency of the proposed DSTC are verified in numerical simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2009-2028
• /
• 2018

Considering a dual-hop energy-harvesting (EH) relaying system, this paper advocates novel relaying protocols based on adaptive time power switching-based relaying (AR) architecture for amplify-and-forward (AF) mode. We introduce novel system model relaying network with impacts of co-channel interference (CCI) and derive analytical expressions for the average harvested energy, outage probability, and the optimal throughput of the information transmission link, taking into account the effect of CCI from neighbor cellular users. In particular, we consider such neighbor users procedure CCI both on the relay and destination nodes. Theoretical results show that, in comparison with the conventional solutions, the proposed model can achieve optimal throughput efficiency for sufficiently small threshold SNR with condition of reasonable controlling time switching fractions and power splitting fractions in concerned AR protocol. We also explore impacts of transmission distances in each hop, transmission rate, the other key parameters of AR to throughput performance for different channel models. Simulation results are presented to corroborate the proposed methodology.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.6
• /
• pp.39-47
• /
• 2012

As a scheme to efficiently reduce the effects of multipath fading in next generation wireless communication systems, cooperative communication systems have recently come into the spotlight. Since these cooperative communication systems use cooperative relays with diverse fading coefficients to transmit information, having all relays participate in cooperative communication may result in unnecessary waste of resources, and thus relay selection schemes are required to efficiently use wireless resources. In this paper, we propose an efficient relay selection scheme through self-learning in cooperative wireless networks using Q-learning algorithm. In this scheme, we define states, actions and two rewards to achieve good SER (Symbol Error Rate) performance, while selecting a small number of cooperative relays. When these parameters are well-defined, we can obtain good performance. For demonstrating the superiority of the proposed Q-learning, We compared the proposed scheme with Q-learning and a relay selection scheme with a mathematical analysis. The simulation results show that, compared to a scheme that obtains optimum relays through a mathematical analysis, the proposed scheme uses resources efficiently by using smaller numbers of relays with comparable SER performance. According to these simulation results, the proposed scheme can be considered as a good attempt for future wireless communication.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1594-1617
• /
• 2018

In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.266-276
• /
• 2011

In wireless networks, it is well-known that intermediate nodes can be used as cooperative relays to reduce the transmission energy required to reliably deliver a message to an intended destination. When the network is under a central authority, energy allocations and cooperative pairings can be assigned to optimize the overall energy efficiency of the network. In networks with autonomous selfish nodes, however, nodes may not be willing to expend energy to relay messages for others. This problem has been previously addressed through the development of extrinsic incentive mechanisms, e.g., virtual currency, or the insertion of altruistic nodes in the network to enforce cooperative behavior. This paper considers the problem of how selfish nodes can decide on an efficient energy allocation and endogenously form cooperative partnerships in wireless networks without extrinsic incentive mechanisms or altruistic nodes. Using tools from both cooperative and non-cooperative game theory, the three main contributions of this paper are (i) the development of Pareto-efficient cooperative energy allocations that can be agreed upon by selfish nodes, based on axiomatic bargaining techniques, (ii) the development of necessary and sufficient conditions under which "natural" cooperation is possible in systems with fading and non-fading channels without extrinsic incentive mechanisms or altruistic nodes, and (iii) the development of techniques to endogenously form cooperative partnerships without central control. Numerical results with orthogonal amplify-and-forward cooperation are also provided to quantify the energy efficiency of a wireless network with sources selfishly allocating transmission/relaying energy and endogenously forming cooperative partnerships with respect to a network with centrally optimized energy allocations and pairing assignments.