Multiple transceivers based wimax mesh network to optimize routing algorithm

Abstract

The Base Station (BS) is a WiMAX (Worldwide Interoperability for Microwave Access) centralized scheduling mesh topology decision maker for scheduling the whole network including allocation of packets between the Subscribers (SSs) in the network through the BS. Hence, the system, which, by interference, especially affects the nodes, close to BS. A network routing algorithm was built for mesh topology named Energy Bit Minimum Routing (EBMR), which is used to optimize the chosen path. all nodes were fitted with a multi-channel and four scenarios were planned: the first scenario is called the Multi-Transceiver fitted both SSs with a multi-transceiver except at the brink without cap the number of parent nodes. Whereas the second scenario was called Closest Multi-Transceiver system no ceiling on the number of parent nodes, in this scenario only the nearest BS is fitted with multi-transceiver SSs. The third scenario used the Multi-Transceiver system but with cap the number of parent nodes by 30% for whole nodes network. The fourth scenario used the closest Multi-Transceiver system but with cap, the number of parent nodes by 30%, for whole nodes network. In scenarios, the system content considers 120 users as maximum. It will improve the network capacity, throughput, channel scheduling range and channel utilization ratio (CUR). WiMAX mesh topology is used to centralize scheduling and improve the performance system by finding the best route to centralizing the mesh network EBMR; consequently, it increases latency, CUR and distance scheduling, avoiding messing, otherwise. Multi-transceiver network is used to prevent primary interference and multi-channel network used to stop secondary interference. This paper develops two styles of network: the multi-transceiver multi-channel network and the closest multi-transceiver multi-channel device that uses the Time Division Multiple Access (TDMA) algorithm for EBMR-CS3,4 (Energy Bit Minimization Routing and centralized Scheduling). This algorithm is optimizing network efficiency by having higher throughput by preventing interaction with adjacent nodes and the scheduling duration and growing the device’s channel utilization ratio (CUR).