MENTOR routing algorithm
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.
- Comment
- enThe 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.
- Has abstract
- enThe 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.
- Hypernym
- Algorithm
- Is primary topic of
- MENTOR routing algorithm
- Label
- enMENTOR routing algorithm
- Link from a Wikipage to an external page
- ieeexplore.ieee.org/iel1/26/2681/00081738.pdf%3Ftp=&isnumber=2681&arnumber=81738&type=ref
- Link from a Wikipage to another Wikipage
- Algorithm
- Category:Mesh networking
- Category:Routing algorithms
- Dijkstra's algorithm
- Heuristic
- Mesh networks
- Minimum spanning tree
- Network topology
- Prim's algorithm
- Quadratic function
- Routing
- SameAs
- 4rCqd
- m.03csz44
- MENTOR routing algorithm
- Q6715392
- Subject
- Category:Mesh networking
- Category:Routing algorithms
- WasDerivedFrom
- MENTOR routing algorithm?oldid=1081348191&ns=0
- WikiPageLength
- 2140
- Wikipage page ID
- 14081814
- Wikipage revision ID
- 1081348191
- WikiPageUsesTemplate
- Template:One source
- Template:Reflist
- Template:Short description