arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.0630cs.NIcs.PF
收藏

无线网络编码的性能:激励小编码数

Performance of wireless network coding: motivating small encoding numbers

Petteri Mannersalo, Georgios S. Paschos, Lazaros Gkatzikis

摘要:

本文重点介绍了一种特殊的传输方案,称为本地网络编码,据报道,在实际的无线网络中提供显着的性能增益。该方案的性能很大程度上取决于网络拓扑结构,从而取决于无线节点的位置。此外,先前已经示出,找到实现最大性能的编码策略需要无线节点实时进行复杂的计算。确定性和随机点模式都进行了探索,并使用布尔连接模型,我们提供了最大编码数的上限,即,可以组合以使相应接收器能够解码的数据包数量。对于所研究的模型,该上限为$\sqrt{N}$的阶,其中$N$表示邻居的(平均)数量。此外,可实现的编码数提供了网格状网络。我们还计算了在小网络情况下确定增益的乘法常数。基于上述结果,我们提供了一个解析表达式的本地网络编码的效率上界。所传达的信息是,通过仅依赖于小的编码数来降低计算复杂性是有利的,因为所得到的预期吞吐量损失是可忽略的。

英文摘要:

This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the network topology and thus on the locations of the wireless nodes. Also, it has been shown previously that finding the encoding strategy, which achieves maximum performance, requires complex calculations to be undertaken by the wireless node in real-time. Both deterministic and random point pattern are explored and using the Boolean connectivity model we provide upper bounds for the maximum coding number, i.e., the number of packets that can be combined such that the corresponding receivers are able to decode. For the models studied, this upper bound is of order of $\sqrt{N}$, where $N$ denotes the (mean) number of neighbors. Moreover, achievable coding numbers are provided for grid-like networks. We also calculate the multiplicative constants that determine the gain in case of a small network. Building on the above results, we provide an analytic expression for the upper bound of the efficiency of local network coding. The conveyed message is that it is favorable to reduce computational complexity by relying only on small encoding numbers since the resulting expected throughput loss is negligible.

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

↑