Vous êtes sur la page 1sur 9

International Journal of Computer Networking,

Wireless and Mobile Communications (IJCNWMC)


ISSN 2250-1568
Vol. 3, Issue 2, Jun 2013, 11-18
© TJPRC Pvt. Ltd.

FUZZY BASED MODIFIED REAL TIME POLLING SERVICE ALGORITH &


PERFORMANCE ANALYSIS OF SCHEDULING ALGORITHMS USED IN WIMAX

POULOMI DAS, SILADITYA SEN & ARINDAM BENERJEE


Department of Electronics and Communication Engineering, Heritage Institute of Technology, Kolkata, India

ABSTRACT

Increasing number of subscribers, devices & developed mobile applications boost the demand of data
communication. Also 3G service providers provide uninterrupted data service. So WiMAX will be the best for that. This
WiMAX technology is developing from a decade & now supporting mobile users. Therefore WiMAX can provide real
time services any time any where. To provide real time service quality of service must be high or there must be uniform
jitter, low end to end delay & high throughput. In this paper analysis of the performance of different scheduling algorithm
real time polling service available in WiMAX also analysis the performance of modified rtPS algorithm using fuzzy logic.

KEYWORDS: WiMAX, Service Class, rtPS, Modified rtPS, Fuzzy Logic, Performance Analysis, Jitter, Throughput

INTRODUCTION

WiMAX can serve affordably the rapid exponential growth in the number of subscribers & incredible
advancement in the wireless technology simultaneously need for data communication & real time applications with high
throughput, better coverage & moderate data rate. Advent to recent time gradually development of IEEE 802.16 will take
place [1,2]. Mobility feature was introduced from the version IEEE802.16e which again boosts the number of customers or
active subscriber at a particular time. To provide real time applications to mobile users also introduce a new challenge in
front of network designers that is to maintain proper Quality of Services (QoS). As number of service providers are
increased so QoS become one of the major unavoidable criteria to opt the service provider. A service provider can offer
different service to different users as per service level agreement (SLA). So there is need to schedule the subscribers
provide proper service. This paper performance analysis of different scheduling algorithms and modified real time polling
service is present [3, 4].

REVIEW OF WIMAX TECHNOLOGY

The IEEE 802.16 activities were initiated in August, 1998 in N-WEST (National Wireless Electronics Systems
Test-bed) meeting of National Institute of Standard & Technology in US [1,5]. At present standardization of IEEE
802.16m is going on. The IEEE 802.16 network basically contains two core components. The Subscriber Stations (SS) or
Customer Premises Equipments (CPE) & Base Stations. Base stations can provide Point to Point (P2P), Point to Multi
Point (PMP) & Mesh Mode connectivity. BS acts as central controller in a cell. There are independent channels for
transmission. WiMAX is connection oriented so all data transmission is connection oriented. Types of connection UGS,
rtPS, nrtPS, BE, ertPS. But before this polling service there are Request, Piggyback, Grants process are there. For IEEE
802.16e there is a connection resolution mechanism which helps to improve the QoS.

Quality of Service

The goal of QoS is to provide priority that is required by some real time & interactive traffic to ensure proper
12 Poulomi Das, Siladitya Sen & Arindam Benerjee

delivery of packets without any loss. Predictability of a network will also increased by introducing QoS. But in everyday
practice the QoS is not used in standard manner then also there are two basic features can be recognized Differential
Capability (Individual services within a network can be differentiated from one another & treated differently.) &
Allocation of Quality Parameter (certain quality parameters generally agreed in advance can be allocated to the service.)
Quality of Service also depends on available Bandwidth for data rate, Latency or delay made by a packet in network, Jitter
& Packet Losses. Those parameters are also depends on Scheduling [3].

Scheduling in WiMAX

Packet Scheduling Algorithms are implemented at both BS & SS. A scheduling algorithm at the SS is required to
distribute the bandwidth allocation from the BS among its connections. The scheduling algorithms can be classified as
Frame Based scheduling algorithm (WRR, DRR) [2,5], Sorted Based Scheduling Algorithms (WFQ, SCFQ) etc. Packet
Based Scheduling algorithms are low complex in computing but delay is more. Therefore in downlink WFQ is used as
delay is less. Uplink schedulers are Round Robin, Weighted Round Robin etc. Proper scheduling algorithm can enhance
the network performance improved polling services.

MODIFICATION IN REAL TIME POLLING SERVICE ALGORITHM

As present subscriber are interested in real time applications like video chatting, online gamming, video
conferencing, tracking etc so WiMAX have a separate service class rtPS. But the probability of latency or end to end delay
in rtPS will be more. So a Fuzzy based dynamic control is introduce for better performance. Total number of bit in a slot is
given by

bi _ sl = No * Ns * Cr *log2(b) …. (1)

Where No is the number of OFDMA symbol in one slot, Ns is the number of subcarriers per slot, Cr is the coding
rate and b is modulated symbol. Total data rate in one slot (Data_sl) is

