• Title/Summary/Keyword: Cooperative Relaying

Search Result 123, Processing Time 0.021 seconds

Soft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antennas

  • Yang, Jae-Dong;Song, Kyoung-Young;No, Jong-Seon;Shin, Dong-Joan
    • 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.

Throughput maximization for underlay CR multicarrier NOMA network with cooperative communication

  • Manimekalai, Thirunavukkarasu;Joan, Sparjan Romera;Laxmikandan, Thangavelu
    • ETRI Journal
    • /
    • v.42 no.6
    • /
    • pp.846-858
    • /
    • 2020
  • The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

A Buffer-Aided Successive Relaying Technique with a Priori Decoding Information (선행 복호 정보를 활용한 버퍼기반 연쇄적 중계 기법)

  • Lee, Byeong Su;Jung, Bang Chul;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.2
    • /
    • pp.275-280
    • /
    • 2016
  • In this paper, we propose a novel relay selection technique which utilizes a priori decoding information at relays for buffer-aided successive relaying networks. In the conventional relaying schemes, a single relay pair is selected for receiving data from the source and transmitting data to the destination. In the proposed technique, however, all relays except the relay selected for transmitting data to the destination try to decode the received signal from the source, and they store the data if they succeed decoding. The proposed technique selects the relay such that it can succeed its own transmission and it maximizes the number of relays successfully decoding the data from the source at the same time. It is shown that the proposed relaying technique significantly outperforms the conventional buffer-aided relaying schemes in terms of outage probability through extensive computer simulations.

A Game Theoretic Study of Energy Efficient Cooperative Wireless Networks

  • Brown, Donald Richard III;Fazel, Fatemeh
    • 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.

BER Performance of SEP-based Selection Relaying in Cooperative Communications (협력통신에서 SEP 기반의 선택적 릴레이의 BER 성능)

  • Kong, Hyung-Yun;Choi, Dae-Kyu
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.1
    • /
    • pp.83-88
    • /
    • 2009
  • Selection relaying(SR) is usually based on signal-to-noise ratio(SNR) to decide whether or not to forward recovered symbols. However, instantaneous noise at relay is ignored, leading to the risk of erroneous retransmission induced by the relay that can be detrimental to the eventual detection of symbols at destination. To overcome this problem, we propose using new symbol error probability(SEP) related directly to reliability of received symbols instead of SNR. Simulation results show that the proposed SEP-based SR is considerably better than the conventional SNR-based SR under any relay position and threshold.

Bit Error Rate of Underlay Decode-and-Forward Cognitive Networks with Best Relay Selection

  • Ho-Van, Khuong;Sofotasios, Paschalis C.;Alexandropoulos, George C.;Freear, Steven
    • Journal of Communications and Networks
    • /
    • v.17 no.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.

On Performance Evaluation of Hybrid Decode-Amplify-Forward Relaying Protocol with Partial Relay Selection in Underlay Cognitive Networks

  • Duy, Tran Trung;Kong, Hyung Yun
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.502-511
    • /
    • 2014
  • In this paper, we evaluate performance of a hybrid decode-amplify-forward relaying protocol in underlay cognitive radio. In the proposed protocol, a secondary relay which is chosen by partial relay selection method helps a transmission between a secondary source and a secondary destination. In particular, if the chosen relay decodes the secondary source's signal successfully, it will forward the decoded signal to the secondary destination. Otherwise, it will amplify the signal received from the secondary source and will forward the amplified signal to the secondary destination. We evaluate the performance of our scheme via theory and simulation. Results show that the proposed protocol outperforms the amplify-and-forward and decode-and-forward protocols in terms of outage probability.

Joint TAS and Power Allocation for IHDAF Relaying M2M Cooperative Networks

  • Xu, Lingwei;Zhang, Hao;Gulliver, T. Aaron
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.1957-1975
    • /
    • 2016
  • The outage probability (OP) performance of multiple-relay-based incremental hybrid decode-amplify-forward (IHDAF) relaying mobile-to-mobile (M2M) networks with transmit antenna selection (TAS) over N-Nakagami fading channels is investigated in this paper. The closed-form expressions for approximate OP of the optimal and suboptimal TAS schemes are derived. The power allocation problem is formulated for performance optimization. Then the OP performance under different conditions is evaluated through numerical simulations to verify the analysis. The simulation results showed that optimal TAS scheme has a better OP performance than suboptimal TAS scheme; the power-allocation parameter has an important influence on the OP performance.

An Exact Closed-Form Expression for Bit Error Rate of Decode-and-Forward Relaying Using Selection Combining over Rayleigh Fading Channels

  • Bao, Vo Nguyen Quoe;Kong, Hyung-Yun
    • Journal of Communications and Networks
    • /
    • v.11 no.5
    • /
    • pp.480-488
    • /
    • 2009
  • Cooperative transmission is an effective solution to improve the performance of wireless communications over fading channels without the need for physical co-located antenna arrays. In this paper, selection combining is used at the destination instead of maximal ratio combing to optimize the structure of destination and to reduce power consumption in selective decode-and-forward relaying networks. For an arbitrary number of relays, an exact and closed-form expression of the bit error rate (BER) is derived for M-PAM, M-QAM, and M-PSK, respectively, in both independent identically distributed and independent but not identically distributed Rayleigh fading channels. A variety of simulations are performed and show that they match exactly with analytic ones. In addition, our results show that the optimum number of relays depend not only on channel conditions (operating SNRs) but also on modulation schemes which to be used.

On the Performance of the Block-Based Selective OFDM Decode-and-Forward Relaying Scheme for 4G Mobile Communication Systems

  • Yang, Wendong;Cai, Yueming
    • Journal of Communications and Networks
    • /
    • v.13 no.1
    • /
    • pp.56-62
    • /
    • 2011
  • In this paper, we propose a block-based selective orthogonal frequency division multiplexing (OFDM) decode-and-forward relaying scheme for 4G mobile communication systems. In the scheme, an OFDM symbol is divided into blocks and one relay is selected for each block. Theoretical outage performance and error performance are analyzed and evaluated. A unified outage expression is given for our scheme and the other two schemes and the lower bound of the bit error rate of the three schemes is also obtained. The effect of the coherence bandwidth on the proposed scheme is also investigated. Monte Carlo simulations are carried out to validate our analysis. The scheme can obtain a good tradeoff between complexity and performance and can be used in future 4G mobile communication systems.