Performance Analysis of Coded Cooperation Protocol with Reactive and Proactive Relay Selection

Asaduzzaman,Hyung-Yun Kong 한국전자파학회JEES 2011 Journal of Electromagnetic Engineering and Science Vol.11 No.2

Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.

Network-Coding-Based Coded Cooperation

Suwen Wu,Jinkang Zhu,Ling Qiu,Ming Zhao 한국통신학회 2010 Journal of communications and networks Vol.12 No.4

Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-codingbased coded cooperation scheme.When a user decodes its partner’s information correctly in the first frame, it transmits the combination of the partner’s parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the user only transmits the partner’s parity bits during cooperation. We analyze the outage probability of the proposed scheme, and show that it achieves a full diversity order. Numerical evaluations reveal that the proposed scheme outperforms the classical scheme when the inter-user channel is poor,yet is worse when the inter-user channel is strong. Also, the results show that the proposed scheme always outperforms that of no cooperation in various channel conditions while the performance of classical scheme is worse than that of no cooperation with the poor inter-user channels. This means that the performance of the proposed scheme is more stable than the classical scheme and the proposed scheme is more tolerant to the poor inter-user channels. To combine the advantages of the proposed scheme and the classical scheme under different inter-user channel conditions, we propose an adaptive solution. This adaptive scheme enhances the system performance considerably in all channel conditions in spite of the inter-user channel quality, at the expense of only one acknowledgement or non-acknowledgement bit.

An Efficient Space-Time Coded Cooperation Protocol for Wireless Communication

Ji-Hwan Park,Hyung-Yun Kong 한국전자파학회JEES 2010 Journal of Electromagnetic Engineering and Science Vol.10 No.2

This paper proposes a new cooperative protocol in which Alamouti’s scheme is applied to exploit the advantages of both coded cooperation and Alamouti’s scheme. It not only has better than direct transmission but also coded cooperation at appropriate cooperation levels. Simulation results show that the proposed protocol can save approximately 6~7 ㏈ of transmit power to achieve the target BER(Bit Error Rate) compared with coded cooperation. Furthermore, the performance of the proposed protocol does not significantly depend on the qualities of inter-user channels.

Polar coded cooperative with Plotkin construction and quasi-uniform puncturing based on MIMO antennas in half duplex wireless relay network

Jiangli Zeng,Sanya Liu 한국전자통신연구원 2024 ETRI Journal Vol.46 No.2

Recently, polar code has attracted the attention of many scholars and has been developed as a code technology in coded-cooperative communication. We pro-pose a polar code scheme based on Plotkin structure and quasi-uniform punching (PC-QUP). Then we apply the PC-QUP to coded-cooperative sce-nario and built to a new coded-cooperative scheme, which is called PCC-QUP scheme. The coded-cooperative scheme based on polar code is studied on the aspects of codeword construction and performance optimization. Further, we apply the proposed schemes to space-time block coding (STBC) to explore the performance of the scheme. Monte Carlo simulation results show that the pro-posed cooperative PCC-QUP-STBC scheme can obtain a lower bit error ratio (BER) than its corresponding noncooperative scheme.

Network-Coding-Based Coded Cooperation

Wu, Suwen,Zhu, Jinkang,Qiu, Ling,Zhao, Ming The Korea Institute of Information and Commucation 2010 Journal of communications and networks Vol.12 No.4

Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-coding-based coded cooperation scheme. When a user decodes its partner's information correctly in the first frame, it transmits the combination of the partner's parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the user only transmits the partner's parity bits during cooperation. We analyze the outage probability of the proposed scheme, and show that it achieves a full diversity order. Numerical evaluations reveal that the proposed scheme outperforms the classical scheme when the inter-user channel is poor, yet is worse when the inter-user channel is strong. Also, the results show that the proposed scheme always outperforms that of no cooperation in various channel conditions while the performance of classical scheme is worse than that of no cooperation with the poor inter-user channels. This means that the performance of the proposed scheme is more stable than the classical scheme and the proposed scheme is more tolerant to the poor inter-user channels. To combine the advantages of the proposed scheme and the classical scheme under different inter-user channel conditions, we propose an adaptive solution. This adaptive scheme enhances the system performance considerably in all channel conditions in spite of the inter-user channel quality, at the expense of only one acknowledgement or non-acknowledgement bit.

