Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks

Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks
复制标题

DOI:
10.1093/ietcom/e91-b.10.3216
复制
发表时间:
2008-10
期刊:
IEICE Trans. Commun.
影响因子:
--
通讯作者:
T. Matsuda;Taku Noguchi;T. Takine
T. Matsuda;Taku Noguchi;T. Takine
中科院分区:
其他
文献类型:
--
作者:
T. Matsuda;Taku Noguchi;T. Takine

文献摘要

相似文献

在本文中,我们认为在密集的无线ad hoc网络中,人口稠密的无线节点之间的干扰会导致显着的数据包丢失的广播风暴问题。为了解决这个问题,我们将随机网络编码(RNC)应用到网络中。RNC是一种与现有技术完全不同的解决该问题的方法,它通过将多个数据包编码成单个数据包来减少网络中未处理数据包的数量。RNC是一种线性网络编码,它适合于无线adhoc网络,因为它可以以完全分布式的方式实现。我们描述了一个过程,实现无线自组织广播与RNC。此外,通过几个仿真场景,我们提供了一些见解的系统参数和性能之间的关系,并发现有一个最佳长度的编码矢量RNC的分组丢失概率。我们还显示了一个参数设置的指导方针,成功地解决广播风暴问题。
In this paper, we consider the broadcast storm problem in dense wireless ad hoc networks where interference among densely populated wireless nodes causes significant packet loss. To resolve the problem, we apply randomized network coding (RNC) to the networks. RNC is a completely different approach from existing techniques to resolve the problem, and it reduces the number of outstanding packets in the networks by encoding several packets into a single packet. RNC is a kind of linear network coding, and it is suited to wireless ad hoc networks because it can be implemented in a completely distributed manner. We describe a procedure for implementing the wireless ad hoc broadcasting with RNC. Further, with several simulation scenarios, we provide some insights on the relationship between the system parameters and performance and find that there is the optimal length of coding vectors for RNC in terms of packet loss probability. We also show a guideline for the parameter setting to resolve the broadcast storm problem successfully.