Design of Network Codes for Multiple-User Multiple-Relay Wireless Networks

被引:70
|
作者
Xiao, Ming [1 ,2 ]
Kliewer, Joerg [3 ]
Skoglund, Mikael [1 ,2 ]
机构
[1] Royal Inst Technol, Commun Theory Sch Elect Engn, Stockholm, Sweden
[2] Royal Inst Technol, ACCESS Linnaeus Ctr, Sch Elect Engn, Stockholm, Sweden
[3] New Mexico State Univ, Klipsch Sch Elect & Comp Engn, Las Cruces, NM 88003 USA
基金
美国国家科学基金会;
关键词
Network coding; relay; finite field; MDS codes; diversity order; COOPERATIVE DIVERSITY; CAPACITY THEOREMS; PROTOCOLS;
D O I
10.1109/TCOMM.2012.091012.110121
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We investigate the design of network codes for multiple-user multiple-relay (MUMR) wireless networks with slow fading (quasi-static) channels. In these networks, M users have independent information to be transmitted to a common base station (BS) with the help of N relays, where M >= 2 and N >= 1 are arbitrary integers. We investigate such networks in terms of diversity order to measure asymptotic performance. For networks with orthogonal channels, we show that network codes based on maximum distance separable (MDS) codes can achieve the maximum diversity order of N + 1. We further show that the MDS coding construction of network codes is also necessary to obtain full diversity for linear finite field network coding (FFNC). Then, we compare the performance of the FFNC approach with superposition coding (SC) at the relays. The results show that the FFNC based on MDS codes has better performance than SC in both the high rate and the high SNR regime. Further, we discuss networks without direct source-to-BS channels for N >= M. We show that the proposed FFNC can obtain the diversity order N - M + 1, which is equivalent to achieving the Singleton bound for network error-correction codes. Finally, we study the network with nonorthogonal channels and show our codes can still achieve a diversity order of N + 1, which cannot be achieved by a scheme based on SC.
引用
收藏
页码:3755 / 3766
页数:12
相关论文
共 50 条
  • [31] A Distributed Algorithm for Two-Way Multiple-Relay Networks
    Lameiro, C.
    Via, J.
    Santamaria, I.
    [J]. 2012 IEEE 7TH SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP (SAM), 2012, : 105 - 108
  • [32] An Efficient Successive Relaying Protocol for Multiple-Relay Cooperative Networks
    Hu, Yongxu
    Li, Kwok Hung
    Teh, Kah Chan
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2012, 11 (05) : 1892 - 1899
  • [33] An adaptive Multiple-relay selection in Vehicular Delay Tolerant Networks
    Mu, DiXiao
    Ahmed, Syed Hassan
    Lee, Sungwon
    Guizani, Nadra
    Kim, Dongkyun
    [J]. GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE, 2017,
  • [34] Practical Polar Code Construction For Degraded Multiple-Relay Networks
    Duo, Bin
    Zhong, Xiaoling
    Guo, Yong
    [J]. CHINA COMMUNICATIONS, 2017, 14 (04) : 127 - 139
  • [35] Learning for Multiple-Relay Selection in a Vehicular Delay Tolerant Network
    Dong, Yuzhen
    Zhang, Fuquan
    Joe, Inwhee
    Lin, Haifeng
    Jiao, Wanguo
    Zhang, Yan
    [J]. IEEE ACCESS, 2020, 8 : 175602 - 175611
  • [36] A Multiple-Relay Communication Protocol for Achieving Fairness in Dense Networks
    Torrea-Duran, Rodolfo
    Rosas, Fernando
    Pollin, Sofie
    Vandendorpe, Luc
    Moonen, Marc
    [J]. IEEE ACCESS, 2018, 6 : 6740 - 6754
  • [37] Practical Polar Code Construction For Degraded Multiple-Relay Networks
    Bin Duo
    Xiaoling Zhong
    Yong Guo
    [J]. China Communications, 2017, 14 (04) : 127 - 139
  • [38] Multiple-Source Multiple-Relay Cooperation System
    Zhang, Jun
    Lok, Tat M.
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 3735 - 3740
  • [39] Secure Transmission of Wireless Relaying Systems With Jammer and Multiple-User Selection
    yang, Yijun
    Chen, Jin
    Huang, Yuzhen
    Wang, Ximing
    Liu, Jiequn
    [J]. IEEE ACCESS, 2017, 5 : 8771 - 8779
  • [40] Multiple-User Cooperative Communications Based on Linear Network Coding
    Xiao, Ming
    Skoglund, Mikael
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (12) : 3345 - 3351