프랑스 협동조합법의 법적구조에 관한 연구

김두년 한국협동조합학회 2006 韓國協同組合硏究 Vol.24 No.2

This thesis introduces not only ``The Act of 10 September 1947 regarding the status of Cooperatives`` regulating overall cooperative institution about the legal structure of cooperative law but also ``Agricultural Cooperative Law(Code Rural)`` in France. In the result of a study about the Cooperative related laws in France, cooperative in Korea suggests follows. The first, it is urgent to enact a basic cooperative law in Korea. The author already published both an establishment conception and the necessity of a basic cooperative law. The second, the social function of cooperative should be specified in the law. Cooperatives in France win public recognition of the social function of cooperative. Thus, cooperatives as a social economy identity are specified in law, to accomplish the social economy through cooperatives. The third, cooperatives should be perceived as cooperatives in enterprise like other identities. Already, cooperatives across the boundaries of a country are beginning and cooperatives are defined as Co-operatives in Enterprise Europe in the original Union European cooperative law progressing in the European Union Parliament. The fourth, Cooperative law form should be deregulated for cooperatives to develop as cooperatives in enterprise. Already, many forms of cooperatives such as a variable capital stock company, cooperative in The Act of 10 September 1947 regarding the status of Cooperatives, a stock company, co-operative in a special law, an incorporated company in France win legal recognition. The fifth, a new funding method should be introduced. A huge capital is needed in cooperatives with increasing enterprise scale. On the basis of experiences in France, preference investment without voting right, cooperative investment stock, issue of cooperative bond and the way listed on the stock exchange should be found out. In conclusion, cooperatives basically are an economy identity too. Cooperative law institutions have the meaning in providing the legal base for the activation of cooperatives whatever legal form is.

Distributed Totally Decomposed Cumulative Goppa Coded-Cooperative Communication with Optimized Selection in the Relay

Waweru, Daniel Kariuki,Yang, Fengfan,Zhao, Chunli,Paul, Lawrence Muthama,Xu, Hongjun 한국통신학회 2023 Journal of communications and networks Vol.25 No.2

In this paper, powerful induced-cyclic totally decom-posed cumulative Goppa (TDCG) codes are selected and used forcoded-cooperative diversity, which can fit wireless communicationapplications. Two TDCG codes employed at the source andrelay nodes establish the joint design of the destination channelcode. In the cooperation phase, we consider an optimized relaychannel code which improves the overall bit-error-rate (BER)performance. Two methods of optimization are explored. Themost practical method for optimization in terms of reducedprocessing complexity is proposed. We use a joint decodingwhich exploits all the resources gained by the cooperation schemeat the destination. The BER performance is evaluated throughMonte-Carlo simulations with BPSK modulation and coherentdetection over the flat Rayleigh fading channel. The proposedTDCG coded-cooperative diversity scheme exhibit a better BERperformance than the non-cooperation scheme and other existingcoded cooperation methods of similar code rates under similarchannel conditions.

Code Combining Cooperative Diversity in Long-haul Transmission of Cluster based Wireless Sensor Networks

( Asaduzzaman ),( Hyung Yun Kong ) 한국인터넷정보학회 2011 KSII Transactions on Internet and Information Syst Vol.5 No.7

