Download now Free registration required
This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. The authors apply three routing tree construction algorithms, namely, Hop Minimization Modulation Maximization (HMMM), Energy/bit Minimization (EbM), and Interference Minimization (IM) routing tree constructions with nodes spaced randomly. Furthermore, a novel multi-channel centralized scheduling algorithm with spatial reuse is proposed and its performance with the three routing tree construction algorithms is evaluated under variance of link capacity induced by co-channel interference. Simulation results show that the routing tree constructed by the EbM algorithm outperforms the two others.
- Format: PDF
- Size: 275.4 KB