Received: 28 June 2022 Revised: 26 July 2022 Accepted: 29 July 2022

DOI: 10.1002/dac.5318

RESEARCH ARTICLE

Worldwide Interoperability for Microwave Access network

optimization with and without relay station for next
generation internet access

Mubeen Ahmed Khan1 | Awanit Kumar1 | Kailash Chandra Bandhu2

1
Department of Computer Science and
Engineering, Sangam University,
Bhilwara, Rajasthan, India
2
Department of Computer Science and
Engineering, Medi-Caps University,
Indore, Madhya Pradesh, India
Correspondence
Kailash Chandra Bandhu, Department of
Computer Science and Engineering, Medi-
Caps University, Indore, Madhya Pradesh,
India.
Email: kailashchandra.bandhu@gmail.com
Summary
Enhancement of network performance is a big challenge today for the emerg-
ing technology based on IEEE 802.16. Wireless technology is an alternate solu-
tion to wired technology. Network availability all the way is an important
challenge in day-to-day life. Due to the huge population, the availability of the
network is again a big challenge. Also, it becomes more difficult to capture the
network if considering rural areas, hilly, lakes, and seashores today. This work
proposed relay stations in WiMAX (Worldwide Interoperability for Microwave
Access) networks along with various bandwidth allocation algorithms to
increase the signal strength over the long distance using retransmission of the
original signal by relay station and extend the coverage with a higher data rate
and higher user capacity. The availability of WiMAX networks for the channel
bandwidth assignment to users for data and service is very important in today's
scenario. This paper focuses on evaluating the performance of bandwidth allo-
cation algorithms in light WiMAX networks with and without relay stations.
The performance evaluation is done by increasing the number of nodes with
various bandwidth allocation techniques with and without relay stations. In
this work the round robin and strict priority algorithms are used for channel
bandwidth allocation in a light WiMAX network and performance is analyzed
through throughput, goodput, and packet drop rate, which will help to imple-
ment and configure the suggested optimal parameters in the production envi-
ronment. This work enhanced the throughput and goodput and reduce the
dropout rate, and the user capacity also increased.

KEYWORDS
channel bandwidth allocation algorithm, IEEE 802.16, light WiMAX, round robin, strict
priority

1 | INTRODUCTION

Broadband wireless access is applicable for voice calls using Voice over IP (VoIP), and data services (such as video con-
ferencing, interactive gaming, and multimedia streaming) in today's Broadband Wireless Access (BWA) services for
rural areas where cable connection is not possible, and it is an alternative for cable broadband networks.1

Int J Commun Syst. 2022;e5318. wileyonlinelibrary.com/journal/dac © 2022 John Wiley & Sons Ltd. 1 of 13
https://doi.org/10.1002/dac.5318
2 of 13 KHAN ET AL.

Various standards have designed the IEEE working group on Broadband Wireless Access (BWA) internet service.
To achieve goals like high data rate deployment, large area coverage, and to use of large frequency spectrums in the
available networks, BWA could play a challenging role. The voice, video, and data services are available in IEEE
802.16 at lesser costs today. The IEEE 802.16 Point to Multipoint (PMP) architecture can be deployed in an easy and
lesser cost-effective in Worldwide Interoperability for Microwave Access (WiMAX) networks.2
Clients are connected to subscriber stations (SSs) for data transfer with relay stations and without relay stations. All
the SSs have to be synchronized with base station (BS) via relay link for data transmission and all the SSs are also
allowed to send the data from BSs. The BS communicated to all SS via relay station (RR) at the beginning of each frame
via the uplink map. The transportation of data in WiMAX networks could play a promising role in wireless communi-
cation networks. The allocation of proper channel bandwidth along with a relay station for data usage could play an
effective role in IEEE 802.16. An important concept is that using a relay station in WiMAX networks could enhance the
coverage of the BS.3
In the present era, there is a requirement for wireless broadband internet access for everyone and it is not only for
stationary wireless users but also for mobile wireless users. Every user demands better connectivity, coverage, speed,
mobility, user capacity, and availability at a low cost. The problems of wireless fixed users are resolved by installing the
sender station and receiver station on the building rooftop with line-of-sight connectivity. This solution provides high-
speed broadband internet access to fixed wireless users at a low cost. But there is still the problem of high-speed broad-
band internet access, signal strength, coverage, and user capacity for mobile wireless users especially when the users
travel from one location to another location at high speed. The user faces all the mentioned issues during traveling, the
calls and data connectivity is lost due to handover from one BS to another. The BS connects to the relay station with
channel bandwidth allocation techniques that can resolve the issues related to the high-speed broadband internet
access, signal strength, coverage, and user capacity for mobile wireless users up to a certain level at a low cost because
the installation of relay station is less than the BS.
The round robin bandwidth allocation technique is supported with and without relay stations in the WiMAX net-
work which is used in the proposed work but the strict priority algorithm for bandwidth allocation does not support
relay stations in the WiMAX network by the simulation tool, hence it is not considered in the proposed work.
In this study, it is found that very limited researchers worked on the Light WiMAX (LWX) with channel bandwidth
allocation algorithms with frame duration and there is scope the work on it.
In this work the researcher can apply round robin and strict priority algorithms without modifying and recompiling
those algorithms in LWX and can study and analyze the performance of LWX with frame duration. In this work, the
round robin and strict priority are implemented with and without relay stations to analyze the performance of WiMAX
networks.

