Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2

Free registration required

Executive Summary

MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices. One of the bottlenecks of scalability in link-state routing protocols is the performance of the shortest path algorithm (e.g. Dijkstra). In this paper, the authors investigate the in-node performance of OLSRv2 and, in particular, study the benefits of using a Dynamic Shortest Path (DSP) algorithm for this routing protocol. A DSP algorithm is an algorithm that adds or removes edges in the routing tree incrementally and calculates shortest paths, also incrementally.

  • Format: PDF
  • Size: 149.8 KB