On the skew-bounded minimum-buffer routing tree problem.
Christoph AlbrechtAndrew B. KahngBao LiuIon I. MandoiuAlexander ZelikovskyPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2003)
Keyphrases
- spanning tree
- tree structure
- ad hoc networks
- tree structures
- routing protocol
- network topology
- routing problem
- binary tree
- hierarchical structure
- tree nodes
- buffer size
- routing algorithm
- mobile ad hoc networks
- travel distance
- decision trees
- wireless ad hoc networks
- classification trees
- leaf nodes
- b tree
- r tree
- multi dimensional