2 | LITERATURE S URVEY

The various works are reviewed related to the WiMAX, LWX, and LWX with relay stations and without relay stations.
The relevant studies are given below.
This work compared the performance of transmission control protocol (TCP) variants such as new reno, sack1,
linux, and vegas in WiMAX technology and determined the optimal Medium Access Control (MAC) parameters along
with some optimal operating parameters for higher data rate and this technology is useful for rural areas where the
wired network is not possible.4
This work compared the performance of TCP variants under the bandwidth asymmetry, varying downloading (DL),
and uploading (UL) ratios for different propagation models, and the varying number of downloading nodes with the
full-duplex mode of data transmission in the WiMAX network. This work determined that a higher DL, UL ratio sup-
port to the larger number of downloading nodes in the case of TCP linux and TCP new reno was performed better for
two ray ground model with higher DL, UL ratio.5
This work analyzed the TCP linux performance in the WiMAX network by varying the parameters such as DL, UL
ratio, channel bandwidth, cyclic prefix, modulation & coding schemes, frame duration, propagation models, mode of
data transfer, downloading traffic, and some other operation parameters and proposed the optimal parameters for
higher data rate.6
This work analyzed the TCP vegas performance in the WiMAX network by varying the parameters such as DL, UL
ratio, channel bandwidth, cyclic prefix, modulation & coding schemes, frame duration, propagation models, mode of
KHAN ET AL. 3 of 13

data transfer, downloading traffic, and some other operation parameters and proposed the optimal parameters for
higher data rate. The performance was measured using throughput, goodput, and packet drop rate.7
This work presented the comparison of the different TCP flavors such as TCP linux, sack, new reno, and vegas with
different parameters such as frame duration, modulation & coding schemes, and other operating parameters such as
downloading traffic and simulation duration under the bandwidth asymmetry in WiMAX technology. This work
suggested that the TCP New Reno was a better variant as compared to others.8
This work presented the performance of a network that is dependent on various factors, and frame duration is one
of them; in this work, the comparative study of different frame duration is done with the Strict Priority (SP) channel
bandwidth allocation technique in the WiMAX network and suggested that the increase in frame duration degrade the
performance.9
This work evaluated the effect of frame structure type in WiMAX networks such as single frame and multi-frame
with non-transparent relay stations (ntRS). The performance evaluation is done using NS2 with Light WiMAX, which
supports ntRS and Quality of Service (QoS) and they suggested that the multi-frame structure support to higher data
rate and the single frame gives the general advantage of delay.10
In this work, the Round Robin (RR) scheduling techniques is applied in the wireless network for channel band-
width allocation. They utilized a counter to keep track of the time of each since its last service using Time-Since-Last-
Service (TSLS) and observed the scheduling with maximum TSLS for a single server in RR fashion. They observed that
it balances the tradeoff between the TSLS and channel rate for each line and provides the maximum throughput, which
is better than the traditional approach and also validates certain properties such as delay insensitivity and short-term
fairness performance.11
In this work, they focused on forced termination probability, which is an important criterion for evaluating perfor-
mance in personal communication service networks. In this work the force termination is running call is assumed as
less desirable as compared to the blocking of the initial access of the new call. They observed that the high priority
given to hand-off over the initial access attempt will dramatically improve the probability of force termination by
degrading the number of failed initial access attempts.12
In this work, the various congestion control techniques used at the transport layer and medium access control layer
in a wireless sensor network are compared and analyzed. The comparison is done based on traffic direction, energy con-
servation characteristics, and efficiency.13
This work focused on the internet of things based on wireless sensor networks and observed that the sensor nodes
suffer from energy limitations. This work proposed dynamic energy-efficient clustering for energy hole mitigation. The
framework consists of two halve of regions with each half a gateway node selected to collect the data from the
corresponding half region. In each cluster, the two cluster heads are selected and one of them will be in an active state
other will be in a sleep state until 60% of energy is consumed from the active node. The parameters used to select the
gateway node and cluster heads are residual energy, the separation between the node and sink, the number of neigh-
bors’ nodes, and network residual energy. This work enhanced the 5% and 31% stability periods compared to MEEC
and IDHR protocols and a 56% network lifetime was improved compared to the MEEC protocol.14
This work emphasizes energy efficiency and the design of a reliable routing protocol for underwater sensor net-
works using sector-based forwarding techniques. The sector-based forwarding technique is used for reliable routing effi-
ciently and securely. This work suggested that the whole network is divided into sectors for optimization of the hop
count, which helps in energy-efficient data delivery, in the sector-based network topology technique, the vertical data
forwarding is done by maintaining sector-wise order with the help of pivot node, which is also known as sector head.
This work was used to identify and reduces the hop count for energy-efficient and effective data communication
enhancement in underwater wireless sensor network.15
In this work deficit round robin (DRR) packet-based scheduling is suggested in the wired network but it is not use-
ful for wireless networks. In this work, the existing DRR is modified with fragmentation and named it deficit round
robin with fragmentation (DRRF) and used in the wireless network to allocate the channel resources fairly with chang-
ing bandwidth. This work gives improved throughput than DDR and less overhead than general process sharing (GPS).
It used DRRF to provide 6.3 Mbps throughput for 10 nodes.16
This work emphasizes on end-to-end quality of service should be maintained in the WiMAX network for real-time
multimedia applications, and it is possible using an intelligent scheduling algorithm. This work proposed a cross-layer
scheduling algorithm for bandwidth allocation to improve the quality of service for each subscriber of the WiMAX net-
work using an increase in signal-to-noise ratio. The results of this work show a reduction in packet loss rate and delay,
4 of 13 KHAN ET AL.

