WiMAX Mesh Topology with Modified Fair Centralized Scheduling and Routing Algorithms Based on Testing Feature of Down-Node Group

Abstract

Multiple access interferences are the major limiting factors for the performance of multihop WiMAX based Mesh Network (WMN). The routing algorithms play an important role in reducing such interferences among the nodes of the WMN. In this paper a new Routing Tree Construction Algorithm (RTCA) which is based on Balancing the data and Parallelizing the routes of the data from nodes to BS is proposed and called BalancedParalleled RTCA (Bala-Para-RTCA). This algorithm has a new Down-Node Group Testing (DNGT) feature. This feature increases the conversion of primary into secondary interferences which (in conjunction with directivity) can be avoided significantly by the Modified Fair Relay Centralized Scheduling (MFRCS) algorithm, as a result concurrent transmissions over a certain slot will be increased. So system performance is enhanced in terms of scheduling length, links concurrency ratio (LCR) and average transmission delay (ATD). Without directivity and relative to the standard Breadth First Tree (BFT) RTCA, the simulation results of the proposed RTCA show concurrency ratio enhancement of 15.38% and 19.4% without and with DNGT respectively.