无线协作传输策略及其性能的研究
|
摘要
衡量一个通信系统性能优劣主要是考察其有效性、可靠性和安全性这三方面性能。与有线通信相比,无线通信在有效性、可靠性和安全性方面面临更为严峻的挑战：一方面,多径衰落效应将导致接收信号畸变、信噪比较低,从而影响信息传输有效性和可靠性：另一方面,无线信道的开放性将导致传输信息易被窃听器截获,从而使得信息传输的安全性降低。近年来,MIMO技术和协作通信技术被认为是改善和提高无线通信系统这三方面性能的有效手段,受到学术界和产业界的广泛关注和深入研究。无线协作通信技术的核心研究内容是设计有效的协作传输策略,使得无线通信系统在有效性、可靠性或者安全性方面的性能得到明显的改善。
众所周知,复用增益与分集增益分别是评价MIMO无线通信系统有效性和可靠性的性能指标。已有的研究表明,复用增益和分集增益之间是此消彼长的关系,即高复用增益会导致较低的分集增益,反之亦然；分集复用折中(DMT)正是反映了分集增益和复用增益之间的这种折中关系。因此,通过分析DMT性能来评估协作传输系统有效性和可靠性是一个合理的选择。另外,衡量传输系统安全性的性能指标通常采用“安全速率”,其含义是授权用户能正确解码、而窃听器不能解码的信息传输速率。
本文针对几种典型的无线协作通信场景,研究基于DMT优化或者安全速率优化的无线协作传输策略。在对抗多径衰落方面,设计更为有效的多中继协作传输策略,优化系统的DMT性能；在对抗窃听方面,设计更为有效的混合式协作传输策略,达到更大的安全速率。本文主要研究内容与贡献如下：
1)对于多中继点对点信道模型,提出了一种基于中继复用的协作传输策略。该策略的基本思想是用两个半双工中继模拟一个全双工中继,克服中继的半双工限制；另外,该策略融合了分层中继选择和线性迫零算法,其中分层中继选择保证了最优的分集增益,而复杂度较低的迫零算法用于消除中继间干扰。理论分析和Monte Carlo仿真实验表明该策略能优化系统的DMT性能,并且能逼近多输入单输出(MISO)系统的最优上界。
2)对于多中继多接入信道模型,提出了一种基于叠加编码和中继复用的协作传输策略。该协作策略的特点是保证每个源信息能在各个源端以及中继上被发送,从而实现源端之间以及源端与中继之间的完全协作,从而达到该系统的最优分集增益。理论分析和Monte Carlo仿真实验表明,该策略能优化系统DMT性能,并且能逼近最优MISO系统的上界。
3)对于中继窃听信道,提出了三种混合式协作传输策略：基于有噪网络编码(NNC)的策略、基于部分解码前传(PaDF)的策略、基于人工状态(AS)的策略。第一种协作策略融合了NNC压缩前传技术和干扰协助技术,其中的NNC压缩前传技术是为了提升授权用户间的通信能力,而干扰协助技术是为了抑制窃听信道,从而达到帮助主信道、同时抑制窃听信道的效果。第二种协作策略利用叠加编码、反向解码等基本编解码方法,融合部分解码前传技术和噪声前传技术,以提升授权用户间的通信能力、同时抑制窃听信道。第三种协作策略融合了人工状态和噪声前传技术,其中的人工状态是由源端产生,它联合中继产生的干扰信息可以有效地抑制窃听信道,而不对目的端产生任何损害。这种协作策略的特点是中继不接收任何源端信息,因而不受源端到中继信道质量的影响。
另外,针对高斯中继窃听信道,对以上三种协作传输策略作了具体的设计,并利用信息论安全基础理论分析了它们的可达安全速率。理论分析和数值结果均表明所提协作策略可以提升系统的安全性能。
4)对于具有“会议”的多接入窃听信道,提出了一种基于Willems编码的混合式协作传输策略。其基本思想是融合Willems编码和Wyner的随机盒子技术,既可以通过“会议”链路提升源到目的端的通信能力,又能通过多接入窃听信道抑制窃听器的窃听能力。另外,利用信息论安全基础理论分析了该策略的可达安全速率域以及安全容量域的外界。
基于以上所提协作策略,并针对高斯多接入窃听信道,设计了两种具体实现方案：基于多路复用的方案和基于协作时分多址接入的方案。理论分析和数值计算结果表明,源端之间的“会议”链路能有效提升系统安全性以及各个源端的安全速率。
Efficiency, reliability and security are usualy used to measure the performance of a communication system. Compared to wire communications, it is more chanllegning to guarantee efficiency, reliability and security in wireless communications. On the one hand, multipath fading may lead to distorted signals and low signal-to-noise ratio at the receivers, and hence affects efficiency and reliability of the transmissions. On the other hand, due to the open nature of wireless channels, secure messages may be intercepted by eavesdroppers, so the transmission security is offen at high risk. In recent years, MIMO technique and cooperative communication technique are recognized as effective approaches to enhance the performance of wireless communications, which attract a lot of attention in both academic and industrial areas. The crucial content of the technique of wireless cooperative communications is to design effective cooperative transmission strategies, which can improve efficiency, reliability and security in wireless communications.
It is well known that multiplexing gain and diversity gain are usualy used to evaluate efficiency and reliability in MIMO wireless systems, respectively. Existing works have shown that a higher multiplexing gain will lead to a lower diversity gain, vice versa; and Diversity-Multiplexing Tradeoff (DMT) reflects the tradeoff relationship between diversity gain and multiplexing gain. Therefore, DMT is a suitable information-theoretic criterion to evaluate the efficiency and reliability in wireless transmissions. In addition,"secrecy rate", the rate of a secret message, is usually used to measure the security level of wireless transmissions. Here a message is said to be "secret" if it can be correctly decode by logical users, but cannot be intercepted by eavesdroppers.
For several typical wireless cooperative channel models, this dissertation is devoted to proposing wireless cooperative strategies which can enhance the DMT performance or enlarge the secrecy rates. For combating multipath fading, more effective multi-relay cooperative transmission strategies will be proposed, which can enhance the DMT performance; for combating eavesdropping, more effective hybrid cooperative transmission strategies will be proposed, which can enlarge the secrecy rates. The main works and contributions are listed as follows:
1) For the multi-relay point-to-point channel model, this dissertation proposes a cooperative transmission strategy which is based on the concept of "relay reuse". The basic idea is to use two half-duplex relays to mimic a full-duplex relay, which can overcome the half-duplex constraint. Moreover, this strategy combines the layered relay selection and the linear zero-forcing detection, where the layered relay selection is to ensure the optimal diversity gain, and the zero-forcing detection with low complexity is to cancel inter-relay interference. The theoretic analysis and Monte Carlo simulations show that, the proposed strategy can enhance the DMT performance and approach the MISO upper bound of the system.
2) For the multi-relay multi-access channel model, this dissertation proposes a cooperative transmission strategy which is based on a superposition code and the "relay reuse" concept. The key feature of this cooperative strategy is that, it ensures each source message can be transmitted by each source and each relay. So this cooperative strategy realizes the "full cooperation" which is formed by the cooperation between sources and the cooperation from relays, and can achieve the optimal diversity gain of the considered system. The theoretic analysis and Monte Carlo simulations have shown that, the proposed strategy can enhance the DMT performance and approximately achieve the MISO upper bound of the system.
3) For the relay-eavesdropper channel, this dissertation proposes three hybrid cooperative transmission strategies:the one based on noisy network coding (NNC), the one based on partial decode-forward (PaDF) and the one based on artificial state (AS). The first cooperative strategy combines the NNC compress-forward technique and the interference-assisted technique, where NNC is to enhance the communication capability between logical users, and the interference-assisted technique is to confuse the eavesdropper. So it can enhance the main channel and suppress the eavesdropper channel at the same time. The second cooperative strategy utilizes some basic encoding and decoding methods, such as superposition coding and backward decoding, in order to combine the partial decode-forward technique and the noise forward technique, which can enhance the communication capability between logical users and suppress the eavesdropper channel. The third cooperative strategy combines artificial state and the noise forward technique. Here artificial state is generated at the source, which can associate with the interference generated at the relay to effectively confuse the eavesdropper, but does not affect the destination. The key feature of this strategy is that the relay does not receive any signals from the source, and hence is not affected by the source-relay channel condition.
In addition, for the Gaussian relay-eavesdropper channel, the above three cooperative transmission strategies are specified according to Gaussian characteristic. Furthermore, their achievable secrecy rates are analyzed based on information-theoretic security. Analysis and numerical results have shown that the proposed cooperative strategies can enhance the system's secrecy level.
4) For the conferencing multiple access channel with an eavesdropper (CMAC-E), this dissertation proposeds a hybrid cooperative transmission strategy, which is based on Willems'coding. The basic idea is to combine Willems'coding and Wyner's random binning; the key feature is that it can enhance the communication capability from sources to the destination via the "conference" links, and suppress the eavesdropper's capability via the multiple access channel. Moreover, the inner bound (i.e., achievable secrecy rate region) and outer bound on the secrecy capacity of the addressed channel is analyzed based on information-theoretic security.
For the Gaussian CMAC-E channel, two particular transmission schemes are proposed:the multiplexed scheme and the cooperative time division multiple-access (TDMA) scheme. Analysis and numerical results have shown that the "conference" links between sources can effectively enhance the system's secrecy level and each source's secrecy rate.
众所周知,复用增益与分集增益分别是评价MIMO无线通信系统有效性和可靠性的性能指标。已有的研究表明,复用增益和分集增益之间是此消彼长的关系,即高复用增益会导致较低的分集增益,反之亦然；分集复用折中(DMT)正是反映了分集增益和复用增益之间的这种折中关系。因此,通过分析DMT性能来评估协作传输系统有效性和可靠性是一个合理的选择。另外,衡量传输系统安全性的性能指标通常采用“安全速率”,其含义是授权用户能正确解码、而窃听器不能解码的信息传输速率。
本文针对几种典型的无线协作通信场景,研究基于DMT优化或者安全速率优化的无线协作传输策略。在对抗多径衰落方面,设计更为有效的多中继协作传输策略,优化系统的DMT性能；在对抗窃听方面,设计更为有效的混合式协作传输策略,达到更大的安全速率。本文主要研究内容与贡献如下：
1)对于多中继点对点信道模型,提出了一种基于中继复用的协作传输策略。该策略的基本思想是用两个半双工中继模拟一个全双工中继,克服中继的半双工限制；另外,该策略融合了分层中继选择和线性迫零算法,其中分层中继选择保证了最优的分集增益,而复杂度较低的迫零算法用于消除中继间干扰。理论分析和Monte Carlo仿真实验表明该策略能优化系统的DMT性能,并且能逼近多输入单输出(MISO)系统的最优上界。
2)对于多中继多接入信道模型,提出了一种基于叠加编码和中继复用的协作传输策略。该协作策略的特点是保证每个源信息能在各个源端以及中继上被发送,从而实现源端之间以及源端与中继之间的完全协作,从而达到该系统的最优分集增益。理论分析和Monte Carlo仿真实验表明,该策略能优化系统DMT性能,并且能逼近最优MISO系统的上界。
3)对于中继窃听信道,提出了三种混合式协作传输策略：基于有噪网络编码(NNC)的策略、基于部分解码前传(PaDF)的策略、基于人工状态(AS)的策略。第一种协作策略融合了NNC压缩前传技术和干扰协助技术,其中的NNC压缩前传技术是为了提升授权用户间的通信能力,而干扰协助技术是为了抑制窃听信道,从而达到帮助主信道、同时抑制窃听信道的效果。第二种协作策略利用叠加编码、反向解码等基本编解码方法,融合部分解码前传技术和噪声前传技术,以提升授权用户间的通信能力、同时抑制窃听信道。第三种协作策略融合了人工状态和噪声前传技术,其中的人工状态是由源端产生,它联合中继产生的干扰信息可以有效地抑制窃听信道,而不对目的端产生任何损害。这种协作策略的特点是中继不接收任何源端信息,因而不受源端到中继信道质量的影响。
另外,针对高斯中继窃听信道,对以上三种协作传输策略作了具体的设计,并利用信息论安全基础理论分析了它们的可达安全速率。理论分析和数值结果均表明所提协作策略可以提升系统的安全性能。
4)对于具有“会议”的多接入窃听信道,提出了一种基于Willems编码的混合式协作传输策略。其基本思想是融合Willems编码和Wyner的随机盒子技术,既可以通过“会议”链路提升源到目的端的通信能力,又能通过多接入窃听信道抑制窃听器的窃听能力。另外,利用信息论安全基础理论分析了该策略的可达安全速率域以及安全容量域的外界。
基于以上所提协作策略,并针对高斯多接入窃听信道,设计了两种具体实现方案：基于多路复用的方案和基于协作时分多址接入的方案。理论分析和数值计算结果表明,源端之间的“会议”链路能有效提升系统安全性以及各个源端的安全速率。
Efficiency, reliability and security are usualy used to measure the performance of a communication system. Compared to wire communications, it is more chanllegning to guarantee efficiency, reliability and security in wireless communications. On the one hand, multipath fading may lead to distorted signals and low signal-to-noise ratio at the receivers, and hence affects efficiency and reliability of the transmissions. On the other hand, due to the open nature of wireless channels, secure messages may be intercepted by eavesdroppers, so the transmission security is offen at high risk. In recent years, MIMO technique and cooperative communication technique are recognized as effective approaches to enhance the performance of wireless communications, which attract a lot of attention in both academic and industrial areas. The crucial content of the technique of wireless cooperative communications is to design effective cooperative transmission strategies, which can improve efficiency, reliability and security in wireless communications.
It is well known that multiplexing gain and diversity gain are usualy used to evaluate efficiency and reliability in MIMO wireless systems, respectively. Existing works have shown that a higher multiplexing gain will lead to a lower diversity gain, vice versa; and Diversity-Multiplexing Tradeoff (DMT) reflects the tradeoff relationship between diversity gain and multiplexing gain. Therefore, DMT is a suitable information-theoretic criterion to evaluate the efficiency and reliability in wireless transmissions. In addition,"secrecy rate", the rate of a secret message, is usually used to measure the security level of wireless transmissions. Here a message is said to be "secret" if it can be correctly decode by logical users, but cannot be intercepted by eavesdroppers.
For several typical wireless cooperative channel models, this dissertation is devoted to proposing wireless cooperative strategies which can enhance the DMT performance or enlarge the secrecy rates. For combating multipath fading, more effective multi-relay cooperative transmission strategies will be proposed, which can enhance the DMT performance; for combating eavesdropping, more effective hybrid cooperative transmission strategies will be proposed, which can enlarge the secrecy rates. The main works and contributions are listed as follows:
1) For the multi-relay point-to-point channel model, this dissertation proposes a cooperative transmission strategy which is based on the concept of "relay reuse". The basic idea is to use two half-duplex relays to mimic a full-duplex relay, which can overcome the half-duplex constraint. Moreover, this strategy combines the layered relay selection and the linear zero-forcing detection, where the layered relay selection is to ensure the optimal diversity gain, and the zero-forcing detection with low complexity is to cancel inter-relay interference. The theoretic analysis and Monte Carlo simulations show that, the proposed strategy can enhance the DMT performance and approach the MISO upper bound of the system.
2) For the multi-relay multi-access channel model, this dissertation proposes a cooperative transmission strategy which is based on a superposition code and the "relay reuse" concept. The key feature of this cooperative strategy is that, it ensures each source message can be transmitted by each source and each relay. So this cooperative strategy realizes the "full cooperation" which is formed by the cooperation between sources and the cooperation from relays, and can achieve the optimal diversity gain of the considered system. The theoretic analysis and Monte Carlo simulations have shown that, the proposed strategy can enhance the DMT performance and approximately achieve the MISO upper bound of the system.
3) For the relay-eavesdropper channel, this dissertation proposes three hybrid cooperative transmission strategies:the one based on noisy network coding (NNC), the one based on partial decode-forward (PaDF) and the one based on artificial state (AS). The first cooperative strategy combines the NNC compress-forward technique and the interference-assisted technique, where NNC is to enhance the communication capability between logical users, and the interference-assisted technique is to confuse the eavesdropper. So it can enhance the main channel and suppress the eavesdropper channel at the same time. The second cooperative strategy utilizes some basic encoding and decoding methods, such as superposition coding and backward decoding, in order to combine the partial decode-forward technique and the noise forward technique, which can enhance the communication capability between logical users and suppress the eavesdropper channel. The third cooperative strategy combines artificial state and the noise forward technique. Here artificial state is generated at the source, which can associate with the interference generated at the relay to effectively confuse the eavesdropper, but does not affect the destination. The key feature of this strategy is that the relay does not receive any signals from the source, and hence is not affected by the source-relay channel condition.
In addition, for the Gaussian relay-eavesdropper channel, the above three cooperative transmission strategies are specified according to Gaussian characteristic. Furthermore, their achievable secrecy rates are analyzed based on information-theoretic security. Analysis and numerical results have shown that the proposed cooperative strategies can enhance the system's secrecy level.
4) For the conferencing multiple access channel with an eavesdropper (CMAC-E), this dissertation proposeds a hybrid cooperative transmission strategy, which is based on Willems'coding. The basic idea is to combine Willems'coding and Wyner's random binning; the key feature is that it can enhance the communication capability from sources to the destination via the "conference" links, and suppress the eavesdropper's capability via the multiple access channel. Moreover, the inner bound (i.e., achievable secrecy rate region) and outer bound on the secrecy capacity of the addressed channel is analyzed based on information-theoretic security.
For the Gaussian CMAC-E channel, two particular transmission schemes are proposed:the multiplexed scheme and the cooperative time division multiple-access (TDMA) scheme. Analysis and numerical results have shown that the "conference" links between sources can effectively enhance the system's secrecy level and each source's secrecy rate.
引文
[1]A. Khisti and G.W. Wornell. Secure transmission with multiple antennas-Part Ⅱ:The MIMOME wiretap channel[J]. IEEE Transactions on Information Theory,2010,56(11):5515-5532.
[2]S. Goel and R. Negi. Guaranteeing secrecy using artificial noise[J]. IEEE Transactions on Wireless Communications,2008,7(6):2180-2189.
[3]L. Zheng and D.N.C. Tse. Diversity and multiplexing:A fundamental tradeoff in multiple-antenna channels[J]. IEEE Transactions on Information Theory,2003,49(5):1073-1096.
[4]D.N.C. Tse, P. Viswanath, and L. Zheng. Diversity-multiplexing tradeoff in multiple-access channels[J]. IEEE Transactions on Information Theory,2004,50(9):1859-1874.
[5]J.N. Laneman, D.N. Tse, and G.W. Wornell. Cooperative diversity in wireless networks:Efficient protocols and outage behavior[J]. IEEE Transactions on Information Theory,2004,50(12): 3062-3080.
[6]A. Bletsas, A. Khisti, D.P. Reed, et al. A simple cooperative diversity method based on network path selection[J]. IEEE Journal on Selected Areas in Communications,2006,24(3):659-672.
[7]K. Azarian, H. El Gamal, and P. Schniter. On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels[J]. IEEE Transactions on Information Theory,2005,51(12): 4152-4172.
[8]N. Prasad and M.K. Varanasi. High performance static and dynamic cooperative communication protocols for the half duplex fading relay channel[J]. IEEE Transactions on Wireless Communications,2010,9(1):328-337.
[9]S. Yang and J.-C. Belfiore. Towards the optimal amplify-and-forward cooperative diversity scheme[J]. IEEE Transactions on Information Theory,2007,53(9):3114-3126.
[10]B. Rankov and A. Wittneben. Spectral efficient protocols for half-duplex fading relay channels[J]. IEEE Journal on Selected Areas in Communications,2007,25(2):379-389.
[11]W. Chang, S.-Y. Chung, and Y.H. Lee. Capacity bounds for alternating two-path relay channels[C] //in Proceedings of of the Allerton Conference on Communications, Control and Computing, 2007.
[12]R. Zhang. Characterizing achievable rates for two-path digital relaying[C]//in Proceedings of IEEE International Conference on Communications 2008:1113-1117.
[13]R. Tannious and A. Nosratinia. Spectrally-efficient relay selection with limited feedback[J]. IEEE Journal on Selected Areas in Communications,2008,26(8):1419-1428.
[14]Y. Fan, C. Wang, J. Thompson, et al. Recovering multiplexing loss through successive relaying using repetition coding[J]. IEEE Transactions on Wireless Communications,2007,6(12): 4484-4493.
[15]H. Wicaksana, S.H. Ting, C.K. Ho, et al. AF two-path half duplex relaying with inter-relay self interference cancellation:diversity analysis and its improvement[J]. IEEE Transactions on Wireless Communications,2009,8(9):4720-4729.
[16]C. Wang, Y. Fan, J.S. Thompson, et al. Approaching the optimal diversity-multiplexing tradeoff in a four-node cooperative network[J]. IEEE Transactions on Wireless Communications,2010,9(12): 3690-3700.
[17]Z. Ding, T. Ratnarajah, and C.C. Cowan. On the diversity-multiplexing tradeoff for wireless cooperative multiple access systems[J]. IEEE Transactions on Signal Processing,2007,55(9): 4627-4638.
[18]E.G. Larsson and B.R. Vojcic. Cooperative transmit diversity based on superposition modulation[J]. IEEE Communications Letters,2005,9(9):778-780.
[19]C. Wang, Y. Fan, I. Krikidis, et al. Superposition-coded concurrent decode-and-forward relaying[C]//in Proceedings of IEEE International Symposium on Information Theory,2008: 2390-2394.
[20]C. Wang, Y. Fan, J.S. Thompson, et al.. A comprehensive study of repetition-coded protocols in multi-user multi-relay networks[J]. IEEE Transactions on Wireless Communications,2009,8(8): 4329-4339.
[21]Z. Ding, K.K. Leung, D.L. Goeckel, et al. A relay assisted cooperative transmission protocol for wireless multiple access systems[J]. IEEE Transactions on Communications,2010,58(8): 2425-2435.
[22]M. Xiao, J. Kliewer, and M. Skoglund. Design of network codes for multiple-user multiple-relay wireless networks[J]. IEEE Transactions on Communications,2012,60(12):3755-3766.
[23]C. Wang, M. Xiao, and M. Skoglund. Diversity-multiplexing tradeoff analysis of coded multi-user relay networks[J]. IEEE Transactions on Communications,2011,59(7):1995-2005.
[24]C. Wang, H. Farhadi, and M. Skoglund. Achieving the degrees of freedom of wireless multi-user relay networks[J]. IEEE Transactions on Communications,2012,60(9):2612-2622.
[25]C.E. Shannon. Communication theory of secrecy systems[J]. Bell system technical journal,1949, 28(4):656-715.
[26]A.D. Wyner. The wire-tap channel[J]. Bell Syst. Tech. J.,1975,54:1355-1387.
[27]I. Csiszar and J. Korner. Broadcast channels with confidential messages[J]. IEEE Transactions on Information Theory,1978,24(3):339-348.
[28]S. Leung-Yan-Cheong and M.E. Hellman. The Gaussian wire-tap channel[J]. IEEE Transactions on Information Theory,1978,24(4):451-456.
[29]L. Lifeng and H. El Gamal. The relay-eavesdropper channel:Cooperation for secrecy[J]. IEEE Transactions on Information Theory 2008,54(9):4005-4019.
[30]A. Vaneet, S. Lalitha, C. A Robert, et al. Secrecy capacity of a class of orthogonal relay eavesdropper channels[J]. EURASIP Journal on Wireless Communications and Networking,2009, 2009.
[31]E. Tekin and A. Yener. The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming[J]. IEEE Transactions on Information Theory 2008, 54(6):2735-2751.
[32]T. Xiaojun, L. Ruoheng, P. Spasojevic, et al. Interference Assisted Secret Communication[J]. IEEE Transactions on Information Theory,2011,57(5):3153-3167.
[33]Z.H. Awan, A. Zaidi, and L. Vandendorpe. Secure communication over parallel relay channel[J]. IEEE Transactions on Information Forensics and Security,2012,7(2):359-371.
[34]Z.H. Awan, A. Zaidi, and L. Vandendorpe. Multiaccess Channel With Partially Cooperating Encoders and Security Constraints[J]. IEEE Transactions on Information Forensics and Security, 2013,8(7):1243-1254.
[35]X. Tang, R. Liu, P. Spasojevic, et al. Multiple access channels with generalized feedback and confidential messages[C]//in Proceedings of IEEE Information Theory Workshop,2007: 608-613.
[36]O. Simeone and A. Yener. The cognitive multiple access wire-tap channel[C]//in Proceedings of 43rd Annual Conference on Information Sciences and Systems (CISS) 2009:158-163.
[37]E. Tekin and A. Yener. The Gaussian multiple access wire-tap channel[J]. IEEE Transactions on Information Theory 2008,54(12):5747-5755.
[38]B. Dai. Multiple-Access Relay Wiretap Channel[J/OL]. arXiv preprint arXiv:1403.7883,2014.
[39]Y. Oohama, Relay channels with confidential messages[J/OL]. arXiv preprint cs/0611125,2006.
[40]X. He and A. Yener. Cooperation with an untrusted relay:A secrecy perspective[J]. IEEE Transactions on Information Theory,2010,56(8):3807-3827.
[41]X. He and A. Yener. Two-hop secure communication using an untrusted relay:a case for cooperative jamming[C]//in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM),2008:1-5.
[42]R. Liu, I. Maric, R.D. Yates, et al. The discrete memoryless multiple access channel with confidential messages[C]//in Proceedings of IEEE International Symposium on Information Theory (ISIT),2006:957-961.
[43]Y. Liang and H.V. Poor. Multiple-access channels with confidential messages[J]. IEEE Transactions on Information Theory,2008,54(3):976-1002.
[44]E. Ekrem and S. Ulukus. Effects of cooperation on the secrecy of multiple access channels with generalized feedback[C]//in Proceedings of 42nd Annual Conference on Information Sciences and Systems (CISS),2008:791-796.
[45]R. Liu, I. Maric, P. Spasojevic, et al. Discrete memoryless interference and broadcast channels with confidential messages:Secrecy rate regions[J]. IEEE Transactions on Information Theory, 2008,54(6):2493-2507.
[46]Y. Liang, A. Somekh-Baruch, H.V. Poor, et al., Capacity of cognitive interference channels with and without secrecy[J]. IEEE Transactions on Information Theory,2009,55(2):604-619.
[47]O.O. Koyluoglu and H. El Gamal. Cooperative encoding for secrecy in interference channels[J]. IEEE Transactions on Information Theory,2011,57(9):5682-5694.
[1]T.M. Cover and J.A. Thomas. Elements of information theory [M].2nd ed. Wiley-Interscience. 2006.
[2]E. Telatar. Capacity of Multi-antenna Gaussian Channels[J]. European transactions on telecommunications,1999,10(6):585-595.
[3]L. Zheng and D.N.C. Tse. Diversity and multiplexing:A fundamental tradeoff in multiple-antenna channels[J]. IEEE Transactions on Information Theory,2003,49(5):1073-1096.
[4]A.D. Wyner. The wire-tap channel[J]. Bell Syst. Tech. J.,1975,54:1355-1387.
[5]S. Leung-Yan-Cheong and M.E. Hellman. The Gaussian wire-tap channel[J]. IEEE Transactions on Information Theory,1978,24(4):451-456.
[6]A. Khisti and G.W. Wornell. Secure transmission with multiple antennas-Part Ⅱ:The MIMOME wiretap channel[J]. IEEE Transactions on Information Theory,2010,56(11):5515-5532.
[1]L. Zheng and D.N.C. Tse. Diversity and multiplexing:A fundamental tradeoff in multiple-antenna channels[J]. IEEE Transactions on Information Theory,2003,49(5):1073-1096.
[2]J.N. Laneman, D.N. Tse, and G.W. Wornell. Cooperative diversity in wireless networks:Efficient protocols and outage behavior[J]. IEEE Transactions on Information Theory,2004,50(12): 3062-3080.
[3]A. Bletsas, A. Khisti, D.P. Reed, et al. A simple cooperative diversity method based on network path selection[J]. IEEE Journal on Selected Areas in Communications,2006,24(3):659-672.
[4]K. Azarian, H. El Gamal, and P. Schniter. On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels[J]. IEEE Transactions on Information Theory,2005,51(12): 4152-4172.
[5]N. Prasad and M.K. Varanasi. High performance static and dynamic cooperative communication protocols for the half duplex fading relay channel[J]. IEEE Transactions on Wireless Communications,2010,9(1):328-337.
[6]S. Yang and J.-C. Belfiore. Towards the optimal amplify-and-forward cooperative diversity scheme[J]. IEEE Transactions on Information Theory,2007,53(9):3114-3126.
[7]B. Rankov and A. Wittneben. Spectral efficient protocols for half-duplex fading relay channels[J]. IEEE Journal on Selected Areas in Communications,2007,25(2):379-389.
[8]W. Chang, S.-Y. Chung, and Y.H. Lee. Capacity bounds for alternating two-path relay channels[C] //in Proceedings of of the Allerton Conference on Communications, Control and Computing, 2007.
[9]R. Zhang. Characterizing achievable rates for two-path digital relaying[C]//in Proceedings of IEEE International Conference on Communications 2008:1113-1117.
[10]R. Tannious and A. Nosratinia. Spectrally-efficient relay selection with limited feedback[J]. IEEE Journal on Selected Areas in Communications,2008,26(8):1419-1428.
[11]Y. Fan, C. Wang, J. Thompson, et al. Recovering multiplexing loss through successive relaying using repetition coding[J]. IEEE Transactions on Wireless Communications,2007,6(12): 4484.4493.
[12]H. Wicaksana, S.H. Ting, C.K. Ho, et al. AF two-path half duplex relaying with inter-relay self interference cancellation:diversity analysis and its improvement[J]. IEEE Transactions on Wireless Communications,2009,8(9):4720-4729.
[13]C. Wang, Y. Fan, J.S. Thompson, et al. Approaching the optimal diversity-multiplexing tradeoff in a four-node cooperative network[J]. IEEE Transactions on Wireless Communications,2010,9(12): 3690-3700.
[14]Z. Ding and K.K. Leung. On the Design of Opportunistic Decode-Forward Cooperative Transmission Protocol[C]//in Proceedings of the 2nd Annual Conference of the International Technology Alliance (ACITA 2008),2008:1-11.
[15]C.Y. Leow, Z. Ding, and K.K. Leung. Linear precoded cooperative transmission protocol for wireless broadcast channels[J]. IEEE Transactions on Vehicular Technology,2011,60(7): 3509-3515.
[16]Z. Ding, T. Ratnarajah, and C.C. Cowan. On the diversity-multiplexing tradeoff for wireless cooperative multiple access systems[J]. IEEE Transactions on Signal Processing,2007,55(9): 4627-4638.
[17]A. Jeffrey and D. Zwillinger, Table of integrals, series, and products[M].7th ed. Academic Press, 2007.
[18]P.A. Becker. On the integration of products of Whittaker functions with respect to the second index[J]. Journal of Mathematical Physics,2004,45(2):761-773.
[1]D.N.C. Tse, P. Viswanath, and L. Zheng. Diversity-multiplexing tradeoff in multiple-access channels[J]. IEEE Transactions on Information Theory,2004,50(9):1859-1874.
[2]K. Azarian, H. El Gamal, and P. Schniter. On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels[J]. IEEE Transactions on Information Theory,2005,51(12): 4152-4172.
[3]Z. Ding, T. Ratnarajah, and C.C. Cowan. On the diversity-multiplexing tradeoff for wireless cooperative multiple access systems[J]. IEEE Transactions on Signal Processing,2007,55(9): 4627-4638.
[4]E.G. Larsson and B.R. Vojcic. Cooperative transmit diversity based on superposition modulation[J]. IEEE Communications Letters,2005,9(9):778-780.
[5]C. Wang, Y. Fan, I. Krikidis, et al. Superposition-coded concurrent decode-and-forward relaying[C]//in Proceedings of IEEE International Symposium on Information Theory,2008: 2390-2394.
[6]C. Wang, Y. Fan, J.S. Thompson, et al. A comprehensive study of repetition-coded protocols in multi-user multi-relay networks[J]. IEEE Transactions on Wireless Communications,2009,8(8): 4329-4339.
[7]Z. Ding, K.K. Leung, D.L. Goeckel, et al. A relay assisted cooperative transmission protocol for wireless multiple access systems[J]. IEEE Transactions on Communications,2010,58(8): 2425-2435.
[8]M. Xiao, J. Kliewer, and M. Skoglund. Design of network codes for multiple-user multiple-relay wireless networks[J]. IEEE Transactions on Communications,2012,60(12):3755-3766.
[9]C. Wang, M. Xiao, and M. Skoglund. Diversity-multiplexing tradeoff analysis of coded multi-user relay networks[J], IEEE Transactions on Communications,2011,59(7):1995-2005.
[10]C. Wang, H. Farhadi, and M. Skoglund. Achieving the degrees of freedom of wireless multi-user relay networks[J]. IEEE Transactions on Communications,2012,60(9):2612-2622.
[11]J.N. Laneman, D.N. Tse, and G.W. Wornell. Cooperative diversity in wireless networks:Efficient protocols and outage behavior[J]. IEEE Transactions on Information Theory,2004,50(12): 3062-3080.
[12]C.Y. Leow, Z. Ding, and K.K. Leung. Linear precoded cooperative transmission protocol for wireless broadcast channels[J]. IEEE Transactions on Vehicular Technology,2011,60(7): 3509-3515.
[13]D. Tse, Fundamentals of wireless communication[M]. Cambridge university press,2005.
[14]Y. Fan, C. Wang, J. Thompson, et al. Recovering multiplexing loss through successive relaying using repetition coding[J]. IEEE Transactions on Wireless Communications,2007,6(12): 4484-4493.
[15]Z. Ding, K.K. Leung, D.L. Goeckel, et al. A relay assisted cooperative transmission protocol for wireless multiple access systems[J]. IEEE Transactions on Communications,2010,58(8): 2425-2435.
[16]D.N.C. Tse, P. Viswanath, and L. Zheng. Diversity-multiplexing tradeoff in multiple-access channels[J]. IEEE Transactions on Information Theory,2004,50(9):1859-1874.
[17]G.H. Golub and C.F. Van Loan. Matrix computations[M].3rd ed. John Hopkins Univerity Press, 1996.
[18]Z. Ding and K.K. Leung. On the Design of Opportunistic Decode-Forward Cooperative Transmission Protocol[C]//in Proceedings of the 2nd Annual Conference of the International Technology Alliance (ACITA 2008),2008:1-11.
[19]C. Wang, Y. Fan, J.S. Thompson, et al. A comprehensive study of repetition-coded protocols in multi-user multi-relay networks[J]. IEEE Transactions on Wireless Communications,2009,8(8): 4329-4339.
[20]L.H. Grokop and D.N. Tse. Diversity-multiplexing tradeoff in ISI channels[J]. IEEE Transactions on Information Theory,2009,55(1):109-135.
[21]L. Zheng and D.N.C. Tse. Diversity and multiplexing:A fundamental tradeoff in multiple-antenna channels[J]. IEEE Transactions on Information Theory,2003,49(5):1073-1096.
[22]C. Wang, Y. Fan, J.S. Thompson, et al. Approaching the optimal diversity-multiplexing tradeoff in a four-node cooperative network[J]. IEEE Transactions on Wireless Communications,2010,9(12): 3690-3700.
[1]A.D. Wyner. The wire-tap channel[J]. Bell Syst. Tech.J.,1975,54:1355-1387.
[2]I. Csiszar and J. Korner. Broadcast channels with confidential messages[J]. IEEE Transactions on Information Theory,1978,24(3):339-348.
[3]S. Leung-Yan-Cheong and M.E. Hellman. The Gaussian wire-tap channel[J]. IEEE Transactions on Information Theory,1978,24(4):451-456.
[4]A. Khisti and G.W. Wornell. Secure transmission with multiple antennas-Part Ⅱ:The MIMOME wiretap channel[J]. IEEE Transactions on Information Theory,2010,56(11):5515-5532.
[5]S. Goel and R. Negi. Guaranteeing secrecy using artificial noise[J]. IEEE Transactions on Wireless Communications,2008,7(6):2180-2189.
[6]L. Lifeng and H. El Gamal. The relay-eavesdropper channel:Cooperation for secrecy[J]. IEEE Transactions on Information Theory 2008,54(9):4005-4019.
[7]A. Vaneet, S. Lalitha, C. A Robert, et al. Secrecy capacity of a class of orthogonal relay eavesdropper channels[J]. EURASIP Journal on Wireless Communications and Networking,2009, 2009.
[8]T. Xiaojun, L. Ruoheng, P. Spasojevic, et al. Interference Assisted Secret Communication[J]. IEEE Transactions on Information Theory,2011,57(5):3153-3167.
[9]E. Tekin and A. Yener. The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming[J]. IEEE Transactions on Information Theory 2008, 54(6):2735-2751.
[10]Z.H. Awan, A. Zaidi, and L. Vandendorpe. Secure communication over parallel relay channel[J]. IEEE Transactions on Information Forensics and Security,2012,7(2):359-371.
[11]Z.H. Awan, A. Zaidi, and L. Vandendorpe. Multiaccess Channel With Partially Cooperating Encoders and Security Constraints[J]. IEEE Transactions on Information Forensics and Security, 2013,8(7):1243-1254.
[12]S. Lim, Y.-H. Kim, A. El Gamal, et al. Noisy network coding[J]. IEEE Transactions on Information Theory,2011,57(5):3132-3152.
[13]E. Tekin and A. Yener. The Gaussian multiple access wire-tap channel[J]. IEEE Transactions on Information Theory 2008,54(12):5747-5755.
[14]T. Cover and A.E. Gamal. Capacity theorems for the relay channel[J]. IEEE Transactions on Information Theory,1979,25(5):572-584.
[15]C. Yanling and A.J.H. Vinck. Wiretap Channel With Side Information[J]. IEEE Transactions on Information Theory,2008,54(1):395-402.
[16]S. Gel'Fand. Coding for channel with random parameters[J]. Probl. Contr. Inform. Theory,1980, 9(1):19-31.
[17]O.O. Koyluoglu and H. El Gamal. Cooperative encoding for secrecy in interference channels[J]. IEEE Transactions on Information Theory,2011,57(9):5682-5694.
[18]M.H. Costa. Writing on dirty paper (corresp.)[J]. IEEE Transactions on Information Theory,1983, 29(3):439-441.
[19]R. Liu, I. Marie, P. Spasojevic, et al. Discrete memoryless interference and broadcast channels with confidential messages:Secrecy rate regions[J]. IEEE Transactions on Information Theory, 2008,54(6):2493-2507.
[1]X. Tang, R. Liu, P. Spasojevic, et al. Multiple access channels with generalized feedback and confidential messages [C]//in Proceedings of IEEE Information Theory Workshop,2007: 608-613.
[2]O. Simeone and A. Yener. The cognitive multiple access wire-tap channel[C]//in Proceedings of 43rd Annual Conference on Information Sciences and Systems (CISS) 2009:158-163.
[3]E. Tekin and A. Yener. The Gaussian multiple access wire-tap channel[J]. IEEE Transactions on Information Theory 2008,54(12):5747-5755.
[4]E. Tekin and A. Yener. The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming[J]. IEEE Transactions on Information Theory 2008, 54(6):2735-2751.
[5]B. Dai. Multiple-Access Relay Wiretap Channel[J/OL]. arXiv preprint arXiv:1403.7883,2014.
[6]L. Lifeng and H. El Gamal. The relay-eavesdropper channel:Cooperation for secrecy[J]. IEEE Transactions on Information Theory 2008,54(9):4005-4019.
[7]T. Xiaojun, L. Ruoheng, P. Spasojevic, et al. Interference Assisted Secret Communication[J]. IEEE Transactions on Information Theory,2011,57(5):3153-3167.
[8]O.O. Koyluoglu and H. El Gamal. Cooperative encoding for secrecy in interference channels[J]. IEEE Transactions on Information Theory,2011,57(9):5682-5694.
[9]R. Liu, I. Marie, P. Spasojevic, et al. Discrete memoryless interference and broadcast channels with confidential messages:Secrecy rate regions[J]. IEEE Transactions on Information Theory, 2008,54(6):2493-2507.
[10]Y. Liang, A. Somekh-Baruch, H.V. Poor, et al. Capacity of cognitive interference channels with and without secrecy[J]. IEEE Transactions on Information Theory,2009,55(2):604-619.
[11]F. Willems. The discrete memoryless multiple access channel with partially cooperating encoders (corresp.)[J]. IEEE Transactions on Information Theory,1983,29(3):441-445.
[12]A.D. Wyner. The wire-tap channel[J]. Bell Syst. Tech. J.,1975,54:1355-1387.
[13]I. Csiszar and J. Korner. Broadcast channels with confidential messages[J]. IEEE Transactions on Information Theory,1978,24(3):339-348.
[14]S.I. Bross, A. Lapidoth, and M.A. Wigger. The Gaussian MAC with conferencing encoders[C] //in Proceedings of IEEE International Symposium on Information Theory (ISIT),2008: 2702-2706.
[15]A. Khisti and G.W. Wornell. Secure transmission with multiple antennas I:The MISOME wiretap channel[J]. IEEE Transactions on Information Theory,2010,56(7):3088-3104.
[16]F. Willems. Information-theoretical results for the discrete memoryless multiple access channel[D], Ph.D. dissertation, Leuven, Haverlee, Belgium:Katholieke Universiteit,1982.
[17]J. Thomas. Feedback can at most double Gaussian multiple access channel capacity (Corresp.)[J]. IEEE Transactions on Information Theory,1987,33(5):711-716.
[2]S. Goel and R. Negi. Guaranteeing secrecy using artificial noise[J]. IEEE Transactions on Wireless Communications,2008,7(6):2180-2189.
[3]L. Zheng and D.N.C. Tse. Diversity and multiplexing:A fundamental tradeoff in multiple-antenna channels[J]. IEEE Transactions on Information Theory,2003,49(5):1073-1096.
[4]D.N.C. Tse, P. Viswanath, and L. Zheng. Diversity-multiplexing tradeoff in multiple-access channels[J]. IEEE Transactions on Information Theory,2004,50(9):1859-1874.
[5]J.N. Laneman, D.N. Tse, and G.W. Wornell. Cooperative diversity in wireless networks:Efficient protocols and outage behavior[J]. IEEE Transactions on Information Theory,2004,50(12): 3062-3080.
[6]A. Bletsas, A. Khisti, D.P. Reed, et al. A simple cooperative diversity method based on network path selection[J]. IEEE Journal on Selected Areas in Communications,2006,24(3):659-672.
[7]K. Azarian, H. El Gamal, and P. Schniter. On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels[J]. IEEE Transactions on Information Theory,2005,51(12): 4152-4172.
[8]N. Prasad and M.K. Varanasi. High performance static and dynamic cooperative communication protocols for the half duplex fading relay channel[J]. IEEE Transactions on Wireless Communications,2010,9(1):328-337.
[9]S. Yang and J.-C. Belfiore. Towards the optimal amplify-and-forward cooperative diversity scheme[J]. IEEE Transactions on Information Theory,2007,53(9):3114-3126.
[10]B. Rankov and A. Wittneben. Spectral efficient protocols for half-duplex fading relay channels[J]. IEEE Journal on Selected Areas in Communications,2007,25(2):379-389.
[11]W. Chang, S.-Y. Chung, and Y.H. Lee. Capacity bounds for alternating two-path relay channels[C] //in Proceedings of of the Allerton Conference on Communications, Control and Computing, 2007.
[12]R. Zhang. Characterizing achievable rates for two-path digital relaying[C]//in Proceedings of IEEE International Conference on Communications 2008:1113-1117.
[13]R. Tannious and A. Nosratinia. Spectrally-efficient relay selection with limited feedback[J]. IEEE Journal on Selected Areas in Communications,2008,26(8):1419-1428.
[14]Y. Fan, C. Wang, J. Thompson, et al. Recovering multiplexing loss through successive relaying using repetition coding[J]. IEEE Transactions on Wireless Communications,2007,6(12): 4484-4493.
[15]H. Wicaksana, S.H. Ting, C.K. Ho, et al. AF two-path half duplex relaying with inter-relay self interference cancellation:diversity analysis and its improvement[J]. IEEE Transactions on Wireless Communications,2009,8(9):4720-4729.
[16]C. Wang, Y. Fan, J.S. Thompson, et al. Approaching the optimal diversity-multiplexing tradeoff in a four-node cooperative network[J]. IEEE Transactions on Wireless Communications,2010,9(12): 3690-3700.
[17]Z. Ding, T. Ratnarajah, and C.C. Cowan. On the diversity-multiplexing tradeoff for wireless cooperative multiple access systems[J]. IEEE Transactions on Signal Processing,2007,55(9): 4627-4638.
[18]E.G. Larsson and B.R. Vojcic. Cooperative transmit diversity based on superposition modulation[J]. IEEE Communications Letters,2005,9(9):778-780.
[19]C. Wang, Y. Fan, I. Krikidis, et al. Superposition-coded concurrent decode-and-forward relaying[C]//in Proceedings of IEEE International Symposium on Information Theory,2008: 2390-2394.
[20]C. Wang, Y. Fan, J.S. Thompson, et al.. A comprehensive study of repetition-coded protocols in multi-user multi-relay networks[J]. IEEE Transactions on Wireless Communications,2009,8(8): 4329-4339.
[21]Z. Ding, K.K. Leung, D.L. Goeckel, et al. A relay assisted cooperative transmission protocol for wireless multiple access systems[J]. IEEE Transactions on Communications,2010,58(8): 2425-2435.
[22]M. Xiao, J. Kliewer, and M. Skoglund. Design of network codes for multiple-user multiple-relay wireless networks[J]. IEEE Transactions on Communications,2012,60(12):3755-3766.
[23]C. Wang, M. Xiao, and M. Skoglund. Diversity-multiplexing tradeoff analysis of coded multi-user relay networks[J]. IEEE Transactions on Communications,2011,59(7):1995-2005.
[24]C. Wang, H. Farhadi, and M. Skoglund. Achieving the degrees of freedom of wireless multi-user relay networks[J]. IEEE Transactions on Communications,2012,60(9):2612-2622.
[25]C.E. Shannon. Communication theory of secrecy systems[J]. Bell system technical journal,1949, 28(4):656-715.
[26]A.D. Wyner. The wire-tap channel[J]. Bell Syst. Tech. J.,1975,54:1355-1387.
[27]I. Csiszar and J. Korner. Broadcast channels with confidential messages[J]. IEEE Transactions on Information Theory,1978,24(3):339-348.
[28]S. Leung-Yan-Cheong and M.E. Hellman. The Gaussian wire-tap channel[J]. IEEE Transactions on Information Theory,1978,24(4):451-456.
[29]L. Lifeng and H. El Gamal. The relay-eavesdropper channel:Cooperation for secrecy[J]. IEEE Transactions on Information Theory 2008,54(9):4005-4019.
[30]A. Vaneet, S. Lalitha, C. A Robert, et al. Secrecy capacity of a class of orthogonal relay eavesdropper channels[J]. EURASIP Journal on Wireless Communications and Networking,2009, 2009.
[31]E. Tekin and A. Yener. The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming[J]. IEEE Transactions on Information Theory 2008, 54(6):2735-2751.
[32]T. Xiaojun, L. Ruoheng, P. Spasojevic, et al. Interference Assisted Secret Communication[J]. IEEE Transactions on Information Theory,2011,57(5):3153-3167.
[33]Z.H. Awan, A. Zaidi, and L. Vandendorpe. Secure communication over parallel relay channel[J]. IEEE Transactions on Information Forensics and Security,2012,7(2):359-371.
[34]Z.H. Awan, A. Zaidi, and L. Vandendorpe. Multiaccess Channel With Partially Cooperating Encoders and Security Constraints[J]. IEEE Transactions on Information Forensics and Security, 2013,8(7):1243-1254.
[35]X. Tang, R. Liu, P. Spasojevic, et al. Multiple access channels with generalized feedback and confidential messages[C]//in Proceedings of IEEE Information Theory Workshop,2007: 608-613.
[36]O. Simeone and A. Yener. The cognitive multiple access wire-tap channel[C]//in Proceedings of 43rd Annual Conference on Information Sciences and Systems (CISS) 2009:158-163.
[37]E. Tekin and A. Yener. The Gaussian multiple access wire-tap channel[J]. IEEE Transactions on Information Theory 2008,54(12):5747-5755.
[38]B. Dai. Multiple-Access Relay Wiretap Channel[J/OL]. arXiv preprint arXiv:1403.7883,2014.
[39]Y. Oohama, Relay channels with confidential messages[J/OL]. arXiv preprint cs/0611125,2006.
[40]X. He and A. Yener. Cooperation with an untrusted relay:A secrecy perspective[J]. IEEE Transactions on Information Theory,2010,56(8):3807-3827.
[41]X. He and A. Yener. Two-hop secure communication using an untrusted relay:a case for cooperative jamming[C]//in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM),2008:1-5.
[42]R. Liu, I. Maric, R.D. Yates, et al. The discrete memoryless multiple access channel with confidential messages[C]//in Proceedings of IEEE International Symposium on Information Theory (ISIT),2006:957-961.
[43]Y. Liang and H.V. Poor. Multiple-access channels with confidential messages[J]. IEEE Transactions on Information Theory,2008,54(3):976-1002.
[44]E. Ekrem and S. Ulukus. Effects of cooperation on the secrecy of multiple access channels with generalized feedback[C]//in Proceedings of 42nd Annual Conference on Information Sciences and Systems (CISS),2008:791-796.
[45]R. Liu, I. Maric, P. Spasojevic, et al. Discrete memoryless interference and broadcast channels with confidential messages:Secrecy rate regions[J]. IEEE Transactions on Information Theory, 2008,54(6):2493-2507.
[46]Y. Liang, A. Somekh-Baruch, H.V. Poor, et al., Capacity of cognitive interference channels with and without secrecy[J]. IEEE Transactions on Information Theory,2009,55(2):604-619.
[47]O.O. Koyluoglu and H. El Gamal. Cooperative encoding for secrecy in interference channels[J]. IEEE Transactions on Information Theory,2011,57(9):5682-5694.
[1]T.M. Cover and J.A. Thomas. Elements of information theory [M].2nd ed. Wiley-Interscience. 2006.
[2]E. Telatar. Capacity of Multi-antenna Gaussian Channels[J]. European transactions on telecommunications,1999,10(6):585-595.
[3]L. Zheng and D.N.C. Tse. Diversity and multiplexing:A fundamental tradeoff in multiple-antenna channels[J]. IEEE Transactions on Information Theory,2003,49(5):1073-1096.
[4]A.D. Wyner. The wire-tap channel[J]. Bell Syst. Tech. J.,1975,54:1355-1387.
[5]S. Leung-Yan-Cheong and M.E. Hellman. The Gaussian wire-tap channel[J]. IEEE Transactions on Information Theory,1978,24(4):451-456.
[6]A. Khisti and G.W. Wornell. Secure transmission with multiple antennas-Part Ⅱ:The MIMOME wiretap channel[J]. IEEE Transactions on Information Theory,2010,56(11):5515-5532.
[1]L. Zheng and D.N.C. Tse. Diversity and multiplexing:A fundamental tradeoff in multiple-antenna channels[J]. IEEE Transactions on Information Theory,2003,49(5):1073-1096.
[2]J.N. Laneman, D.N. Tse, and G.W. Wornell. Cooperative diversity in wireless networks:Efficient protocols and outage behavior[J]. IEEE Transactions on Information Theory,2004,50(12): 3062-3080.
[3]A. Bletsas, A. Khisti, D.P. Reed, et al. A simple cooperative diversity method based on network path selection[J]. IEEE Journal on Selected Areas in Communications,2006,24(3):659-672.
[4]K. Azarian, H. El Gamal, and P. Schniter. On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels[J]. IEEE Transactions on Information Theory,2005,51(12): 4152-4172.
[5]N. Prasad and M.K. Varanasi. High performance static and dynamic cooperative communication protocols for the half duplex fading relay channel[J]. IEEE Transactions on Wireless Communications,2010,9(1):328-337.
[6]S. Yang and J.-C. Belfiore. Towards the optimal amplify-and-forward cooperative diversity scheme[J]. IEEE Transactions on Information Theory,2007,53(9):3114-3126.
[7]B. Rankov and A. Wittneben. Spectral efficient protocols for half-duplex fading relay channels[J]. IEEE Journal on Selected Areas in Communications,2007,25(2):379-389.
[8]W. Chang, S.-Y. Chung, and Y.H. Lee. Capacity bounds for alternating two-path relay channels[C] //in Proceedings of of the Allerton Conference on Communications, Control and Computing, 2007.
[9]R. Zhang. Characterizing achievable rates for two-path digital relaying[C]//in Proceedings of IEEE International Conference on Communications 2008:1113-1117.
[10]R. Tannious and A. Nosratinia. Spectrally-efficient relay selection with limited feedback[J]. IEEE Journal on Selected Areas in Communications,2008,26(8):1419-1428.
[11]Y. Fan, C. Wang, J. Thompson, et al. Recovering multiplexing loss through successive relaying using repetition coding[J]. IEEE Transactions on Wireless Communications,2007,6(12): 4484.4493.
[12]H. Wicaksana, S.H. Ting, C.K. Ho, et al. AF two-path half duplex relaying with inter-relay self interference cancellation:diversity analysis and its improvement[J]. IEEE Transactions on Wireless Communications,2009,8(9):4720-4729.
[13]C. Wang, Y. Fan, J.S. Thompson, et al. Approaching the optimal diversity-multiplexing tradeoff in a four-node cooperative network[J]. IEEE Transactions on Wireless Communications,2010,9(12): 3690-3700.
[14]Z. Ding and K.K. Leung. On the Design of Opportunistic Decode-Forward Cooperative Transmission Protocol[C]//in Proceedings of the 2nd Annual Conference of the International Technology Alliance (ACITA 2008),2008:1-11.
[15]C.Y. Leow, Z. Ding, and K.K. Leung. Linear precoded cooperative transmission protocol for wireless broadcast channels[J]. IEEE Transactions on Vehicular Technology,2011,60(7): 3509-3515.
[16]Z. Ding, T. Ratnarajah, and C.C. Cowan. On the diversity-multiplexing tradeoff for wireless cooperative multiple access systems[J]. IEEE Transactions on Signal Processing,2007,55(9): 4627-4638.
[17]A. Jeffrey and D. Zwillinger, Table of integrals, series, and products[M].7th ed. Academic Press, 2007.
[18]P.A. Becker. On the integration of products of Whittaker functions with respect to the second index[J]. Journal of Mathematical Physics,2004,45(2):761-773.
[1]D.N.C. Tse, P. Viswanath, and L. Zheng. Diversity-multiplexing tradeoff in multiple-access channels[J]. IEEE Transactions on Information Theory,2004,50(9):1859-1874.
[2]K. Azarian, H. El Gamal, and P. Schniter. On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels[J]. IEEE Transactions on Information Theory,2005,51(12): 4152-4172.
[3]Z. Ding, T. Ratnarajah, and C.C. Cowan. On the diversity-multiplexing tradeoff for wireless cooperative multiple access systems[J]. IEEE Transactions on Signal Processing,2007,55(9): 4627-4638.
[4]E.G. Larsson and B.R. Vojcic. Cooperative transmit diversity based on superposition modulation[J]. IEEE Communications Letters,2005,9(9):778-780.
[5]C. Wang, Y. Fan, I. Krikidis, et al. Superposition-coded concurrent decode-and-forward relaying[C]//in Proceedings of IEEE International Symposium on Information Theory,2008: 2390-2394.
[6]C. Wang, Y. Fan, J.S. Thompson, et al. A comprehensive study of repetition-coded protocols in multi-user multi-relay networks[J]. IEEE Transactions on Wireless Communications,2009,8(8): 4329-4339.
[7]Z. Ding, K.K. Leung, D.L. Goeckel, et al. A relay assisted cooperative transmission protocol for wireless multiple access systems[J]. IEEE Transactions on Communications,2010,58(8): 2425-2435.
[8]M. Xiao, J. Kliewer, and M. Skoglund. Design of network codes for multiple-user multiple-relay wireless networks[J]. IEEE Transactions on Communications,2012,60(12):3755-3766.
[9]C. Wang, M. Xiao, and M. Skoglund. Diversity-multiplexing tradeoff analysis of coded multi-user relay networks[J], IEEE Transactions on Communications,2011,59(7):1995-2005.
[10]C. Wang, H. Farhadi, and M. Skoglund. Achieving the degrees of freedom of wireless multi-user relay networks[J]. IEEE Transactions on Communications,2012,60(9):2612-2622.
[11]J.N. Laneman, D.N. Tse, and G.W. Wornell. Cooperative diversity in wireless networks:Efficient protocols and outage behavior[J]. IEEE Transactions on Information Theory,2004,50(12): 3062-3080.
[12]C.Y. Leow, Z. Ding, and K.K. Leung. Linear precoded cooperative transmission protocol for wireless broadcast channels[J]. IEEE Transactions on Vehicular Technology,2011,60(7): 3509-3515.
[13]D. Tse, Fundamentals of wireless communication[M]. Cambridge university press,2005.
[14]Y. Fan, C. Wang, J. Thompson, et al. Recovering multiplexing loss through successive relaying using repetition coding[J]. IEEE Transactions on Wireless Communications,2007,6(12): 4484-4493.
[15]Z. Ding, K.K. Leung, D.L. Goeckel, et al. A relay assisted cooperative transmission protocol for wireless multiple access systems[J]. IEEE Transactions on Communications,2010,58(8): 2425-2435.
[16]D.N.C. Tse, P. Viswanath, and L. Zheng. Diversity-multiplexing tradeoff in multiple-access channels[J]. IEEE Transactions on Information Theory,2004,50(9):1859-1874.
[17]G.H. Golub and C.F. Van Loan. Matrix computations[M].3rd ed. John Hopkins Univerity Press, 1996.
[18]Z. Ding and K.K. Leung. On the Design of Opportunistic Decode-Forward Cooperative Transmission Protocol[C]//in Proceedings of the 2nd Annual Conference of the International Technology Alliance (ACITA 2008),2008:1-11.
[19]C. Wang, Y. Fan, J.S. Thompson, et al. A comprehensive study of repetition-coded protocols in multi-user multi-relay networks[J]. IEEE Transactions on Wireless Communications,2009,8(8): 4329-4339.
[20]L.H. Grokop and D.N. Tse. Diversity-multiplexing tradeoff in ISI channels[J]. IEEE Transactions on Information Theory,2009,55(1):109-135.
[21]L. Zheng and D.N.C. Tse. Diversity and multiplexing:A fundamental tradeoff in multiple-antenna channels[J]. IEEE Transactions on Information Theory,2003,49(5):1073-1096.
[22]C. Wang, Y. Fan, J.S. Thompson, et al. Approaching the optimal diversity-multiplexing tradeoff in a four-node cooperative network[J]. IEEE Transactions on Wireless Communications,2010,9(12): 3690-3700.
[1]A.D. Wyner. The wire-tap channel[J]. Bell Syst. Tech.J.,1975,54:1355-1387.
[2]I. Csiszar and J. Korner. Broadcast channels with confidential messages[J]. IEEE Transactions on Information Theory,1978,24(3):339-348.
[3]S. Leung-Yan-Cheong and M.E. Hellman. The Gaussian wire-tap channel[J]. IEEE Transactions on Information Theory,1978,24(4):451-456.
[4]A. Khisti and G.W. Wornell. Secure transmission with multiple antennas-Part Ⅱ:The MIMOME wiretap channel[J]. IEEE Transactions on Information Theory,2010,56(11):5515-5532.
[5]S. Goel and R. Negi. Guaranteeing secrecy using artificial noise[J]. IEEE Transactions on Wireless Communications,2008,7(6):2180-2189.
[6]L. Lifeng and H. El Gamal. The relay-eavesdropper channel:Cooperation for secrecy[J]. IEEE Transactions on Information Theory 2008,54(9):4005-4019.
[7]A. Vaneet, S. Lalitha, C. A Robert, et al. Secrecy capacity of a class of orthogonal relay eavesdropper channels[J]. EURASIP Journal on Wireless Communications and Networking,2009, 2009.
[8]T. Xiaojun, L. Ruoheng, P. Spasojevic, et al. Interference Assisted Secret Communication[J]. IEEE Transactions on Information Theory,2011,57(5):3153-3167.
[9]E. Tekin and A. Yener. The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming[J]. IEEE Transactions on Information Theory 2008, 54(6):2735-2751.
[10]Z.H. Awan, A. Zaidi, and L. Vandendorpe. Secure communication over parallel relay channel[J]. IEEE Transactions on Information Forensics and Security,2012,7(2):359-371.
[11]Z.H. Awan, A. Zaidi, and L. Vandendorpe. Multiaccess Channel With Partially Cooperating Encoders and Security Constraints[J]. IEEE Transactions on Information Forensics and Security, 2013,8(7):1243-1254.
[12]S. Lim, Y.-H. Kim, A. El Gamal, et al. Noisy network coding[J]. IEEE Transactions on Information Theory,2011,57(5):3132-3152.
[13]E. Tekin and A. Yener. The Gaussian multiple access wire-tap channel[J]. IEEE Transactions on Information Theory 2008,54(12):5747-5755.
[14]T. Cover and A.E. Gamal. Capacity theorems for the relay channel[J]. IEEE Transactions on Information Theory,1979,25(5):572-584.
[15]C. Yanling and A.J.H. Vinck. Wiretap Channel With Side Information[J]. IEEE Transactions on Information Theory,2008,54(1):395-402.
[16]S. Gel'Fand. Coding for channel with random parameters[J]. Probl. Contr. Inform. Theory,1980, 9(1):19-31.
[17]O.O. Koyluoglu and H. El Gamal. Cooperative encoding for secrecy in interference channels[J]. IEEE Transactions on Information Theory,2011,57(9):5682-5694.
[18]M.H. Costa. Writing on dirty paper (corresp.)[J]. IEEE Transactions on Information Theory,1983, 29(3):439-441.
[19]R. Liu, I. Marie, P. Spasojevic, et al. Discrete memoryless interference and broadcast channels with confidential messages:Secrecy rate regions[J]. IEEE Transactions on Information Theory, 2008,54(6):2493-2507.
[1]X. Tang, R. Liu, P. Spasojevic, et al. Multiple access channels with generalized feedback and confidential messages [C]//in Proceedings of IEEE Information Theory Workshop,2007: 608-613.
[2]O. Simeone and A. Yener. The cognitive multiple access wire-tap channel[C]//in Proceedings of 43rd Annual Conference on Information Sciences and Systems (CISS) 2009:158-163.
[3]E. Tekin and A. Yener. The Gaussian multiple access wire-tap channel[J]. IEEE Transactions on Information Theory 2008,54(12):5747-5755.
[4]E. Tekin and A. Yener. The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming[J]. IEEE Transactions on Information Theory 2008, 54(6):2735-2751.
[5]B. Dai. Multiple-Access Relay Wiretap Channel[J/OL]. arXiv preprint arXiv:1403.7883,2014.
[6]L. Lifeng and H. El Gamal. The relay-eavesdropper channel:Cooperation for secrecy[J]. IEEE Transactions on Information Theory 2008,54(9):4005-4019.
[7]T. Xiaojun, L. Ruoheng, P. Spasojevic, et al. Interference Assisted Secret Communication[J]. IEEE Transactions on Information Theory,2011,57(5):3153-3167.
[8]O.O. Koyluoglu and H. El Gamal. Cooperative encoding for secrecy in interference channels[J]. IEEE Transactions on Information Theory,2011,57(9):5682-5694.
[9]R. Liu, I. Marie, P. Spasojevic, et al. Discrete memoryless interference and broadcast channels with confidential messages:Secrecy rate regions[J]. IEEE Transactions on Information Theory, 2008,54(6):2493-2507.
[10]Y. Liang, A. Somekh-Baruch, H.V. Poor, et al. Capacity of cognitive interference channels with and without secrecy[J]. IEEE Transactions on Information Theory,2009,55(2):604-619.
[11]F. Willems. The discrete memoryless multiple access channel with partially cooperating encoders (corresp.)[J]. IEEE Transactions on Information Theory,1983,29(3):441-445.
[12]A.D. Wyner. The wire-tap channel[J]. Bell Syst. Tech. J.,1975,54:1355-1387.
[13]I. Csiszar and J. Korner. Broadcast channels with confidential messages[J]. IEEE Transactions on Information Theory,1978,24(3):339-348.
[14]S.I. Bross, A. Lapidoth, and M.A. Wigger. The Gaussian MAC with conferencing encoders[C] //in Proceedings of IEEE International Symposium on Information Theory (ISIT),2008: 2702-2706.
[15]A. Khisti and G.W. Wornell. Secure transmission with multiple antennas I:The MISOME wiretap channel[J]. IEEE Transactions on Information Theory,2010,56(7):3088-3104.
[16]F. Willems. Information-theoretical results for the discrete memoryless multiple access channel[D], Ph.D. dissertation, Leuven, Haverlee, Belgium:Katholieke Universiteit,1982.
[17]J. Thomas. Feedback can at most double Gaussian multiple access channel capacity (Corresp.)[J]. IEEE Transactions on Information Theory,1987,33(5):711-716.