the throughput increased by 12.8%. The obtained throughput is 0.4 Mbps for 10 nodes in the case of a cross-layer sched-
uling algorithm.17
This work is done to improve the real-time polling service for a bandwidth request; the subscriber sends the band-
width request to the BS, and the BS multicast the polling to the SS by padding the bandwidth request unintentionally.
Due to this, the bandwidth request is lost and degrades the performance of the real-time polling service. In this work,
the proposed scheme is to improve the performance of the real-time polling service. This work provides the 1.5 Mbps
throughput for 10 nodes.18
This work explained the WiMAX multi-hop relay for quality-of-service provisioning, different type of relay stations,
their working schemes, benefits, usage model, relay operation modes, scheduling modes, and the optimal number of
hops. The WiMAX relay station-based architecture was used to extend the coverage and enhanced the service user
capacity to reduce the cost of service for rural communities and remote areas. This work recommended the three hops
for optimal relay system deployment, between two and three hops with centralized scheduling deployment in small
scale was recommended and in large scale system, more than three hops with decentralized scheduling deployment
were recommended. This work suggested that the intracell throughput was increased by using a transparent relay sta-
tion with centralized scheduling deployment in a small-scale system and range extension and throughput enhancement
of the non-transparent relay with centralized and decentralized deployment in a large-scale system used. This work
suggested designing a BS schedular to guarantee the end-to-end quality of service delivery by channel state and quality
of service parameters.19
This work emphasizes WiMAX IEEE802.16j, which provides an effective solution by adding a relay station in multi-
hope WiMAX IEEE802.16j to improve the signal-to-noise ratio and network capacity. This work used a linear model for
fair wireless resources to subscribers. This work also implemented a relay selection algorithm to improve the perfor-
mance of the network in forms of throughput up to 66% with a relay station in a fixed WiMAX network. The future
scope suggested in this work is that apply relay stations for different quality of service and analyze the performance.20
This work studied the basic concept, application, advantages, and disadvantages of mobile WiMAX along with the
performance of mobile WiMAX on MATLAB tool by considering different channels and different modulation and cod-
ing schemes. In this work, a comparison is done between signal-to-noise ratio (SNR) and bit error rate (BER) and it is
found in this work that the WGN and multipath fading channel both provide high data rates.21
This study is based on an investigation of WiMAX IEEE802.16e/m technology using OPNET simulation modeler
14.5 in three different locations in Botswana. The finding of this work suggests that it is more suitable for the high-
density area and rural areas where infrastructure challenges are there. It provides a high-speed data rate of up to
70 Mbps with 5 to 15 km of connectivity at the line of sight with the next BS and connectivity can be increased up to
90 km.22
Bandwidth Allocation Algorithms: The round robin algorithm has various advantages such as the problem of starva-
tion being resolved. All the processes share a defined time interval. Time slice is defined as the allocation of limited inter-
vals of time slices on the BS. The amount of time that each job process is in contention for the full utilization of the
BS.23,24 All the processes are executed in the allotted time slice. Either the job will finish in the allotted slice given or the
job will be returned to the tail of the job queue and returned to the processor of the BS at a later time. The short virtual
process is given priority and long ones are panelized in the round robin algorithms.25 Another problem is that the time
slices must be correct unless there may be other problems. The context switching time increased when the time slice
value is too low and is managed by the BS. For the round robin to be non-preemptive, the time slice should be needed
small. For better output, the length of the job should be adequate to complete maximum jobs on a given time slice.25
While considering priority scheduling, which could be preemptive or maybe non-preemptive and the starvation
problem exists. The packet loss is controlled by the BS using the last task completion, and priority of the waiting task.26
When higher priority processes come in a ready state then it is possible that lower priority processes to be neglected. In
nonpriority preemptive scheduling, a high-priority process that took a long time on the BS could create a starvation
environment.
Relay stations: IEEE 802.16j is an improvement to previous 802.16 standards, which provides support for relays, pro-
viding increased capacity and/or coverage, depending on the scenario.10 In this work, the network parameter optimiza-
tion is emphasized in the enhancement of the data communication rate between the BS and the new relay station.
There have been some contributions in this space to provide some answers.
In the literature survey, it is found that the researchers worked on scheduling techniques, signal-to-noise ratio, con-
gestion control algorithm, quality of service, relay selection techniques, and round robin bandwidth allocation algo-
rithm were used with multi-hop WiMAX relay network. The TCP variants are used in various works done by
KHAN ET AL. 5 of 13

