arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.01946cs.NI
收藏

一种新的基于内容的城域网编码方法

A New Approach to Coding in Content Based MANETs

Joshua Joy, Yu-Ting Yu, Victor Perez, Dennis Lu, Mario Gerla

摘要:

在基于内容的移动自组织网络(CB-MANDO)中,随机线性网络编码(NC)可以用来可靠地传播间歇连接下的大文件。常规NC涉及在中间结点处的随机无限制编码。然而,这很容易受到污染的影响。为了避免攻击,暴力方法是在源处限制混合。然而,源受限NC通常降低了代码在面对错误、丢失和移动性引起的不稳定性时的鲁棒性。CB-MANN引入了一个新的选项。缓存在CB MANNETWORK中很常见,完全重新组装的缓存文件可以被视为一个新的源。因此,NC分组可以在所有源(包括始发者和中间高速缓存)处混合,但仍然提供免受污染的保护。在本文中,我们希望测试的假设是,是否在CB-MANNETWORK有足够的缓存的文件,性能(在鲁棒性方面)的限制编码等于不受限制的编码。在本文中,我们研究和比较无限制的编码,充分缓存编码,源代码,没有编码。正如预期的那样,我们发现,完全缓存编码仍然具有竞争力,不受限制的编码,同时保持充分的保护,防止污染攻击。

英文摘要:

In content-based mobile ad hoc networks (CB-MANETs), random linear network coding (NC) can be used to reliably disseminate large files under intermittent connectivity. Conventional NC involves random unrestricted coding at intermediate nodes. This however is vulnerable to pollution attacks. To avoid attacks, a brute force approach is to restrict the mixing at the source. However, source restricted NC generally reduces the robustness of the code in the face of errors, losses and mobility induced intermittence. CB-MANETs introduce a new option. Caching is common in CB MANETs and a fully reassembled cached file can be viewed as a new source. Thus, NC packets can be mixed at all sources (including the originator and the intermediate caches) yet still providing protection from pollution. The hypothesis we wish to test in this paper is whether in CB-MANETs with sufficient caches of a file, the performance (in terms of robustness) of the restricted coding equals that of unrestricted coding. In this paper, we examine and compare unrestricted coding to full cache coding, source only coding, and no coding. As expected, we find that full cache coding remains competitive with unrestricted coding while maintaining full protection against pollution attacks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