多層中繼網(wǎng)絡(luò)上的分布式LT碼

張艷; 陳建華; 唐猛

doi:10.11999/JEIT180804

多層中繼網(wǎng)絡(luò)上的分布式LT碼

doi: 10.11999/JEIT180804

張艷¹,
陳建華^2, ,,
唐猛²

1.
云南大學(xué)軟件學(xué)院 ??昆明 ??650500
2.
云南大學(xué)信息學(xué)院 ??昆明 ??650500

基金項目: 國家自然科學(xué)基金(61062005)

詳細信息

作者簡介:
張艷：女，1978年生，講師，博士生，研究方向為網(wǎng)絡(luò)編碼

陳建華：男，1964年生，教授，博士生導(dǎo)師，研究方向為信息傳輸理論與應(yīng)用

唐猛：男，1979年生，副研究員，研究方向為網(wǎng)絡(luò)編碼

通訊作者:
陳建華　chenjh@ynu.edu.cn

中圖分類號: TN911.22
計量
- 文章訪問數(shù): 2126
- HTML全文瀏覽量: 578
- PDF下載量: 59
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2018-08-16
- 修回日期: 2019-01-27
- 網(wǎng)絡(luò)出版日期: 2019-02-25
- 刊出日期: 2019-07-01

Distributed LT Codes on Multiple Layers Networks

1.
School of Software, Yunnan University, Kunming 650500, China
2.
School of Information, Yunnan University, Kunming 650500, China

Funds: The National Natural Science Foundation of China (61062005)

摘要

摘要: 目前對分布式LT碼(DLT)的研究僅限于信源數(shù)量較少、且只有1層中繼的情況，該文提出一種能夠部署在多層中繼網(wǎng)絡(luò)上的分布式LT碼，即多層分布式LT碼(MLDLT)。該碼將信源進行分組，將中繼進行分層，通過分層后的中繼群，可以將多達幾十個乃至上百個信源連接到同一個接收端，從而實現(xiàn)眾多信源通過多層中繼對同一個接收終端的分布式LT碼通信。通過對MLDLT碼進行與或樹分析，得出其中繼度分布的線性優(yōu)化方程。分別在無損和有損鏈路上計算該碼的漸進性能并進行數(shù)值仿真，結(jié)果證明MLDLT碼在無損和有損鏈路上的錯誤平臺都比較低。MLDLT碼非常適合于信源數(shù)量較多的多層中繼網(wǎng)絡(luò)。
- 分布式LT碼 /
- 度分布 /
- 與或樹 /
- 漸進性能
Abstract: Present researches on Distributed Luby’s Transmission (DLT) codes are restricted on several-sources and one-layer-relay networks, thus the Multiple Layers Distributed LT (MLDLT) code for multiple-layers-relays networks is proposed. In MLDLT, sources are grouped and realys are layered in order that scores of sources can be connected to the only destination through the layered relays. By this scheme, the distributed communication between scores of sources and the destination can be performed. Through the and-or tree analysis, the linear procedures for the optimization of the relays' degree distributions are derived. On both lossless and lossy links, asymptotic performances of MLDLT are analized and the numberical simulations are experimented. The results demonstrate that MLDLT can achieve satisfying erasure floors on both lossless and lossy links. MLDLT is a feasible solution for the scores-sources and multiple-layers-realys networks.
- Distributed Luby’s Transmission (DLT) code /
- Degree distribution /
- And-or tree /
- Asymptotic performance

HTML全文

圖 1 MLDLT碼的系統(tǒng)結(jié)構(gòu)

下載: 全尺寸圖片幻燈片

圖 2 1層MLDLT的系統(tǒng)結(jié)構(gòu)和譯碼圖

下載: 全尺寸圖片幻燈片

圖 3 2層MLDLT碼的系統(tǒng)結(jié)構(gòu)和等價過程

下載: 全尺寸圖片幻燈片

圖 4 有損鏈路上的局部MLDLT及其等價結(jié)構(gòu)圖