researchers. Among all these works, no work is done in relay stations with bandwidth allocation algorithms like round
robin and strict priority, therefore the proposed work majorly focuses on network planning in multi-hop WiMAX relay
network which is a bigger challenge that was not previously given in radio planning approaches. Hence, the proposal is
given so that the relay station gives benefit to all BSs and subscribers stations to enhance the performance. The pro-
posed work included one BS with and without a relay station with round robin and strict priority bandwidth allocation
algorithms.

3 | NETWORK S TRUCTURE

The network setup used to analyze the performance of light WiMAX with a relay station is shown in Figures 1 and 2.
The simulation network setup consists of one BS, RS, and many SSs with round robin and strict priority channel alloca-
tion algorithms. The performance is analyzed with uplink and downlink from the BS to the SS and various parameters
are taken to analyze the results and a scenario is created using NS2.27 For downlink transmissions, a BS transmits data
to SSs and the uplink packet transmission with acknowledgment using TCP connections. In this paper downlink TCP
connections from the BS to SSs with and without relay are established which is shown in Figures 1 and 2. In this work
two types of bandwidth allocation algorithms, round robin and strict priority are used for network performance
analysis.
The topology includes two types of scenarios. In the first scenario, a BS with many SSs, which directly communicate
with each other without a relay station, which is shown in Figure 1, and in the second scenario, one BS is connected
with SSs via relay stations that communicate to each other via relay station which is shown in Figure 2. The wireless
TCP connections are established to send data packets for both scenarios.
After creating both the network topologies (Figures 1 and 2), the simulation parameters are configured in the tool
command language (TCL) script as mentioned in Section 4 for both the network topologies then start the simulation on
NS2. The trace files are generated by NS2 and throughput, goodput, and drop rate are extracted from trace files by exe-
cuting the AWK script on linux operating system and obtained results are discussed in Section 5, which is shown in
Figure 3. Section 6 contains the conclusion; Section 7 explained the future direction followed by a declaration, and at
last, references are there.

FIGURE 1 Network topology without relay station

FIGURE 2 Network topology with relay station

6 of 13 KHAN ET AL.

FIGURE 3 Implementation flow

TABLE 1 Parameters used for simulations with and without relay stations

Parameters Values
Routing protocols AODV
Transmission control protocol TCP
Channel bandwidth allocation algorithms Round robin and strict priority
Simulation duration 300 s
Number of wireless subscriber stations (SSs) 10, 20, —, 100, 200
Frame duration 0.005
Frame symbol 48

4 | SIMULATION PARAMETERS

Performance analysis of channel bandwidth allocation algorithm in light WiMAX networks with and without relay sta-
tions is performed by configuring simulation parameters mentioned in Table 1.
Routing protocols are used to route the shortest path between the sender and the receiver for switching into the net-
work, and the use of self-defined rules to communicate between the source and the destination. In this paper, ad-hoc
on-demand distance vector routing (AODV) is a routing protocol in which routes are created only when it is requested.
In this protocol information like destination address, next hop address sequence number, the lifetime of nodes, and the
destination sequence number are identified.
The TCP allows sending the data in the form of packets and it is responsible for end-to-end delivery at the transport
layer. It is reliable, congestion control and simple protocol for data transmission.
Channel bandwidth allocation is used for channel allocation techniques. The objective of this is to use maximum
system utilization in terms of frequency reuse to avoid co-channel interference and to share maximum bandwidth
among the nodes.
Simulation duration is the total amount of time for data transfer.
Frame Duration is the length of a frame in time.
Frame Symbol indicates the payload between the start and end of payload data within the streams of symbols or
received bits.

