全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于叠加编码的并行中继网络的传输策略研究

DOI: 10.13190/jbupt.201004.39.yangy, PP. 39-43

Full-Text   Cite this paper   Add to My Lib

Abstract:

在给定信息速率的条件下,给出了译码转发机制下的最优合作(OC)策略.OC策略需要相关信号的相位在目的节点严格同步,这是很难实现的.为克服此缺点,提出了一种不需要同步的无信息重叠(NIO)策略.与OC策略相比,NIO策略更适合实际的中继网络.进而又提出一种仅包含两层叠加编码的减少中继选择(RRS)方法以达到复杂度与性能的折中.仿真结果显示,NIO策略与OC策略之间的性能差距很小,即使在节点数目很大的情况下,仅选择两个最好的中继节点足以获得NIO策略大部分的性能增益.

References

[1]  Schein B. Distributed coordination in network information theory. Cambridge: MIT, 2001.
[2]  Maric I, Yates R. Forwarding strategies for gaussian parallel-relay networks//Conf on CISS. Princeton: IEEE, 2004: 1-6.
[3]  Lo C K, Heath W, Vishwanath S. Opportunistic relay selection with limited feedback//Proc IEEE VTC. Dublin: IEEE, 2007: 135-139.
[4]  Huang W J, Hong Y W, Kuo C C J. Lifetime maximization for amplify-and-forward coopera- tive networks//Proc IEEE WCNC. Hong Kong: IEEE, 2007: 814-818.
[5]  Dai L, Gui B, Cimini L J. Selective relaying in OFDM multihop cooperative networks//Proc IEEE WCNC. Hong Kong: IEEE, 2007: 963- 968.
[6]  Chen M, Serbetli S, Yener A. Distributed power allocation for parallel relay networks//Proc IEEE GLOBECOM. St. Louis: IEEE, 2005: 1177-1181.
[7]  Lee C, Vishwanath S, Cooperative communica- tion strategies for sensor networks//Proc IEEE MILCOM. Atlantic City: IEEE, 2005: 698- 704.
[8]  Liu Y, Lau K N, Takeshita O Y, et al. Optimal rate allocation for superposition coding in quasi- static fading channels//Proc IEEE ISIT. Lausanne: IEEE, 2002: 111.
[9]  陈书平, 王文博, 张兴. 解码转发协同中继网络多用户分集[J]. 北京邮电大学学报, 2009, 32(1): 95-98. Chen Shuping, Wang Wenbo, Zhang Xing. Multiuser diversity in decode-and-forward coo-perative relay networks[J]. Journal of Beijing University of Posts and Telecommunications, 2009, 32(1): 95-98.
[10]  Bletsas A, Khisti A, Reed D P, et al. A simple cooperative diversity method based on network path selection[J]. IEEE J Select Areas Commun, 2006, 24(3): 659-672.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133