概率转发协议中引入冗余的影响
The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol
摘要:
本文研究了自组网中从源节点向每个节点广播信息的问题。泛洪作为一种广播机制,涉及每个节点将其接收到的任何数据包转发给所有邻居。这导致过度的传输,从而导致总体的高能量消耗。概率转发或流言涉及每个节点仅以特定概率$p$将接收到的分组转发到其所有邻居。在本文中,我们研究了引入冗余的效果,在编码数据包的形式,概率转发协议。具体地,我们假设源节点具有要广播的$k$数据分组,其被编码为$n \ge k$编码分组,使得这些编码分组中的任何$k$都足以恢复原始$k$数据分组。我们感兴趣的是确定“成功广播”的最小转发概率$p$,我们将其视为接收到$n$编码分组中的至少$k$的网络节点的预期分数接近1的事件。我们研究,通过模拟和分析的一些不同的网络拓扑结构(例如,树、网格、随机几何图形)、该最小转发概率以及相应地分组传输的预期总数如何随着所添加的冗余量而变化。我们的模拟结果表明,在网络拓扑结构是高度连接的,引入冗余的概率转发协议是有用的,因为它可以显着减少预期的总传输次数需要一个成功的广播。另一方面,对于树,我们的分析表明,所需的预期传输总数随着冗余度的增加而增加。
英文摘要:
This paper is concerned with the problem of broadcasting information from a source node to every node in an ad-hoc network. Flooding, as a broadcast mechanism, involves each node forwarding any packet it receives to all its neighbours. This results in excessive transmissions and thus a high energy expenditure overall. Probabilistic forwarding or gossiping involves each node forwarding a received packet to all its neighbours only with a certain probability $p$. In this paper, we study the effect of introducing redundancy, in the form of coded packets, into a probabilistic forwarding protocol. Specifically, we assume that the source node has $k$ data packets to broadcast, which are encoded into $n \ge k$ coded packets, such that any $k$ of these coded packets are sufficient to recover the original $k$ data packets. Our interest is in determining the minimum forwarding probability $p$ for a "successful broadcast", which we take to be the event that the expected fraction of network nodes that receive at least $k$ of the $n$ coded packets is close to 1. We examine, via simulations and analysis of a number of different network topologies (e.g., trees, grids, random geometric graphs), how this minimum forwarding probability, and correspondingly, the expected total number of packet transmissions varies with the amount of redundancy added. Our simulation results indicate that over network topologies that are highly connected, the introduction of redundancy into the probabilistic forwarding protocol is useful, as it can significantly reduce the expected total number of transmissions needed for a successful broadcast. On the other hand, for trees, our analysis shows that the expected total number of transmissions needed increases with redundancy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。