5 | R E SUL T S

5.1 | Performance metrics

The three metrics are used to measure the estimated performance.

• The throughput measures the number of raw bytes sent by an origin.

Number of Packets Sent  8

Throughput ¼  106 Mbps ð1Þ
Simulation Duration
KHAN ET AL. 7 of 13

where the
Throughput: It represented the data transfer rate of the sender.
Number of packets sent: Total number of packets sent by sender each of size 1024 Byte.
Simulation duration: Total duration of data transfer in seconds.

• Goodput that successfully acknowledged dealing bytes.

Number of packets received  8

Goodput ¼  106 Mbps ð2Þ
Simulation duration

where the
Goodput: It represented the data received rate at the receiver.
Number of packets received: Total number of packets received by receiver each of size 1024 Byte.
Simulation duration: Total duration of data received in seconds.

• Packet drop rate.

Number of packets dropped  8

Drop rate ¼  106 Mbps ð3Þ
Simulation duration

where the
Drop rate: It represented the packet drop rate.
Number of packets dropped: Total number of packets dropped each of size 1024 Byte.
Simulation duration: Total duration of data dropped between sender and receiver in seconds.
The throughput, goodput, and drop rate are converted into Mbps by multiplying 8 * 106.

5.2 | Discussions

The simulation is done in NS2 with a light WiMAX module and obtained results are presented and discussed in this
section.
It is observed from Figure 4 that higher throughput is obtained as the number of nodes is lesser and this is only due
to higher order modulation techniques. When the number of SSs increases then a single Orthogonal Frequency Divi-
sion Multiplexing (OFDM) symbol carries multiple bits. Also, wireless channel suffers from delay due to the existence

FIGURE 4 Throughput with and without relay station for round robin
8 of 13 KHAN ET AL.

of multiple propagation paths, especially in None Line-of-Sight (NLOS) conditions. For longer symbol data, the delay
spread is small in a significant fraction of the symbol length, so as the minimal delay spread. The results show that the
round robin algorithms without relay performed much better than the round robin algorithm with relay station. For
10 nodes it observed 1.75 Mbps throughput for round robin algorithm and whenever the number of nodes increases the
throughput increases up to 1.77 Mbps. The reason behind the higher performance is that for fewer SSs full channel uti-
lization happens, and when the number of nodes increases complete bandwidths are utilized and throughput
decreases.
It is observed in Figure 5 that the value of goodput is also obtained maximum when the number of nodes is lesser
for the connection. The obtained goodput in the round robin algorithm is 1.755 Mbps for 10 SSs and 1.70 for 200 nodes.
From the analysis, it is observed that in the case of the round robin algorithm, the goodput is 1.754 Mbps for 10 nodes
and 1.74 Mbps for 100 nodes. In the case of with relay station, it is observed 2.77 for 10 nodes and 0.014 for 200 nodes
and this is due to the number of packets per second transferred also increases, the data transmission capacity of the
channel also increases and hence is obtained highest goodput in lesser SSs. The reason for higher goodput for a lesser
number of nodes is due to maximum utilization of channel on increasing SSs.
It is observed in Figure 6 that the number of dropped packets is more for lesser nodes and lesser for the higher num-
ber of nodes, this is because when packets are sent then there is less possibility of packets being lost since the signal is
transmitting with maximum power from the BS. When the number of nodes increases traffic load also increases due to
which after a certain interval of time it enters into the waiting for state and drops after a long waiting time. From the
analysis, it is observed that packet dropping also increases as the number of nodes increases since modulation could
not be maintained for more subscribe stations. Another reason for increased dropped packets is due to the NLOS envi-
ronment in which modulations could not be maintained.
It is observed from Figure 7 that strict priority without relay stations performs better much better results than the
round robin algorithm without relay stations. The result shows the observed throughput is 10.51 Mbps in strict priority

FIGURE 5 Goodput with and without relay station for round robin

FIGURE 6 Drop rate with and without relay station for round robin
KHAN ET AL. 9 of 13

FIGURE 7 Throughput with and without relay station by considering the number of nodes for round robin and strict priority

FIGURE 8 Goodput with and without relay station by considering the number of nodes for round robin and strict priority