Bi _ sl
Data _ sl = …. (2)
fra _ du

The number of slots (No_sl) required by each packet depends on the nature of the link and the packet size. A
packet with size P bytes requires a total number of physical slots given by

 8p 
No _ sl = ceil   …. (3)
 Bi _ sl 
Each packet is transmitted to subscriber station, with the estimated wireless link condition and hence the scheduler
will use this input to schedule the packet with given required QoS. [7]

Selection of Scheduling Algorithm

We use a fuzzy based method for selecting the proper scheduling algorithm. Five inputs used to design the fuzzy
logic are, Expiry time (E), Waiting time (W), Queue length (Q), Packet size (P) and Type of service.
Fuzzy Based Modified Real Time Polling Service Algorithm & Performance Analysis of Scheduling Algorithms Used in WiMAX 13

Figure1: Dynamic Fuzzy Scheduler

Table 1: Fuzzy Rule Set

Algorithm for Setting up the Priority


Input: Expiry Time, Waiting Time, Packet Size, Queue Length, Type of Service
Assumptions: First four inputs are in 3 scales (H, M and L) and last input is in 5 scales (VH, H, M, L and VL).

The parameter QLmax represents the max queue length of RTPS. QLcurrent is the current queue length
QLthreshold1 is the low threshold of RTPS queue. QLthreshold2 is the high threshold of RTPS queue. QrtPS is the
original fixed quantum of RTPS. DC is the deficit counter, DCmin is the minimum DC, whereas DCdynamic is the
dynamic DC, and DCmax is the maximum DC. The following formulas are used to calculate the deficit counter for the
rtPS traffic.

DCmin = QrtPS….(4) & DCmax = 2QrtPS ….(5)

The scheduler checks the rtPS queue length in the beginning of every round to satisfy the different QoS
requirements. When QLcurrent is less than QLthreshold1, the DC value will be equal to DCmin. In the second situation, the
QLcurrent is more than QLthreshold1 but less than QLthreshold2, DC would be equal to DCdynamic. The DCdynamic is variable with
different QLcurrent, so we use (2) to calculate the DCdynamic. Using the ratio value to multiply the QrtPS and then add the
QrtPS once again, it will get the DCdynamic. So, the DC will change dynamically in this situation. Lastly, a parameter called
DCmax which indicates the maximum value of rtPS deficit counter. This value is set to two times the original quantum
14 Poulomi Das, Siladitya Sen & Arindam Benerjee

value for rtPS. The purpose of DCmax is to protect the lower priority service classes from starvation. QLcurrent is between
QLthreshold1 and QLthreshold2, so DC of rtPS is calculated based on (2). The DCs are calculated by (1) and (2) [9, 10].

Mathematical Analysis Algorithm

set DC [i] = Q[i] for each service class

set QLthreshold1 as the low threshold percentage of the total queue length of rtPS

set QLthreshold2 as the high threshold percentage of the total queue length of rtPS

setDCmin = DC.rtPS

setDCmax = 2DC.rtPS

QLCurrent − QLThreshold 1
set DCdynamic = Qrtps + * Qrtps …… (6)
QLThreshold 1 − QLThreshold 2

If(queue type is rtPS)

While (0 <= QLcurrent<= QLthreshold1 )

setDC.rtPS = DCmin

If (QLthreshold1 <QLcurrent<QLthreshold2 )

setDC.rtPS = DCdynamic

If (QLthreshold2 <= QLcurrent<= QLmax)

setDC.rtPS =DCmax

while(DC.rtPS> 0 and rtPS not empty)

Send rtPS packets;

adjust all DC counters

next scheduling round

MATHEMATICAL ANALYSIS
Average Throughput ( τ t1 ): The amount of data selected for transmission by a user per unit time. The value is expressed
in Kbps and calculated using an exponential moving average as follows[9,10]:

τt = α *(τt ) + (1 − α )τt − 1 …. (7)


1
Packet Loss (ρ): The percentage of packets dropped from the queue out of all the packets that arrived in the queue. The
metric indicates the percentage of packets that missed their deadlines and is calculated as follows [9,10]:

∑ ωi
i =1
ρ= n
…. (8)
∑ Kj
j =1
Fuzzy Based Modified Real Time Polling Service Algorithm & Performance Analysis of Scheduling Algorithms Used in WiMAX 15

m n
Where, ∑ ωi is the sum of packets dropped, ∑ Kj is the sum of packets arrived in the queue.
i =1 j =1

Both average delay and packet loss will allow us to determine how effectively a scheduling algorithm satisfies the
QoS requirements of real-time SSs.

Frame Utilization: The number of symbols utilized for data out all the symbols in the uplink sub-frame. The metric
reported as a percentage is calculated as follows [9,10]:

∑ ωi
i =1
Futil = ×100%
C …. (9)

