Jump to content

MENTOR routing algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Deptstoremook (talk | contribs) at 04:43, 5 November 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The MENTOR routing algorithm is an algorithm for use in routing of mesh networks, specifically pertaining to their initial topology. It was developed in 1991 by Aaron Kershenbaum, Parviz Kermani, and George A. Grove and was published by the IEEE.

Complexity

Empirical observation has shown the complexity class of this algorithm to be O(N²), or Quadratic. This represents "a significant improvement over currently used algorithms, [while still yielding] solutions of a quality competitive with other much slower procedures." [1]

Methodology

TODO

Example

TODO

Retrieved from "https://en.wikipedia.org/w/index.php?title=MENTOR_routing_algorithm&oldid=169313119"