without a relay station for 10 nodes and 9.87 Mbps for 200 nodes. While it is observed at 2.77 Mbps in the round robin
with relay stations for 10 nodes and 0.20 Mbps for 200 nodes. Throughput in case of without relay station is observed
1.758 Mbps for 10 nodes and 1.25 Mbps for 200 nodes. The results in the case of strict priority with relay stations are
not taken since strict priority does not support relay stations.
It is observed from Figure 8 that the value of goodput is also obtained maximum when the number of nodes is lesser
for the connection. The goodput in the round robin algorithm is 10.76 Mbps for 10 nodes without relay station in strict
priority, while obtaining 9.87 Mbps for 100 nodes. Similarly, when it is taken with a relay station in the round robin
algorithm. When round robin and strict priority algorithms are compared with and without relay stations, it is observed
that goodput without relay station performs better for the higher number of nodes. The reason for higher goodput for a
lesser number of nodes is due to maximum utilization of channel on increasing SSs.
It is observed in Figure 9 that the number of dropped packets is more in strict priority as compared to round robin;
this is because when packets are sent the signal is transmitted with maximum power from the BS. When the number of
nodes increases, traffic load also increases. Packet drops rate in the case is 10 nodes is obtained 0.00258 for 10 nodes
and 0.0458 for 200 nodes in case of with relay stations. In the case without a relay station, it is observed at 0.004 for
10 nodes and 0.0468 for 200 nodes. In the analysis, it is observed that packet dropping also increases as the number of
nodes increases since modulation could not be maintained for more subscribe stations. Analysis of algorithms shows
that strict priority gives much better throughput than round robin for relay algorithm.
When all the algorithms are compared, then again, it is observed that strict priority performs much better in the
case without relay stations, which are shown in Figure 10. The throughput observes was much better than the rest of
the algorithms used. The performance of strict priority gives better results in the case of 10 nodes as well as for
100 nodes too. When compared with 10 nodes, 20 nodes, 30 nodes, or even 100 nodes it is observed that it provides a
throughput of 10.51, 9.81, 9.84, and 10.40 Mbps, respectively, which is much higher than without a relay station in the
round robin and with relay station for RR for the relay. It is observed that 83.2% better than without relay station for
round robin for 10 nodes and 87.33% is better than without relay stations for round robin for 200 nodes.
10 of 13 KHAN ET AL.

FIGURE 9 Drop rate with and without relay station by considering the number of nodes for round robin and strict priority

FIGURE 10 Throughput comparison by considering the number of nodes with and without relay

FIGURE 11 Goodput comparison by considering the number of nodes with and without relay

It is observed from Figure 11 that the value of goodput is also obtained higher in case of any number of nodes when
compared with without relay station in the round robin and without relay station in strict priority. Goodput without a
relay station is observed as 82.9% better than goodput without a relay station in the round robin for 10 nodes and
83.06% better than goodput without a relay station in the round robin for 200 nodes. On comparing goodput with and
without relay station it is observed 36.8% only for 10 nodes, but several nodes increase, it is observed that goodput with-
out relay station gives better performances for 20, 30, 40, and other nodes in case of round robin algorithm without
relay stations.
From the analysis, it is observed in Figure 12 that the number of dropped packets is lesser in the case of round robin
for the relay without relay stations. Packet drops rate also obtained higher in case of without relay station in strict
KHAN ET AL. 11 of 13

FIGURE 12 Packet drop rate comparison by considering the number of nodes with and without relay

TABLE 2 Performance comparison with and without relay stations with existing work

Deficit round robin Cross-layer Proposed approach

with fragmentation scheduling Real-time polling Proposed approach (round robin)
scheduling (without (without relay service (without (strict priority) (with relay
Parameters relay Station)16 station)17 relay)18 (without relay) station)
Throughput 6.3 Mbps 0.4 Mbps 1.5 Mbps 10.5 Mbps 2.775 Mbps
(10 nodes) (10 nodes) (10 nodes) (10 nodes) (10 nodes)
Goodput - - - 10.49 Mbps 2.772 Mbps
(10 nodes) (10 nodes)
Drop Rate - - - 0.003 Mbps 0.00258 Mbps
(10 nodes) (10 nodes)
Throughput - - - 10.09 Mbps 0.214 Mbps
(100 nodes) (100 nodes)
Goodput - - - 10.06 Mbps 0.190 Mbps
(100 nodes) (100 nodes)
Drop Rate - - - 0.033 Mbps 0.0233 Mbps
(100 nodes) (100 nodes)
Throughput - - - 10.01 Mbps 0.210 Mbps
(200 nodes) (200 nodes)
Goodput - - - 9.99 Mbps 0.180 Mbps
(200 nodes) (200 nodes)
Drop Rate - - - 0.02 Mbps 0.03 Mbps
(200 nodes) (200 nodes)

