论文标题
路线发现和临时网络的能力
Route Discovery and Capacity of Ad hoc Networks
论文作者
论文摘要
大型临时网络的吞吐量已显示出与网络$ n $的规模不利的。但是，在这种情况下，尚未对节点进行查找或修复路线的需求进行分析。在本文中，我们明确考虑了路线发现，并在网络环境，节点行为和路线发现算法的质量的一般假设下获得吞吐量能力的缩放定律。我们还讨论了许多可能的方案，并表明对路线发现的需求可能会大大改变吞吐量的规模。
Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network $n$. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity dramatically.
