Making link-state routing scale for ad hoc networks
Making link-state routing scale for ad hoc networks
复制标题
使自组织网络的链路状态路由规模化
DOI：
10.1145/501417.501420
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
I. Stavrakakis
中科院分区：
文献类型：
--
作者：
C. Santivanez;R. Ramanathan;I. Stavrakakis
在本文中，我们介绍了一类方法，试图通过限制在空间和时间上的链路状态更新传播的范围来扩展链路状态路由。我们提出了这个通用类，我们称之为“模糊视线链路状态路由”的第一个基本分析。使用一个新的角度上的“开销”的协议，不仅包括由于控制消息的开销，但也由于路由次优，我们制定了一个分析模型，其解决方案自动导致在这一类的最佳算法。该算法被证明有几乎最好的渐近开销的任何路由算法-主动或被动。仿真结果比较了这类算法的性能
In this paper, we introduce a class of approaches that attempt to scale link-state routing by limiting the scope of link state update dissemination in space and over time. We present the first fundamental analysis of this generic class, which we call "Fuzzy Sighted Link State routing". Using a novel perspective on the "overhead"of a protocol that includes not only the overhead due to control messages but also due to route sub-optimality, we formulate an analytical model whose solution automatically leads to the best algorithm in this class. This algorithm is shown to have nearly the best possible asymptotic overhead for any routing algorithm -proactive or reactive. Simulation results are presented that compare the performance or several algorithms in this class