Efficient routing tree construction algorithms for multi-channel WiMax networks

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, novel routing tree construction algorithms for emerging multi-channel WiMax networks are presented. Both centralized and distributed schemes are explored. Simulation results show the improvement achieved compared to similar networks with a mesh topology.

Author supplied keywords

Cite

CITATION STYLE

APA

Ghiamatyoun, A., Nekoui, O., Esfahani, S. N., & Soltan, M. (2007). Efficient routing tree construction algorithms for multi-channel WiMax networks. In Proceedings - International Conference on Computer Communications and Networks, ICCCN (pp. 957–960). https://doi.org/10.1109/ICCCN.2007.4317941

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free