下載: 全尺寸圖片幻燈片

圖 5 50個信源的2層MLDLT碼和32個信源的HSDC碼的仿真結(jié)果

下載: 全尺寸圖片幻燈片

圖 6 100信源的2層MLDLT碼和64個信源的HSDC碼的仿真結(jié)果

下載: 全尺寸圖片幻燈片

圖 7 2¹, 2², ···, 2⁶個信源的HSDC碼的仿真結(jié)果

下載: 全尺寸圖片幻燈片

圖 8 50個信源的MLDLT碼在有損鏈路上的漸進性能

下載: 全尺寸圖片幻燈片

圖 9 50個信源的MLDLT碼在有損鏈路上的漸進性能

下載: 全尺寸圖片幻燈片

圖 10 100個信源的MLDLT碼在有損鏈路上的漸進性能

下載: 全尺寸圖片幻燈片

圖 11 100個信源的MLDLT碼在有損鏈路上的漸進性能

下載: 全尺寸圖片幻燈片

圖 12 50個信源的MLDLT碼在有損連路上的仿真結(jié)果

下載: 全尺寸圖片幻燈片

圖 13 100個信源的MLDLT碼在有損連路上的仿真結(jié)果

下載: 全尺寸圖片幻燈片

表 1 中繼選擇和編碼算法

　步驟1　從${t_1}$條鏈路上接收0級編碼包；

　步驟2　統(tǒng)計實際接收到的0級編碼包數(shù)量$t_1^*$；

　步驟3　中繼$R_{}^{\rm{I}}$以概率$\varGamma _h^{\rm{I}}$選擇度數(shù)$h$；

　步驟4　if $t_1^* > h$ then

　　　　　　從$t_1^*$個0級編碼包中任選$h$個進行混合；

　　　　　else then

　　　　　　將$t_1^*$個0級編碼包進行混合。

　　　　end if

下載: 導(dǎo)出CSV

表 2 ${\text{Γ}^{\text{I}}}\text{(}\text{x}\text{)}$和${\text{Γ}^{{\text{II}}}}\text{(}\text{x}\text{)}$的線性規(guī)劃結(jié)果

T=50	${\varGamma ^{\rm{I}}}(x)$	0.7101x+0.2899x⁵
T=50	${\varGamma ^{{\rm{II}}}}(x)$	0.8850x+0.0117x² + 0.1033x¹⁰
T=100	${\varGamma ^{\rm{I}}}(x)$	0.7101x+0.2899x⁵
T=100	${\varGamma ^{{\rm{II}}}}(x)$	0.8625x+0.0534x²+0.0841x²⁰

下載: 導(dǎo)出CSV

參考文獻(19)

BYERS J W, LUBY M, MITZENMACHER M, et al. A digital fountain approach to reliable distribution of bulk data[J]. ACM Sigcomm Computer Communication, 1998, 28(4): 56–67. doi: 10.1145/285243.285258

索龍龍, 張更新, 邊東明, 等. 高斯消元譯碼下LT碼性能分析[J]. 計算機應(yīng)用, 2018, 38(7): 2015–2019. doi: 10.11772/j.issn.1001-9081.2017122989

SUO Longlong, ZHANG Gengxin, BIAN Dongming, et al. Performance analysis of Luby transform codes under Gaussian elimination decoding[J]. Journal of Computer Applications, 2018, 38(7): 2015–2019. doi: 10.11772/j.issn.1001-9081.2017122989

LUBY M. LT codes[C]. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, 2002: 271–280.

ALBAYRAK C and TURK K. Reduced-complexity decoding of LT codes[J]. Wireless Personal Communications, 2017, 94(3): 969–975. doi: 10.1007/s11277-016-3660-7

PUDUCHERI S, KLIEWER J, and FUJA T E. The design and performance of distributed LT codes[J]. IEEE Transactions on Information Theory, 2007, 53(10): 3740–3754. doi: 10.1109/TIT.2007.904982

