The Total Transmissions Performance of Sparse Network Coding in Compered with LT codes
محل انتشار: سومین کنفرانس ملی مهندسی برق و کامپیوتر
سال انتشار: 1398
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 447
فایل این مقاله در 11 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ISCELEC03_080
تاریخ نمایه سازی: 14 فروردین 1399
چکیده مقاله:
While Random Linear Network Coding (RLNC) is known to improve network’s reliability and throughput, its high costs for delivering coding coefficients and decoding represent an obstacle where nodes have limited power to transmit and decode packets. In order to solve this problem, Sparse Network Coding (SNC) has been recently used as a technique for reducing the decoding and encoding computational complexity of RLNC. This study firstly focuses on characterizing the total number of transmission to recover a generation for SNC considering the effects of the finite field size. Then, it compares the SNC scheme with LT code in terms of the total number of transmissions to decode a generation. Finally, we validate our model using simulation and show that depending on finite field and sparsity level the SNC scheme is able to outperform the LT code with regard to the total number of transmissions
کلیدواژه ها:
Random Linear Network Coding- Sparse Network Coding- The Total Transmissions
نویسندگان
Amir Zarei
Department of Computer Science and Information, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran