Making link-state routing scale for ad hoc networks

César A. Santiváñez, Ram Ramanathan, Ioannis Stavrakakis
2001 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '01  
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 rst 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 suboptimality, we formulate an analytical model whose solution
more » ... y 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 of several algorithms in this class.
doi:10.1145/501416.501420 dblp:conf/mobihoc/SantivanezRS01 fatcat:d4c6xsevhnglti553veuyveah4