LIAU A, YOUSEFI S, and KIM I M. Binary soliton-like rateless coding for the Y-network[J]. IEEE Transactions on Communications, 2011, 59(12): 3217–3222. doi: 10.1109/TCOMM.2011.091911.100189

LIAU A, KIM I M, and YOUSEFI S. Improved low-complexity soliton-like network coding for a resource-limited relay[J]. IEEE Transactions on Communications, 2013, 61(8): 3327–3335. doi: 10.1109/TCOMM.2013.061913.110585

SEJDINOVIC D, PIECHOCKI R J, and DOUFEXI A. And-or tree analysis of distributed LT codes[C]. Proceedings of the 2009 IEEE Information Theory Workshop on Networking and Information Theory, Volos, Greece, 2009: 261–265.

HUSSAIN I, XIAO Ming, and RASMUSSEN L K. Buffer-based distributed LT codes[J]. IEEE Transactions on Communications, 2014, 62(11): 3725–3739. doi: 10.1109/TCOMM.2014.2362111

YANG Haitao, JIANG Ming, SHEN Hong, et al. A distributed LT code design for multiple-access relay networks subject to erasures[J]. IEEE Communications Letters, 2015, 19(4): 509–512. doi: 10.1109/LCOMM.2015.2398412

FEI Zesong, CAO Congzhe, XIAO Ming, et al. Improved LT codes in low overhead regions for binary erasure channels[J]. Transactions on Emerging Telecommunications Technologies, 2016, 27(1): 84–91. doi: 10.1002/ett.2798

LIAO Jianxin, ZHANG Lei, LI Tonghong, et al. A generalized design of distributed rateless codes with decreasing ripple size for multiple-access relay networks[J]. Wireless Networks, 2017, 23(7): 2177–2188. doi: 10.1007/s11276-016-1279-y

XU Shengkai and XU Dazhuan. Design of degree distributions for finite length LT codes[J]. Wireless Personal Communications, 2018, 98(2): 2251–2260. doi: 10.1007/s11277-017-4972-y

LUBY M G, MITZENMACHER M, and AMIN SHOKROLLAHI M. Analysis of random processes via and-or tree evaluation[C]. Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, USA, 1998: 364–373.

SUO Longlong, ZHANG Gengxin, Lü Jing, et al. Performance analysis for finite length LT codes via classical probability evaluation[J]. IEEE Communications Letters, 2017, 21(9): 1957–1960. doi: 10.1109/LCOMM.2017.2700303

華潔, 徐大專, 許生凱. 系統(tǒng)LT碼在刪除信道下的漸進性能分析及度分布設(shè)計[J]. 數(shù)據(jù)采集與處理, 2017, 32(5): 906–912. doi: 10.16337/j.1004-9037.2017.05.007

HUA Jie, XU Dazhuan, and XU Shengkai. Asymptotic performance analysis and degree distribution design for systematic Luby transform codes over binary erasure channel[J]. Journal of Data Acquisition and Processing, 2017, 32(5): 906–912. doi: 10.16337/j.1004-9037.2017.05.007

AHLSWEDE R, CAI Ning, LI S Y R, et al. Network information flow[J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204–1216. doi: 10.1109/18.850663

LI S Y R, YEUNG R W, and CAI Ning. Linear network coding[J]. IEEE Transactions on Information Theory, 2003, 49(2): 371–381. doi: 10.1109/TIT.2002.807285

孔博, 張更新, 張威, 等. 空間信息網(wǎng)絡(luò)中基于LT碼的分布式存儲策略[J]. 電子與信息學(xué)報, 2016, 38(4): 787–794. doi: 10.11999/JEIT150674

KONG Bo, ZHANG Gengxin, ZHANG Wei, et al. Distributed storage strategy based on LT codes in space information network[J]. Journal of Electronics &Information Technology, 2016, 38(4): 787–794. doi: 10.11999/JEIT150674

相關(guān)文章

施引文獻

資源附件(0)

訪問統(tǒng)計