Time and frequency resource allocation using graph theory in OFDMA wireless mesh networks

A wireless network with a tncsh topology works reliably and offers redundancy. In modern broadband wireless mesh networks that use MIMO and OFDMA techniques, the problems of time, frequency, and space resource allocations are different from a cellular system and more complicated due to system architecture and distributed control and management. This paper focuses on the resource allocation problem of the OFDMA system and we define the term of separability order. For simple topologies like the square grid configuration, the allocations are simple and an optimal solution can be shown, but for an arbitrary architecture we need advanced tools and wc use Graph Theory tools to present two different algorithmic solutions, to allow frequency reuse.