priority. Several nodes increase packet dropping also increases in all the three comparative algorithms. This is because
as the number of nodes increases, modulation could not be maintained for more subscribe stations due to which packet
drop rate increases. From the analysis, it is observed that the packet drop rate without a relay station in the round robin
for 10 nodes is obtained at 0.76% more than the packet drop rate with a relay station. In comparing with strict priority,
it is observed that packet losses in strict priority are 35% lesser than round robin for 10 nodes and 4.8% better than
round robin algorithm for 200 nodes.
Table 2 shows that the previous work done by the research was on different scheduling techniques16–18 but did not
use strict priority and round robin algorithms by any researcher. So that this work is compared with the previous work
in terms of throughput, goodput, and packet drop rate. This table gives a comparative study and it is clear that the pro-
posed approach gives better results and it is about 41.3% better than existing work,16 96.2% better than existing work17
and 86.04% better than existing work18 for strict priority in the proposed approach. This result shows that the proposed
approach is much better than the existing approach16–18 in terms of throughput, goodput, and drop rate which is shown
12 of 13 KHAN ET AL.

FIGURE 13 Throughput/goodput/drop rate comparison with and without relay stations with existing work

in Figure 13. This work is also worthful since previous work was done for a lesser number of nodes, which is carried
out by only 10 nodes, but this research work is carried out with a greater number of nodes which gives a real-time sce-
nario for network enhancements in WiMAX networks which make this work novel and implementable for real-life
scenarios.

6 | C ON C L U S I ON

In this work, the performance of the WiMAX system is analyzed with two important bandwidth allocation algorithms
named round robin and strict priority. The simulation results show that strict priority performs better than round robin
algorithms in the WiMAX network. When the number of nodes increases it is observed that obtained throughput is
higher in the case of a strict priority than round robin. Higher throughput is obtained with lesser nodes in case of strict
priority as compared to round robin. The goodput gives better results in strict priority. As the number of nodes
increases, dropped packets are obtained higher in case of a strict priority than round robin. The throughput and
goodput of the proposed approach (Strict Priority Without Relay) are 10.5 and 10.49 Mbps for 10 nodes are obtained
respectively and the obtained throughput and goodput of the proposed approach (Round Robin With Relay Station) are
2.775 and 2.772 Mbps, respectively.

7 | FUTURE WOR K

Future work could be carried out with other channel allocation algorithms. Adding different service types could also be
done for further research. The analysis could also be done by increasing simulation times, the number of nodes, and
the number of relay stations. The analysis could also be done for user datagram protocols (UDP) with different frame
durations.

CONFLICT OF INTEREST
The authors declare that there is no conflict of interest.

C O D E A V A IL A B I L IT Y
Code is available on request due to privacy or other restrictions.

DATA AVAILABILITY STATEMENT

Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.

ORCID
Kailash Chandra Bandhu https://orcid.org/0000-0002-4337-4198
KHAN ET AL. 13 of 13