A simple modification of well known Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is proposed to exploit cooperative diversity. Instead of selecting a single cluster-head, we propose M cluster-heads in each cluster to obtain a diversity of order M. The cluster-heads gather data from all the sensor nodes within the cluster using same technique as LEACH. Cluster-heads transmit gathered data cooperatively towards the destination or higher order cluster-head. We propose a code combining based cooperative diversity protocol which is similar to coded cooperation that maximizes the performance of the proposed cooperative LEACH protocol. The implementation of the proposed cooperative strategy is analyzed. We develop the upper bounds on bit error rate (BER) and frame error rate (FER) for our proposal. Space time block codes (STBC) are also a suitable candidate for our proposal. In this paper, we argue that the STBC performs worse than the code combining cooperation.

Duo-Binary 터보 부호를 이용한 협동 다이버시티 성능 분석

여성문(Sungmoon Yeo),김수영(Sooyoung Kim) 대한전자공학회 2009 電子工學會論文誌-TC (Telecommunications) Vol.46 No.2

본 논문에서는 duo-binary 터보 부호를 이용한 협동 다이버시티 기술을 소개하고 그 성능을 분석한다. 오류 정정 부호를 이용한 부호화 다이버시티 기술은 상대편 단말에서의 복호 및 재 부호화 전송을 이용하여 큰 협동 다이버시티 이득을 얻을 수 있다. 반면, 상대편 단말에서 복호가 실패할 경우에는 오히려 더 큰 성능 악화를 초래할 수도 있다. 본 논문에서는 IEEE WiMax 규격에서 오류 정정 부호 기술로 정의 되어 있는 duo-binary 터보 부호를 이용한 부호화 다이버시티 기술을 다양한 방식으로 적용하여 성능을 시뮬레이션 하고, 그 결과를 분석한다. 특히 본 논문에서는 duo-binary 터보 부호에 대한 부호율 호환 가능 부호를 이용하여 서로 다른 패리티를 전송하는 단말들끼리 협동 다이버시티를 이용하는 방법을 소개한다. 본 논문에서 제시한 시뮬레이션 결과에 따르면 적절한 신호대 잡음비 환경에서 제안한 방식이 매우 큰 협동 다이버시티 이득을 보일 수 있음을 알 수 있다. In this paper, we propose an efficient cooperative diversity technique, which partition the codewords of each mobile and transmit portions of each codeword through independent fading channels using duo-binary turbo codes. A coded diversity technique can achieve high cooperative diversity gain by decoding and transmitting of the re-encoded signal, while this can also cause high performance degradation due to failure of the decoding. In this paper, we introduce various coded diversity technique using duo-binary turbo codes which are defined as channel coding schemes in the IEEE WiMax specification, and also demonstrate performance simulation results with the analysis. We also propose a cooperative diversity technique using rate-compatible duo-binary turbo codes, where user terminals with different parity symbols cooperate each other. Simulation results investigated in this paper reveal that the proposed scheme show high diversity gain at a reasonal SNR range.

On the Diversity-Multiplexing Tradeoff of Cooperative Multicast System with Wireless Network Coding

Li, Jun,Chen, Wen The Korea Institute of Information and Commucation 2010 Journal of communications and networks Vol.12 No.1

Diversity-multiplexing tradeoff (DMT) is an efficient tool to measure the performance of multiple-input and multiple-output (MIMO) systems and cooperative systems. Recently, cooperative multicast system with wireless network coding stretched tremendous interesting due to that it can drastically enhance the throughput of the wireless networks. It is desirable to apply DMT to the performance analysis on the multicast system with wireless network coding. In this paper, DMT is performed at the three proposed wireless network coding protocols, i.e., non-regenerative network coding (NRNC), regenerative complex field network coding (RCNC) and regenerative Galois field network coding (RGNC). The DMT analysis shows that under the same system performance, i.e., the same diversity gain, all the three network coding protocols outperform the traditional transmission scheme without network coding in terms of multiplexing gain. Our DMT analysis also exhibits the trends of the three network coding protocols' performance when multiplexing gain is changing from the lower region to the higher region. Monte-Carlo simulations verify the prediction of DMT.