Analysis of WiMAX Networks with Bandwidth Allocation Algorithms (Round Robin and Strict Priority)
Khan Mubeen Ahmed1, Bandhu Kailash Chandra2

1Khan Mubeen Ahmed, Department of Computer Science and Engineering, Mewar University, (Rajasthan), India.
2Bandhu Kailash Chandra, Department of Computer Science and Engineering, Mewar University, (Rajasthan), India.
Manuscript received on 02 June 2019 | Revised Manuscript received on 27 June 2019 | Manuscript Published on 04 July 2019 | PP: 19-22 | Volume-8 Issue-1S4 June 2019 | Retrieval Number: A10050681S419/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: IEEE 802.16 is today playing a promising and challenging role in wireless network and thus it is considered to be a substitute solution to agitated technologies. Availability of network in all the way is an important challenge for WiMAX networks. Lesser availability of network in rural, hilly, lakes and sea shores is a major issue today. Various algorithms in wireless networks are available for allocation of data and services today. This paper focuses on evaluating the performance of WiMAX networks with increasing number of nodes and distances. This paper proposes two important algorithms Round Robin for Relay and Strict Priority in WiMAX Networks. By analyzing it in WiMAX networks, in terms of throughput and Goodput, could play a supportive role for industries and researcher for implementing it in real scenarios. Implementing these algorithms in WiMAX networks at base stations could be efficient for sustaining maximum number of users in terms of data usage and calls.
Keywords: 802.16, Light WiMAX Simulator (LWX), Broadband Wireless Access (BWA), Round Robin (RR), Strict Priority (SP).
Scope of the Article: High Speed Networks