R EF E RE N C E S
1. Ahson SA, Ilyas M. WiMAX. CRC Press; 2018. doi:10.1201/9781315219905.10.1201/9781315219912
2. “IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems,” IEEE
Std 802.16-2004 (revision of IEEE Std 802.16-2001). pp. 0_1-857, 2004. doi:10.1109/IEEESTD.2004.226664
3. Swain CMK, Das S. Effects of threshold based relay selection algorithms on the performance of an IEEE 802.16j mobile multi-hop relay
(MMR) WiMAX network. Digit Commun Networks. 2018;4(1):58-68. doi:10.1016/j.dcan.2017.09.003
4. Bandhu KC. Performance Comparison of Transmission Control Protocol Variants in WiMAX Network with Bandwidth Asymmetry,
vol. 870. 2019. doi:10.1007/978-981-13-2673-8_27
5. Bandhu KC, Bhansali A. “Comparison of Transmission Control Protocol Variants for Two Way Transfer and Propagation Model with
WiMAX Network Bandwidth Asymmetry,” in 2020 5th IEEE International Conference on Recent Advances and Innovations in Engi-
neering, ICRAIE 2020 - Proceeding, 2020, pp. 1-5. doi:10.1109/ICRAIE51050.2020.9358329
6. Bandhu KC, Vishwakarma RG. “Performance analysis of TCP Linux in WiMAX network with network asymmetry,” 2016. doi:10.1109/
IC4.2015.7375654
7. Bandhu KC, Vishwakarma RG. Performance evaluation of TCP Vegas in WiMAX network asymmetry. Int J Wirel Mob Comput. 2016;
10(2):97-103. doi:10.1504/IJWMC.2016.076165
8. Bandhu KC, Bhansali A. Impact of frame duration and modulation coding schemes with WiMAX bandwidth asymmetry in transmission
control protocol variants. Int J Wirel Networks Broadband Technol. Jan. 2019;8(1):35-45. doi:10.4018/IJWNBT.2019010103
9. Khan MA, Bandhu KC. Performance research of WiMAX networks with frame periods in strict priority. Int J Recent Technol Eng. Sep.
2019;8(2 Special Issue 11):2030-2032. doi:10.35940/ijrte.B1195.0982S1119
10. Kolomitro P, Abd-Elhamid MT, Hassanein H. A performance comparison of frame structures in WiMax relay networks. IEEE Local
Comput Netw Conf. 2010;769-776. doi:10.1109/LCN.2010.5735810
11. Li B, Eryilmaz A, Srikant R. “Emulating round-Robin in wireless networks,” 2017. doi:10.1145/3084041.3084052
12. Lin Y-B, Mohan S, Noerpel A. Queueing priority channel assignment strategies for PCS hand-off and initial access. IEEE Trans Veh
Technol. 1994;43(3):704-712. doi:10.1109/25.312778
13. Kharb K, Sharma B, Aseri D. Reliable and Congestion Control Protocols for Wireless Sensor Networks. Int J Eng Technol Innov. 2016;6:
68-78. PMID: [Online]. Available: https://ojs.imeti.org/index.php/IJETI/article/view/43
14. Dogra R, Rani S, Sharma B, Verma S, Anand D, Chatterjee P. A novel dynamic clustering approach for energy hole mitigation in inter-
net of things-based wireless sensor network. Int J Commun Syst. Jun. 2021;34(9):e4806. doi:10.1002/dac.4806
15. Kumar R, Shekhar S, Garg H, Kumar M, Sharma B, Kumar S. EESR: energy efficient sector-based routing protocol for reliable data com-
munication in UWSNs. Comput Commun. 2022;192:268-278. doi:10.1016/j.comcom.2022.06.011
16. So-In C, Jain R, Tamimi A-K. “A Deficit Round Robin with Fragmentation Scheduler for IEEE 802.16e Mobile WiMAX,” in Proceedings
of the 32nd International Conference on Sarnoff Symposium, 2009, pp. 175-181.
17. Nandhini R, Devarajan N. Comparison for WiMAX Scheduling Algorithms and Proposal Quality of Service Improvement in WiMAX
Networks. Am J Appl Sci. 2013;11(1):8-16. doi:10.3844/ajassp.2014.8.16
18. Kuokkwee W. WiMAX: performance analysis and enhancement of real-time bandwidth request. IAENG Int J Comput Sci. Jan. 2013;40:20-28.
19. Bayan AF, Wan T-C. A review on WiMAX multihop relay technology for practical broadband wireless access network design. J Converg
Inf Technol. Sep. 2011;6(9):363-372. doi:10.4156/jcit.vol6.issue9.42
20. Mazhar N, Zeeshan M, Naveed A. Performance Impact of Relay Selection in WiMAX IEEE 802.16j Multi-hop Relay Networks. Int J Adv
Comput Sci Appl. Oct. 2019;10(9):383-391.
21. Ahmed S. “Performance analaysis of Mobile WiMAX Technology,” in 2014 International Conference on Computing for Sustainable
Global Development (INDIACom), 2014, pp. 959-961. doi:10.1109/IndiaCom.2014.6828106
22. Mokeresete M, Esiefarienrhe BM. Can the WiMAX IEEE 802.16 Standard Be Used to Resolve Last-Mile Connectivity Issues in
Botswana? Telecom. 2022;3(1):150-163. doi:10.3390/telecom3010010
23. Kaur A. Bandwidth allocation scheduling algorithms for IEEE 802.16 WiMax protocol to improve QoS: A survey. Int J Comput Appl.
2014;98(11):16-22. doi:10.5120/17227-7550
24. Sayenko A, Alanen O, Hämäläinen T. Scheduling solution for the IEEE 802.16 base station. Comput Netw. 2008;52(1):96-115. doi:10.
1016/j.comnet.2007.09.021
25. Silberschatz A, Galvin PB, Gagne G. Operating System Concepts. John Wiley and Sons, Inc; 2002.
26. Shahwan I, Muhammed A, Obaidat M, Dorsinville R. “WiMAX: Cross layer bandwidth allocation Strict Priority Based Adaptive Modula-
tion and Coding,” in 2011 International Conference on Communications and Information Technology (ICCIT), 2011, pp. 73-76. doi:10.
1109/ICCITECHNOL.2011.5762697
27. “The Network Simulator - Ns-2,” 2022. https://www.isi.edu/nsnam/ns/ (accessed Jun. 18, 2022).

How to cite this article: Khan MA, Kumar A, Bandhu KC. Worldwide Interoperability for Microwave Access
network optimization with and without relay station for next generation internet access. Int J Commun Syst.
2022;e5318. doi:10.1002/dac.5318