In multi-hop relay transmission, digital fountain codes can greatly improve transmission efficiency. A multi-hop relay transmission scheme based on fountain codes is proposed, which improves data relay performance in two ways: 1) Two relay nodes form a relay pair, and by using rotated constellation modulation,
signal space diversity gain is obtained without sacrificing bandwidth efficiency. 2) An improved encoded packets linear combination algorithm is used to rebuild the encoded packets by the relay to realize packet diversity. Simulation results show that transmission efficiency of the multi-hop relay transmission is improved considerably, and transmission time reduced.
LEI Wei-jia, LIU Hui-feng, XIE Xian-zhong
. Multi-hop Relay Transmission Scheme Using Digital Fountain Code and Rotated Constellation[J]. Journal of Applied Sciences, 2013
, 31(2)
: 123
-129
.
DOI: 10.3969/j.issn.0255-8297.2013.02.003
[1] PROAKIS J G. Digital communications (Fourth edition) [M]. New York: McGraw-Hill Companies, Inc, 2001: 821-840.
[2] GIRAUD X, BOUTILLON E, BELFIORE J C. Algebraic tools to build modulation schemes for fading channels [J]. IEEE Transactions on Information Theory, 1997, 43(3): 938-952.
[3] BOUTROS J，VITERBO E. Signal space diversity: a power and bandwidth efficient diversity technique for Rayleigh fading channel [J]. IEEE Transactions on Information Theory, 1998, 44(4): 1453-1467.
[4] LEI Weijia, XIE Xianzhong, LI Xiangming. Bandwidth- efficient cooperative diversity with rotated constellations and its performance analysis [J]. KSII Transactions on Internet and Information Systems, 2010, 5(6): 989-1005.
[5] MITZENMACHER M. Digital Fountains: a survey and look forward [C]//IEEE Information Theory Workshop (ITW2004), San Antonio, USA, 2004: 24-29.
[6] MACKAY D J C. Fountain codes [J]. IEE Communications Proceedings, 2005, 152(6): 1062-1068.
[7] LUBY M. LT codes [C]//The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS). USA, 2002: 271-280.
[8] SHOKROLLAHI A. Raptor codes [J]. IEEE Transactions on Information Theory, 2006, 52(6): 2551-2567.
[9] 朱宏鹏，张更新，谢智东. 喷泉码中LT码的次优度分布 [J]. 应用科学学报，2009, 27(1): 6-11.
ZHU Hongpeng, ZHANG Gengxin, XIE Zhidong. Suboptimal degree distribution algorithm of LT codes of digital fountain [J]. Journal of Applied Sciences, 2009, 27(1): 6-11. (in Chinese)
[10] MOLISCH A F, MEHTRA N B, YEDIDIA J S, ZHANG J. Performance of fountain codes in collaborative relay networks [J]. IEEE Transactions on Wireless Communications, 2007, 6(11): 4108-4119.
[11] 吴丹，田亚飞，杨晨阳. 喷泉码多路并行转发中继系统传输时间分析 [J]. 通信学报, 2010, 31(8): 121-126.
Wu Dan, TIAN Ya-fei, YANG Chen-yang. On the transmission time of fountain code based parallel relay network [J]. Journal on Communications, 2010, 31(8): 121-126.(in Chinese)
[12] APAVATJRUT A, GOURSAUD C, JAFFRES-RUNSER K, COMANICIU C, GORCE J. Toward increasing packet diversity for relaying LT fountain codes in wireless sensor networks [J]. IEEE Communications Letters, 2011, 15(1): 52-54.
[13] 雷维嘉，刘慧锋，谢显中. 开关度分布：一种改进的LT数字喷泉编码度分布 [J]. 重庆邮电大学学报：自然科学版，2012, 24(1): 34-38.
LEI Weijia, LIU Huifeng, XIE Xianzhong. Switch degree distribution: an improved degree distribution for LT digital fountain code [J]. Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), 2012, 24(1): 34-38.(in Chinese)
[14] AGHA N, STOJMENOVIC I. Fountain code with XOR of encoded packets for broadcasting and source independent backbonein multi-hop networks using network coding [C]//IEEE 69th Vehicular Technology Conference (VTC Spring 2009), Barcelona, Spain, 2009: 1-5.