Average Queuing delay (): The time between the arrival of a packet in the queue to the departure of the packet from the
queue. The value is reported in milliseconds (ms) and is calculated for each SS as follows [9,10]:

∑ ( fi − ai )
i =1
d= …. (10)
N

PERFORMANCE ANALYSIS OF SCHEDULING ALGORITHMS WITH VERIABLE SUBSCRIBERS

A network is designed on QUANNET 5.0.1 simulator with different set of subscribers (14, 20, 30, 40) for analysis
the performance of basic service classes for incremental loads. Performances are evaluated under Gaussian fading channels
with mobile users. Then mathematical model for performance analysis of rtPS Fuzzy Based Modified rtPS algorithm for
WiMAX is implemented in MATLAB for verifying network performance. Analysis performance matrices of Throughput,
Average Jitter & End to End delay are taken. As throughput is directly proportional to Bit Error Rate so improving
throughput will improve network performance [10, 11].

Figure 2: Throughput for Different Scheduling Algorithm Figure 3: Jitter for Different Scheduling Algorithm
16 Poulomi Das, Siladitya Sen & Arindam Benerjee

Figure 4: Average Jitter for Different Scheduling Algorithm Figure 5: Throughput for rtPS & Modified rtPS Algorithm

Figure 6: E2E Dely for rtPS & Modified rtPS Algorithm Figure 7: Average Jitter for rtPS & Modified rtPS Algorithm

CONCLUSIONS

Wireless communication technology is improving continuously in performance as more & more complex needful
applications are increased. For real time application the modified polling service has designed & performance analysis
carried out [10,11]. As other applications are exists simultaneously so selection of service class have been done through
fuzzy logic. Then packet length varied dynamically so that network can utilize maximum. So throughput increases. At the
same time bit error rate is decreases in network. Flat jitter & low end to end delay improve system reliability. As this is an
mathematical analysis the whole process can be implemented on hardware.

REFERENCES

1. C. Eklund, R. Marks, K. Stanwood, S. Wang IEEE standard 802.16: A Technical Overview of the
WirelessMANTM air interface for broadband wireless access

2. A.Sayenko, O Alanen & T Hamaainen (2008) Scheduling solution for the IEEE 806.16 base solution, Int. J
Computer Networking vol 52.
Fuzzy Based Modified Real Time Polling Service Algorithm & Performance Analysis of Scheduling Algorithms Used in WiMAX 17

3. Y. A. Sekercioglu, M Ivanovich & A Yeing (May 2009) : A Survey of MAC based QoS implementation for
WiMAX Network. Elsevier Computer Networks.

4. Mikael Gidlund and Gang Wang. (2009). Uplink Scheduling Algorithms for QoS Support in Broadband Wireless
Access Networks. Journal of communications. Vol. 4(2). pp. 133-142

5. Ahmed H. Rashwan, Hesham M. ElBadawy and Hazem H. Ali. (2009). Comparative Assessments for Different
WiMAX Scheduling Algorithms. Proceedings of the World Congress on Engineering and Computer Science
WCECS 2009. Vol. I. 20-22 October, 2009. San Francisco, USA. pp. 362-366.

6. R. A. Talwalkar and M. Ilyas, “Analysis of quality of service (QoS) in WiMAX networks,” 16th IEEE
International Conference, ICON08, pp. 1–8, December 2008R. A. Talwalkar and M. Ilyas, “Analysis of quality of
service (QoS) in WiMAX networks,” 16th IEEE International Conference, ICON08, pp. 1–8, December 2008

7. D. David Neels Pon Kumar, K. Murugesan, ‘Performance Analysis of Neural Networks Based Priority Scheduler
for WiMAX under Bursty Traffic Conditions’ European Journal of Scientific Research ISSN 1450-216X Vol.76
No.3 (2012), pp.351-365, © EuroJournals Publishing, Inc. 2012

8. Chakchai So-In, Raj Jain, and Abdel-Karim Tamimi. (2009).Scheduling in IEEE 802.16e Mobile WiMAX
Networks: Key Issues and a Survey. IEEE Journal on selected areas in communications, vol. 27(2). February. pp.
156- 171.

9. Yuxiao Jia, Miguel Lopez Guerrero, Ognian Kabranov, Dimitrios Makrakis and Luis Orozco Barbosa. (2003).
Design and testbed implementation of adaptive MPLS- Diffserv enabled virtual private networks. Proceedings of
the IEEE Canadian Conference Electrical and Computer Engineering, CCECE 2003. 4-7 May. Montreal, Canada.
pp 965-968.

10. A Striegel and G. Manimaran, "Dynamic class-based queue management for scalable media servers”, Real-Time
Technology and Applications Symposium IEEE, pp. 228 – 236, June 2000.

11. M. Andrews, “Probabilistic end-to-end delay bounds for earliest deadline first scheduling,” in Proc. IEEE
Computer communicationConf., Israel,2000, vol. 2, pp. 603-612.

Vous aimerez peut-être aussi