SlideShare a Scribd company logo
IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 18, Issue 2, Ver. I (Mar-Apr. 2016), PP 47-54
www.iosrjournals.org
DOI: 10.9790/0661-18214754 www.iosrjournals.org 47 | Page
Performance Measurement of WLAN Based On Medium Access
Control for Wirelessly Connected Stations
Md. Abbas Ali Khan1
, Atif Ul Aftab2
, Md. Imran Hossain Imu3
1
(School of Technology and Health, KTH Royal Institute of Technology, Stockholm, Sweden)
2
(Lecturer, Department of CSE, Daffodil Institute of IT, Bangladesh)
3
(Lecturer, Department of CSE, Daffodil Institute of IT, Bangladesh)
Abstract: This paper is mainly focuses on the Medium Access Control (MAC) sublayer of the IEEE 802.11
standard for Wireless Local Area Network (WLAN) and delay measurement among the network and also
compare of the traffic load. The MAC sublayer is standard mainly includes two fundamental access methods.
One is called DCF (Distributed Coordination Function), which uses Carrier Sense Multiple Access with
Collision Avoidance (CSMA/CA) approach. Other is PCF (Point Coordination Function), which is based on
polling to determine the station that can transmit next.
Keyword: DCF, Delay, MAC and PCF.
I. Introduction:
A wireless LAN is one that makes use of a wireless transmission medium, ad hoc, networking, and coverage of
locations difficult to wire. The MAC sub layer in the standard mainly includes two fundamental access methods.
One is called DCF (Distributed Coordination Function) which uses Carrier Sense Multiple Access with
Collision Avoidance (CSMA/CA) approach. Other is PCF (Point Coordination Function) which is based on the
polling to determine the station that can transmit next and provide contention-free service [1]. The physical
CSMA/CA, DCF and PCF utilize virtual carrier sense mechanism to determine the state of the medium. This is
implemented with the help of Network Allocation Vector (NAV) which provides each station with a prediction
of future traffic on the medium. The standard also allows for fragmentation of the MAC data units into smaller
frames, which is very favorable in case of wireless channel as it is not reliable enough to transmit longer frames.
In this Paper a simulation is shown of a WLAN network with nine wireless stations named as node_0 up to
node_8. Node _0 has its Access Point Functionality enabled and acting here as Point Coordinator. These stations
are configured in four ways as (i) DCF Scenario: DCF is implemented in all stations in the wireless local area
networks by default. With DCF, every station senses the medium before transmission, defer as long as the
medium is busy and when medium goes idle, wait for a random back off interval. After back off interval, if
medium is still idle, the station initiates data transmission or optionally exchange RTS (Request to send)/CTS
(Clear to send) frames [1]. (ii) DCF_PCF Scenario: PCF access method is implemented ‘optionally’ in an
infrastructure network along with the DCF. With PCF, the access point (AP) in the network acts as a Point
Coordinator (PC). The PC uses Polling based approached to determine which station can transmit data. It is
optional for the stations to participate in the PCF. Those stations which respond to the poll received from the PC
are called CF-Pollable stations. The PCF functionality has been enabled on node_0, node_1, node_3, node_5
and node_7. (iii) DCF_Frag Scenario: This scenario has been duplicated from DCF scenario and here on all
stations; Fragmentation Threshold size of 256 bytes has been set. So fragmentation of the frames will occur if
their size exceeds the fragmentation threshold (which is of 256 bytes). Here in case of DCF and during
contention period, all fragments of a single frame will be sent as burst with a single invocation of the DCF
medium access procedure.
Figure 1.1 Load statistics for DCF and PCF Scenario
(iv) DCF_PCF_Frag Scenario: This scenario has been duplicated from DCF_Frag scenario due to which
Fragmentation Threshold of 256 bytes has already been set on all stations. Then PCF functionality has been
Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations
DOI: 10.9790/0661-18214754 www.iosrjournals.org 48 | Page
enabled on node_0, node_1, node_3, node_5 and node_7. Here in case of PCF and during a contention free
periods, fragments are sent individually following the rules of the PC. As discussed above, DCF is based on
CSMA/CA and there is a contention for the medium among the stations. A station only senses the medium
before transmission. If the medium is idle, it transmits otherwise if the medium is busy; a station that wishes to
transmit has to wait until the current transmission is over and for an additional random back off interval. Thus in
this way, there may have collisions which requires retransmission of data after receiving the negative ACKs
from receiver [1, 2]. This additional traffic due to the retransmission causes the traffic load in the network. In
case of PCF, the existence of AP and CF-Pollable stations creates the contention free period and each station
transmits its required data only on its designated interval according to the poll issued by the AP. This causes the
collision free transmission and there will be less requirement of retransmission. In the figure 1.1 shown, it has
been observed clearly that DCF scenario without PCF (shown in Red and Blue colors) is suffering with higher
loads as compared to DCF scenario with PCF (shown in Green and Sky blue colors). The possible cause of this
high load is additional traffic of retransmissions, required due to possible collisions in case of DCF scenario. Let
see the effect of utilizing PCF and Fragmentation on delay first.
II. Effect of PCF on Delay:
As discussed above, DCF is based on CSMA/CA in which station has to wait until the medium becomes idle
and then additional wait for back off time before it can transmit anything. In addition to this, as PCF pollable
traffic has more priority so it has to wait until the traffic of any CF-Pollable station becomes over. In addition to
this, in DCF, station has to wait for additional SIFS (Shortest IFS) before sending of data and another SIFS
before getting an ACK from the receiver [1]. While in case of PCF, station suffers on delay of its polling turn
which depends on the number of Pollable stations. If number of pollable stations is higher, then delay for
receiving a poll from the PC will be higher. But as here number of pollable stations is only five due to which
polling delay is significantly very low.
III. Effect of Fragmentation on Delay:
In fragmentation, the frames which are larger than 256 bytes are fragmented into smaller frames. This will cause
additional delay because at the transmission side, first large frame will be chopped down into smaller subframes,
then each subframe will be added with its header. Similarly, at the receiver end, header will be removed from
each subframe and then reassembled into a larger frame. In case of DCF, this delay can be seen significant
because here each packet will have to wait before it can access the medium. Similarly, as the number of frames
has been increased, the number of collisions may be increased too. This will cause more retransmissions
resulting in more delays for the reassembly of the error free subframes into larger frame at the receiver side. The
delay due to this fragmentation is relatively small in case of PCF enabled scenario. The effect of PCF and
Fragmentation on Delay can be seen in the figure 1.2. As discussed above, DCF_Frag (shown with red line) has
the highest delay followed by DCF (shown with blue line). DCF_PCF_Frag (shown with sky blue color) has
fragmentation delay and the DCF_PCF (shown with Green color) has the smallest delay as compared to other
scenarios.
IV. Effect of PCF on Throughput:
The scenario without PCF will suffer more delays and thus throughput is small as compared to the scenario with
PCF. Secondly, because of the retransmissions due to any possible collisions, effective throughput will also be
relatively small as compared to scenario with PCF. Effect of Fragmentation on Throughput, refer to the
discussion above, in case of DCF only, the number of frames will be increased, which will cause more collisions
resulting in greater number of retransmissions. This will cause effective throughput to be decreased as compared
to the throughput in case of scenario with PCF. The above two findings can be seen clearly in the figure 1.3. The
highest throughput is in DCF_PCF (shown with Green color) followed by DCF_PCF_Frag (shown with sky
blue color). The low throughput is in DCF (shown with Blue color) followed by the DCF_Frag (shown with red
color) showing the lowest throughput among the four scenarios. Referred to the figure 1.4 and figure 1.5, in
DCF_PCF scenario, node_2 has its PCF Functionality disabled while node_3 has its PCF functionality enabled.
Figure 1.4 shows the delay in node_2 and node_3 while figure 1.5 shows the retransmission attempts in node_2
and node_3. As seen in figure 1.4, node_2 and
Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations
DOI: 10.9790/0661-18214754 www.iosrjournals.org 49 | Page
Figure 1.2 Delay statistics for all four scenarios
Figure 1.3 Throughput statistics for all four scenarios
node_3 has almost the same results for DCF and DCF_Frag scenarios. But in case of DCF_PCF and
DCF_PCF_Frag, the delay is much higher in node_2 as compared to that in node_3. The reason for this is that in
case of PCF enabled in some nodes, the CF-pollable nodes (like node_3) can transmit right away without any
delay in the collision free period (CFP) and the non-CF-Pollable nodes (like node_ 2) experience higher delays
due to the existence of the collision-free period during which only CF-Pollable nodes are permitted to transmit.
In the figure 1.5, the number of retransmissions in node_3 is considerably low as compared to that in node_2 for
the four scenerios. The reason for this is that, in node 3, when PCF is used, it guarantees that there will be no
collision as each station is transmitting at
Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations
DOI: 10.9790/0661-18214754 www.iosrjournals.org 50 | Page
Figure 1.4 Delay Station for node_2 and node_3 (in DCF_PCF scenario)
its desired interval and thus there will be no retransmission. So the number of transmissions will be lower for
DCF_PCF (shown with green color) and DCF_PCF_Frag (shown with sky blue color) in node_3 as compared to
node_2. Secondly, the nodes with PCF enabled do not compete for access to the medium, so there will be lower
number of stations (nodes) that will contend and transmit during contention period. Thus the number of
retransmissions for DCF_Frag (shown with red color) and DCF (shown with blue color) will also be relatively
smaller in node_3 as compared to those in node_2. Referred to the figure 1.6 and 1.7 are actually doing
comparison between the two scenarios where in one scenario, have only two PCF enabled nodes ( called
DCF_two PCF) and the other scenario when have
PCF enabled on all nodes (called DCF_allPCF).
Referred to the Figure 1.6 is shown the comparison of
delay statistics for DCF_twoPCF and DCF_allPCF.
Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations
DOI: 10.9790/0661-18214754 www.iosrjournals.org 51 | Page
Figure 1.5 Retransmission Attempts
statistics for node2 and node 3 (in DCF_PCF scenario)
It can be seen that the delay in DCF_twoPCF (shown with Pink color) is much higher as compared to the delay
in case of DCF_allPCF (shown with Yellow color). As discussed above, the reason for it is that have much
chance of collisions and the respective retransmissions when have only two PCF enabled nodes, causing much
delay. But when we have all PCF enabled nodes, then there are almost no collisions and retransmissions
resulting in much less delay. For the same reason, in Figure 1.6 (a) throughput in DCF_allPCF (shown with
Yellow color) is much higher as compared to that DCE_twoPCF (pink color).
According to the Figure 1.7 shown, is getting unusual result of load comparison between DCF_allPCF and
DCF_twoPCF, because usually if it has less delay and more throughputs, so expect fewer loads in the network.
But here DCF_allPCF have more loads (shown with Yellow color) as compared to that in case of DCF_twoPCF
(shown with pink color). The possible reason for it can be that, in case of DCF_allPCF, the number of Polls sent
by the PC is higher due to the greater number of CF-Pollable nodes as compared to the number of polls sent
when only two CF-Pollable nodes have in DCF_twoPCF scenario. This can cause extra load in the network even
if there are not any collisions and the resulting retransmissions. If the number of CF-Pollable
Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations
DOI: 10.9790/0661-18214754 www.iosrjournals.org 52 | Page
Figure 1.6(a)
Figure 1.6(b)
Figure 1.6 (a) Throughput and 1.6(b) Delay statistics for DCF_compared to that in DCF_twoPCF (shown with
Pink color).allPCF and DCF_twoPCF
Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations
DOI: 10.9790/0661-18214754 www.iosrjournals.org 53 | Page
Figure 1.7 Load statistics for DCF_allPCF and DCF_twoPCF
nodes in the network is increased, this load effect can be experienced more significantly in that case. The
Medium Access Delay for all six scenarios is shown in Figures 1.8 and 1.9. From the Figure 1.8, it can be seen
clearly that DCF_Frag (shown with Green color) has the highest medium access delay followed by the DCF
(shown with Red color) as compared to remaining PCF enabled scenarios. As discussed in above, the reason for
high delay in DCF scenarios (DCF_Frag and DCF) is that there is no PCF enabled nodes and all the nodes are
accessing the medium during the contention period resulting in collisions and corresponding retransmissions.
Between DCF_Frag and DCF, DCF_Frag has more delay because of the fragmentation issues as discussed
above. For the remaining four PCF enabled scenarios, results are seen unexpected in Figure 1.8 so their
simulation results have been generated again and shown in Figure 1.9. As per Figure 1.9 shown, it can be seen
clearly that DCF_PCF_Frag (shown with sky blue color) has higher medium access delay as compared to the
remaining DCF_twoPCF, DCF_PCF and DCF_allPCF scenarios. The reason for this is the same fragmentation
issues as discussed in above. For the remaining three scenarios, DCF_twoPCF (shown with pink color) has more
delay compared to DCF_PCF and DCF_allPCF. The reason for it is the effect on delay due the number of CF-
Pollable nodes in the network discussed in above. In DCF_twoPCF, there are only two CF-Pollable nodes
resulting in higher number of nodes to work in Contention period resulting in more collisions and corresponding
retransmissions. In DCF_PCF (shown with green color), almost half of all the nodes are CF-Pollable resulting in
half of the nodes in the network to work during Contention Free period resulting in significantly less number of
collisions and retransmissions. Finally in DCF_allPCF (shown with Yellow color), the medium access delay is
the lowest as almost all the nodes are working in Contention Free period and there are not any significant
collisions and retransmissions.
Figure 1.8 Medium Access Delay statistics for DCF_Frag and DCF
Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations
DOI: 10.9790/0661-18214754 www.iosrjournals.org 54 | Page
Figure 1.9 Medium Access Delay statistics for DCF_PCF_Frag, DCF_twoPCF, DCF_PCF and DCF_allPCF
V. Conclusion
The DCF_Frag has the highest delay followed by DCF when PCF is not enabled on all the nodes in the network.
When PCF is enabled in the network, DCF_PCF_Frag has higher delay followed by DCF_twoPCF, DCF_PCF
and DCF_allPCF respectively. Polling delay is happened if the number of pollable station is more. To make less
such delay uses less number of polling stations. And traffic load occurs due to retransmission. Less number of
collisions and retransmissions are occurred during the contention free period. If it is being ensured less traffic
load (retransmission) in the network then potentiality is more to get less delay and more throughputs.
VI. References:
[1] Stallings William, Wireless Communication & Networks. 2nd
edition, P-435, prentice- Hall of India, New Delhi-110 0001
[2] Larry L. Peterson & Bruce S. Davie, Computer Networks: A System Approach, 4th
edition, section 2.8.2, P-140

More Related Content

What's hot

11 Data Link_Control
11 Data Link_Control11 Data Link_Control
11 Data Link_Control
Ahmar Hashmi
 
2G3GISHO
2G3GISHO2G3GISHO
2G3GISHO
Navid Solhjoo
 
5G NR parameters
5G NR parameters5G NR parameters
5G NR parameters
Sasi Reddy
 
Mac
MacMac
Mimo white paperrevb-final
Mimo white paperrevb-finalMimo white paperrevb-final
Mimo white paperrevb-final
Prashant Sengar
 
Inter-Cell Interference Coordination for LTE-A - Sept 2011 Volker Pauli, Eiko...
Inter-Cell Interference Coordination for LTE-A - Sept 2011 Volker Pauli, Eiko...Inter-Cell Interference Coordination for LTE-A - Sept 2011 Volker Pauli, Eiko...
Inter-Cell Interference Coordination for LTE-A - Sept 2011 Volker Pauli, Eiko...
Eiko Seidel
 
International Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentInternational Journal of Engineering Research and Development
International Journal of Engineering Research and Development
IJERD Editor
 
Answers to questions
Answers to questionsAnswers to questions
Answers to questions
Ogundiran Joseph
 
GSM Air Interface
GSM Air Interface GSM Air Interface
GSM Air Interface
Naveen Jakhar, I.T.S
 
Ch22
Ch22Ch22
VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015
VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015
VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015
vtunotesbysree
 
Tham khao ofdm tutorial
Tham khao ofdm tutorialTham khao ofdm tutorial
Tham khao ofdm tutorial
Trần Đức Mạnh
 
Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)
IJERD Editor
 
Rach procedure in lte
Rach procedure in lteRach procedure in lte
Rach procedure in lte
Saurav Banerjee
 
Long Range Cell Coverage for LTE
Long Range Cell Coverage for LTELong Range Cell Coverage for LTE
Long Range Cell Coverage for LTE
Yi-Hsueh Tsai
 
HIGH SPEED NETWORKS
HIGH SPEED NETWORKSHIGH SPEED NETWORKS
HIGH SPEED NETWORKS
Kathirvel Ayyaswamy
 
5 ofdm
5 ofdm5 ofdm
5 ofdm
Thehieu Dang
 
Gsm rf interview questions
Gsm rf interview questionsGsm rf interview questions
Gsm rf interview questions
radira03
 
Gsm inteview question
Gsm inteview questionGsm inteview question
Gsm inteview question
Naeem Ullah
 
13 atm
13 atm13 atm

What's hot (20)

11 Data Link_Control
11 Data Link_Control11 Data Link_Control
11 Data Link_Control
 
2G3GISHO
2G3GISHO2G3GISHO
2G3GISHO
 
5G NR parameters
5G NR parameters5G NR parameters
5G NR parameters
 
Mac
MacMac
Mac
 
Mimo white paperrevb-final
Mimo white paperrevb-finalMimo white paperrevb-final
Mimo white paperrevb-final
 
Inter-Cell Interference Coordination for LTE-A - Sept 2011 Volker Pauli, Eiko...
Inter-Cell Interference Coordination for LTE-A - Sept 2011 Volker Pauli, Eiko...Inter-Cell Interference Coordination for LTE-A - Sept 2011 Volker Pauli, Eiko...
Inter-Cell Interference Coordination for LTE-A - Sept 2011 Volker Pauli, Eiko...
 
International Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentInternational Journal of Engineering Research and Development
International Journal of Engineering Research and Development
 
Answers to questions
Answers to questionsAnswers to questions
Answers to questions
 
GSM Air Interface
GSM Air Interface GSM Air Interface
GSM Air Interface
 
Ch22
Ch22Ch22
Ch22
 
VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015
VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015
VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015
 
Tham khao ofdm tutorial
Tham khao ofdm tutorialTham khao ofdm tutorial
Tham khao ofdm tutorial
 
Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)
 
Rach procedure in lte
Rach procedure in lteRach procedure in lte
Rach procedure in lte
 
Long Range Cell Coverage for LTE
Long Range Cell Coverage for LTELong Range Cell Coverage for LTE
Long Range Cell Coverage for LTE
 
HIGH SPEED NETWORKS
HIGH SPEED NETWORKSHIGH SPEED NETWORKS
HIGH SPEED NETWORKS
 
5 ofdm
5 ofdm5 ofdm
5 ofdm
 
Gsm rf interview questions
Gsm rf interview questionsGsm rf interview questions
Gsm rf interview questions
 
Gsm inteview question
Gsm inteview questionGsm inteview question
Gsm inteview question
 
13 atm
13 atm13 atm
13 atm
 

Viewers also liked

D0611923
D0611923D0611923
D0611923
IOSR Journals
 
Design and implementation of Parallel Prefix Adders using FPGAs
Design and implementation of Parallel Prefix Adders using FPGAsDesign and implementation of Parallel Prefix Adders using FPGAs
Design and implementation of Parallel Prefix Adders using FPGAs
IOSR Journals
 
Optimization of Threshold Voltage for 65nm PMOS Transistor using Silvaco TCAD...
Optimization of Threshold Voltage for 65nm PMOS Transistor using Silvaco TCAD...Optimization of Threshold Voltage for 65nm PMOS Transistor using Silvaco TCAD...
Optimization of Threshold Voltage for 65nm PMOS Transistor using Silvaco TCAD...
IOSR Journals
 
Early Warning on Disastrous Weather through Cell Phone
Early Warning on Disastrous Weather through Cell PhoneEarly Warning on Disastrous Weather through Cell Phone
Early Warning on Disastrous Weather through Cell Phone
IOSR Journals
 
Count based Secured Hash Algorithm.
Count based Secured Hash Algorithm.Count based Secured Hash Algorithm.
Count based Secured Hash Algorithm.
IOSR Journals
 
High Speed Signed multiplier for Digital Signal Processing Applications
High Speed Signed multiplier for Digital Signal Processing ApplicationsHigh Speed Signed multiplier for Digital Signal Processing Applications
High Speed Signed multiplier for Digital Signal Processing Applications
IOSR Journals
 
H1303055462
H1303055462H1303055462
H1303055462
IOSR Journals
 
Performance Evaluation for Production of 5000kgHydraulic Jack
Performance Evaluation for Production of 5000kgHydraulic JackPerformance Evaluation for Production of 5000kgHydraulic Jack
Performance Evaluation for Production of 5000kgHydraulic Jack
IOSR Journals
 
B0961015
B0961015B0961015
B0961015
IOSR Journals
 
B0350507
B0350507B0350507
B0350507
IOSR Journals
 
B0541218
B0541218B0541218
B0541218
IOSR Journals
 
Analysis of Peak to Average Power Ratio Reduction Techniques in Sfbc Ofdm System
Analysis of Peak to Average Power Ratio Reduction Techniques in Sfbc Ofdm SystemAnalysis of Peak to Average Power Ratio Reduction Techniques in Sfbc Ofdm System
Analysis of Peak to Average Power Ratio Reduction Techniques in Sfbc Ofdm System
IOSR Journals
 
N0102196100
N0102196100N0102196100
N0102196100
IOSR Journals
 
E0522327
E0522327E0522327
E0522327
IOSR Journals
 
D0462530
D0462530D0462530
D0462530
IOSR Journals
 
Architecture and Evaluation on Cooperative Caching In Wireless P2P
Architecture and Evaluation on Cooperative Caching In Wireless  P2PArchitecture and Evaluation on Cooperative Caching In Wireless  P2P
Architecture and Evaluation on Cooperative Caching In Wireless P2P
IOSR Journals
 
A0440104
A0440104A0440104
A0440104
IOSR Journals
 
B0951117
B0951117B0951117
B0951117
IOSR Journals
 
Correlation Coefficient Based Average Textual Similarity Model for Informatio...
Correlation Coefficient Based Average Textual Similarity Model for Informatio...Correlation Coefficient Based Average Textual Similarity Model for Informatio...
Correlation Coefficient Based Average Textual Similarity Model for Informatio...
IOSR Journals
 
A Novel Edge Detection Technique for Image Classification and Analysis
A Novel Edge Detection Technique for Image Classification and AnalysisA Novel Edge Detection Technique for Image Classification and Analysis
A Novel Edge Detection Technique for Image Classification and Analysis
IOSR Journals
 

Viewers also liked (20)

D0611923
D0611923D0611923
D0611923
 
Design and implementation of Parallel Prefix Adders using FPGAs
Design and implementation of Parallel Prefix Adders using FPGAsDesign and implementation of Parallel Prefix Adders using FPGAs
Design and implementation of Parallel Prefix Adders using FPGAs
 
Optimization of Threshold Voltage for 65nm PMOS Transistor using Silvaco TCAD...
Optimization of Threshold Voltage for 65nm PMOS Transistor using Silvaco TCAD...Optimization of Threshold Voltage for 65nm PMOS Transistor using Silvaco TCAD...
Optimization of Threshold Voltage for 65nm PMOS Transistor using Silvaco TCAD...
 
Early Warning on Disastrous Weather through Cell Phone
Early Warning on Disastrous Weather through Cell PhoneEarly Warning on Disastrous Weather through Cell Phone
Early Warning on Disastrous Weather through Cell Phone
 
Count based Secured Hash Algorithm.
Count based Secured Hash Algorithm.Count based Secured Hash Algorithm.
Count based Secured Hash Algorithm.
 
High Speed Signed multiplier for Digital Signal Processing Applications
High Speed Signed multiplier for Digital Signal Processing ApplicationsHigh Speed Signed multiplier for Digital Signal Processing Applications
High Speed Signed multiplier for Digital Signal Processing Applications
 
H1303055462
H1303055462H1303055462
H1303055462
 
Performance Evaluation for Production of 5000kgHydraulic Jack
Performance Evaluation for Production of 5000kgHydraulic JackPerformance Evaluation for Production of 5000kgHydraulic Jack
Performance Evaluation for Production of 5000kgHydraulic Jack
 
B0961015
B0961015B0961015
B0961015
 
B0350507
B0350507B0350507
B0350507
 
B0541218
B0541218B0541218
B0541218
 
Analysis of Peak to Average Power Ratio Reduction Techniques in Sfbc Ofdm System
Analysis of Peak to Average Power Ratio Reduction Techniques in Sfbc Ofdm SystemAnalysis of Peak to Average Power Ratio Reduction Techniques in Sfbc Ofdm System
Analysis of Peak to Average Power Ratio Reduction Techniques in Sfbc Ofdm System
 
N0102196100
N0102196100N0102196100
N0102196100
 
E0522327
E0522327E0522327
E0522327
 
D0462530
D0462530D0462530
D0462530
 
Architecture and Evaluation on Cooperative Caching In Wireless P2P
Architecture and Evaluation on Cooperative Caching In Wireless  P2PArchitecture and Evaluation on Cooperative Caching In Wireless  P2P
Architecture and Evaluation on Cooperative Caching In Wireless P2P
 
A0440104
A0440104A0440104
A0440104
 
B0951117
B0951117B0951117
B0951117
 
Correlation Coefficient Based Average Textual Similarity Model for Informatio...
Correlation Coefficient Based Average Textual Similarity Model for Informatio...Correlation Coefficient Based Average Textual Similarity Model for Informatio...
Correlation Coefficient Based Average Textual Similarity Model for Informatio...
 
A Novel Edge Detection Technique for Image Classification and Analysis
A Novel Edge Detection Technique for Image Classification and AnalysisA Novel Edge Detection Technique for Image Classification and Analysis
A Novel Edge Detection Technique for Image Classification and Analysis
 

Similar to H018214754

Opnet lab 2 solutions
Opnet lab 2 solutionsOpnet lab 2 solutions
Opnet lab 2 solutions
حيدر نافع nafaa
 
A novel pause count backoff algorithm for channel access
A novel pause count backoff algorithm for channel accessA novel pause count backoff algorithm for channel access
A novel pause count backoff algorithm for channel access
ambitlick
 
Provide a full explanation to the below question.1. Summarize the .pdf
Provide a full explanation to the below question.1. Summarize the .pdfProvide a full explanation to the below question.1. Summarize the .pdf
Provide a full explanation to the below question.1. Summarize the .pdf
arihantmobileselepun
 
IEEE 802.11
IEEE 802.11IEEE 802.11
IEEE 802.11
Ramasubbu .P
 
Data link control
Data link controlData link control
Data link control
С. Ариука
 
WLAN
WLANWLAN
Qos wlan
Qos wlanQos wlan
AN EXPLICIT LOSS AND HANDOFF NOTIFICATION SCHEME IN TCP FOR CELLULAR MOBILE S...
AN EXPLICIT LOSS AND HANDOFF NOTIFICATION SCHEME IN TCP FOR CELLULAR MOBILE S...AN EXPLICIT LOSS AND HANDOFF NOTIFICATION SCHEME IN TCP FOR CELLULAR MOBILE S...
AN EXPLICIT LOSS AND HANDOFF NOTIFICATION SCHEME IN TCP FOR CELLULAR MOBILE S...
IJCNCJournal
 
TCP Congestion Control
TCP Congestion ControlTCP Congestion Control
TCP Congestion Control
Michail Grigoropoulos
 
TCP Fairness for Uplink and Downlink Flows in WLANs
TCP Fairness for Uplink and Downlink Flows in WLANsTCP Fairness for Uplink and Downlink Flows in WLANs
TCP Fairness for Uplink and Downlink Flows in WLANs
ambitlick
 
ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...
ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...
ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...
ijasuc
 
Module 5 high speed swan,atm,transport layer
Module 5 high speed swan,atm,transport layerModule 5 high speed swan,atm,transport layer
Module 5 high speed swan,atm,transport layer
Deepak John
 
Module 4 netwok layer,routing ,vlan,x.25doc
Module 4 netwok layer,routing ,vlan,x.25docModule 4 netwok layer,routing ,vlan,x.25doc
Module 4 netwok layer,routing ,vlan,x.25doc
Deepak John
 
A20345606_Shah_Bonus_Report
A20345606_Shah_Bonus_ReportA20345606_Shah_Bonus_Report
A20345606_Shah_Bonus_Report
Panth Shah
 
A NOVEL SLOTTED ALLOCATION MECHANISM TO PROVIDE QOS FOR EDCF PROTOCOL
A NOVEL SLOTTED ALLOCATION MECHANISM TO PROVIDE QOS FOR EDCF PROTOCOLA NOVEL SLOTTED ALLOCATION MECHANISM TO PROVIDE QOS FOR EDCF PROTOCOL
A NOVEL SLOTTED ALLOCATION MECHANISM TO PROVIDE QOS FOR EDCF PROTOCOL
IAEME Publication
 
Comparative study of various voip applications in 802.11 a wireless network s...
Comparative study of various voip applications in 802.11 a wireless network s...Comparative study of various voip applications in 802.11 a wireless network s...
Comparative study of various voip applications in 802.11 a wireless network s...
ijmnct
 
Explain the following terms and concepts in WiFi Networksi) a) Req.pdf
Explain the following terms and concepts in WiFi Networksi) a) Req.pdfExplain the following terms and concepts in WiFi Networksi) a) Req.pdf
Explain the following terms and concepts in WiFi Networksi) a) Req.pdf
shalins6
 
A Survey on Cross Layer Routing Protocol with Quality of Service
A Survey on Cross Layer Routing Protocol with Quality of ServiceA Survey on Cross Layer Routing Protocol with Quality of Service
A Survey on Cross Layer Routing Protocol with Quality of Service
IJSRD
 
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
ijwmn
 
Proposition of an Adaptive Retransmission Timeout for TCP in 802.11 Wireless ...
Proposition of an Adaptive Retransmission Timeout for TCP in 802.11 Wireless ...Proposition of an Adaptive Retransmission Timeout for TCP in 802.11 Wireless ...
Proposition of an Adaptive Retransmission Timeout for TCP in 802.11 Wireless ...
IJERA Editor
 

Similar to H018214754 (20)

Opnet lab 2 solutions
Opnet lab 2 solutionsOpnet lab 2 solutions
Opnet lab 2 solutions
 
A novel pause count backoff algorithm for channel access
A novel pause count backoff algorithm for channel accessA novel pause count backoff algorithm for channel access
A novel pause count backoff algorithm for channel access
 
Provide a full explanation to the below question.1. Summarize the .pdf
Provide a full explanation to the below question.1. Summarize the .pdfProvide a full explanation to the below question.1. Summarize the .pdf
Provide a full explanation to the below question.1. Summarize the .pdf
 
IEEE 802.11
IEEE 802.11IEEE 802.11
IEEE 802.11
 
Data link control
Data link controlData link control
Data link control
 
WLAN
WLANWLAN
WLAN
 
Qos wlan
Qos wlanQos wlan
Qos wlan
 
AN EXPLICIT LOSS AND HANDOFF NOTIFICATION SCHEME IN TCP FOR CELLULAR MOBILE S...
AN EXPLICIT LOSS AND HANDOFF NOTIFICATION SCHEME IN TCP FOR CELLULAR MOBILE S...AN EXPLICIT LOSS AND HANDOFF NOTIFICATION SCHEME IN TCP FOR CELLULAR MOBILE S...
AN EXPLICIT LOSS AND HANDOFF NOTIFICATION SCHEME IN TCP FOR CELLULAR MOBILE S...
 
TCP Congestion Control
TCP Congestion ControlTCP Congestion Control
TCP Congestion Control
 
TCP Fairness for Uplink and Downlink Flows in WLANs
TCP Fairness for Uplink and Downlink Flows in WLANsTCP Fairness for Uplink and Downlink Flows in WLANs
TCP Fairness for Uplink and Downlink Flows in WLANs
 
ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...
ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...
ACHIEVING ENHANCED THROUGHPUT IN MOBILE ADHOC NETWORK USING COLLISION AWARE M...
 
Module 5 high speed swan,atm,transport layer
Module 5 high speed swan,atm,transport layerModule 5 high speed swan,atm,transport layer
Module 5 high speed swan,atm,transport layer
 
Module 4 netwok layer,routing ,vlan,x.25doc
Module 4 netwok layer,routing ,vlan,x.25docModule 4 netwok layer,routing ,vlan,x.25doc
Module 4 netwok layer,routing ,vlan,x.25doc
 
A20345606_Shah_Bonus_Report
A20345606_Shah_Bonus_ReportA20345606_Shah_Bonus_Report
A20345606_Shah_Bonus_Report
 
A NOVEL SLOTTED ALLOCATION MECHANISM TO PROVIDE QOS FOR EDCF PROTOCOL
A NOVEL SLOTTED ALLOCATION MECHANISM TO PROVIDE QOS FOR EDCF PROTOCOLA NOVEL SLOTTED ALLOCATION MECHANISM TO PROVIDE QOS FOR EDCF PROTOCOL
A NOVEL SLOTTED ALLOCATION MECHANISM TO PROVIDE QOS FOR EDCF PROTOCOL
 
Comparative study of various voip applications in 802.11 a wireless network s...
Comparative study of various voip applications in 802.11 a wireless network s...Comparative study of various voip applications in 802.11 a wireless network s...
Comparative study of various voip applications in 802.11 a wireless network s...
 
Explain the following terms and concepts in WiFi Networksi) a) Req.pdf
Explain the following terms and concepts in WiFi Networksi) a) Req.pdfExplain the following terms and concepts in WiFi Networksi) a) Req.pdf
Explain the following terms and concepts in WiFi Networksi) a) Req.pdf
 
A Survey on Cross Layer Routing Protocol with Quality of Service
A Survey on Cross Layer Routing Protocol with Quality of ServiceA Survey on Cross Layer Routing Protocol with Quality of Service
A Survey on Cross Layer Routing Protocol with Quality of Service
 
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
ESTIMATION OF MEDIUM ACCESS CONTROL LAYER PACKET DELAY DISTRIBUTION FOR IEEE ...
 
Proposition of an Adaptive Retransmission Timeout for TCP in 802.11 Wireless ...
Proposition of an Adaptive Retransmission Timeout for TCP in 802.11 Wireless ...Proposition of an Adaptive Retransmission Timeout for TCP in 802.11 Wireless ...
Proposition of an Adaptive Retransmission Timeout for TCP in 802.11 Wireless ...
 

More from IOSR Journals

A011140104
A011140104A011140104
A011140104
IOSR Journals
 
M0111397100
M0111397100M0111397100
M0111397100
IOSR Journals
 
L011138596
L011138596L011138596
L011138596
IOSR Journals
 
K011138084
K011138084K011138084
K011138084
IOSR Journals
 
J011137479
J011137479J011137479
J011137479
IOSR Journals
 
I011136673
I011136673I011136673
I011136673
IOSR Journals
 
G011134454
G011134454G011134454
G011134454
IOSR Journals
 
H011135565
H011135565H011135565
H011135565
IOSR Journals
 
F011134043
F011134043F011134043
F011134043
IOSR Journals
 
E011133639
E011133639E011133639
E011133639
IOSR Journals
 
D011132635
D011132635D011132635
D011132635
IOSR Journals
 
C011131925
C011131925C011131925
C011131925
IOSR Journals
 
B011130918
B011130918B011130918
B011130918
IOSR Journals
 
A011130108
A011130108A011130108
A011130108
IOSR Journals
 
I011125160
I011125160I011125160
I011125160
IOSR Journals
 
H011124050
H011124050H011124050
H011124050
IOSR Journals
 
G011123539
G011123539G011123539
G011123539
IOSR Journals
 
F011123134
F011123134F011123134
F011123134
IOSR Journals
 
E011122530
E011122530E011122530
E011122530
IOSR Journals
 
D011121524
D011121524D011121524
D011121524
IOSR Journals
 

More from IOSR Journals (20)

A011140104
A011140104A011140104
A011140104
 
M0111397100
M0111397100M0111397100
M0111397100
 
L011138596
L011138596L011138596
L011138596
 
K011138084
K011138084K011138084
K011138084
 
J011137479
J011137479J011137479
J011137479
 
I011136673
I011136673I011136673
I011136673
 
G011134454
G011134454G011134454
G011134454
 
H011135565
H011135565H011135565
H011135565
 
F011134043
F011134043F011134043
F011134043
 
E011133639
E011133639E011133639
E011133639
 
D011132635
D011132635D011132635
D011132635
 
C011131925
C011131925C011131925
C011131925
 
B011130918
B011130918B011130918
B011130918
 
A011130108
A011130108A011130108
A011130108
 
I011125160
I011125160I011125160
I011125160
 
H011124050
H011124050H011124050
H011124050
 
G011123539
G011123539G011123539
G011123539
 
F011123134
F011123134F011123134
F011123134
 
E011122530
E011122530E011122530
E011122530
 
D011121524
D011121524D011121524
D011121524
 

Recently uploaded

Data structures and Algorithms in Python.pdf
Data structures and Algorithms in Python.pdfData structures and Algorithms in Python.pdf
Data structures and Algorithms in Python.pdf
TIPNGVN2
 
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
GraphSummit Singapore | The Art of the  Possible with Graph - Q2 2024GraphSummit Singapore | The Art of the  Possible with Graph - Q2 2024
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
Neo4j
 
Climate Impact of Software Testing at Nordic Testing Days
Climate Impact of Software Testing at Nordic Testing DaysClimate Impact of Software Testing at Nordic Testing Days
Climate Impact of Software Testing at Nordic Testing Days
Kari Kakkonen
 
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
SOFTTECHHUB
 
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
James Anderson
 
Building RAG with self-deployed Milvus vector database and Snowpark Container...
Building RAG with self-deployed Milvus vector database and Snowpark Container...Building RAG with self-deployed Milvus vector database and Snowpark Container...
Building RAG with self-deployed Milvus vector database and Snowpark Container...
Zilliz
 
Removing Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software FuzzingRemoving Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software Fuzzing
Aftab Hussain
 
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
Neo4j
 
Pushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 daysPushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 days
Adtran
 
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
Neo4j
 
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...
Zilliz
 
Mind map of terminologies used in context of Generative AI
Mind map of terminologies used in context of Generative AIMind map of terminologies used in context of Generative AI
Mind map of terminologies used in context of Generative AI
Kumud Singh
 
GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024
GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024
GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024
Neo4j
 
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with SlackLet's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
shyamraj55
 
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIEnchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Vladimir Iglovikov, Ph.D.
 
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
sonjaschweigert1
 
Full-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalizationFull-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalization
Zilliz
 
“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”
Claudio Di Ciccio
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Albert Hoitingh
 
Presentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of GermanyPresentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of Germany
innovationoecd
 

Recently uploaded (20)

Data structures and Algorithms in Python.pdf
Data structures and Algorithms in Python.pdfData structures and Algorithms in Python.pdf
Data structures and Algorithms in Python.pdf
 
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
GraphSummit Singapore | The Art of the  Possible with Graph - Q2 2024GraphSummit Singapore | The Art of the  Possible with Graph - Q2 2024
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
 
Climate Impact of Software Testing at Nordic Testing Days
Climate Impact of Software Testing at Nordic Testing DaysClimate Impact of Software Testing at Nordic Testing Days
Climate Impact of Software Testing at Nordic Testing Days
 
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
 
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
 
Building RAG with self-deployed Milvus vector database and Snowpark Container...
Building RAG with self-deployed Milvus vector database and Snowpark Container...Building RAG with self-deployed Milvus vector database and Snowpark Container...
Building RAG with self-deployed Milvus vector database and Snowpark Container...
 
Removing Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software FuzzingRemoving Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software Fuzzing
 
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
 
Pushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 daysPushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 days
 
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
 
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...
 
Mind map of terminologies used in context of Generative AI
Mind map of terminologies used in context of Generative AIMind map of terminologies used in context of Generative AI
Mind map of terminologies used in context of Generative AI
 
GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024
GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024
GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024
 
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with SlackLet's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
 
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIEnchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
 
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
 
Full-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalizationFull-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalization
 
“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
 
Presentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of GermanyPresentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of Germany
 

H018214754

  • 1. IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 18, Issue 2, Ver. I (Mar-Apr. 2016), PP 47-54 www.iosrjournals.org DOI: 10.9790/0661-18214754 www.iosrjournals.org 47 | Page Performance Measurement of WLAN Based On Medium Access Control for Wirelessly Connected Stations Md. Abbas Ali Khan1 , Atif Ul Aftab2 , Md. Imran Hossain Imu3 1 (School of Technology and Health, KTH Royal Institute of Technology, Stockholm, Sweden) 2 (Lecturer, Department of CSE, Daffodil Institute of IT, Bangladesh) 3 (Lecturer, Department of CSE, Daffodil Institute of IT, Bangladesh) Abstract: This paper is mainly focuses on the Medium Access Control (MAC) sublayer of the IEEE 802.11 standard for Wireless Local Area Network (WLAN) and delay measurement among the network and also compare of the traffic load. The MAC sublayer is standard mainly includes two fundamental access methods. One is called DCF (Distributed Coordination Function), which uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) approach. Other is PCF (Point Coordination Function), which is based on polling to determine the station that can transmit next. Keyword: DCF, Delay, MAC and PCF. I. Introduction: A wireless LAN is one that makes use of a wireless transmission medium, ad hoc, networking, and coverage of locations difficult to wire. The MAC sub layer in the standard mainly includes two fundamental access methods. One is called DCF (Distributed Coordination Function) which uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) approach. Other is PCF (Point Coordination Function) which is based on the polling to determine the station that can transmit next and provide contention-free service [1]. The physical CSMA/CA, DCF and PCF utilize virtual carrier sense mechanism to determine the state of the medium. This is implemented with the help of Network Allocation Vector (NAV) which provides each station with a prediction of future traffic on the medium. The standard also allows for fragmentation of the MAC data units into smaller frames, which is very favorable in case of wireless channel as it is not reliable enough to transmit longer frames. In this Paper a simulation is shown of a WLAN network with nine wireless stations named as node_0 up to node_8. Node _0 has its Access Point Functionality enabled and acting here as Point Coordinator. These stations are configured in four ways as (i) DCF Scenario: DCF is implemented in all stations in the wireless local area networks by default. With DCF, every station senses the medium before transmission, defer as long as the medium is busy and when medium goes idle, wait for a random back off interval. After back off interval, if medium is still idle, the station initiates data transmission or optionally exchange RTS (Request to send)/CTS (Clear to send) frames [1]. (ii) DCF_PCF Scenario: PCF access method is implemented ‘optionally’ in an infrastructure network along with the DCF. With PCF, the access point (AP) in the network acts as a Point Coordinator (PC). The PC uses Polling based approached to determine which station can transmit data. It is optional for the stations to participate in the PCF. Those stations which respond to the poll received from the PC are called CF-Pollable stations. The PCF functionality has been enabled on node_0, node_1, node_3, node_5 and node_7. (iii) DCF_Frag Scenario: This scenario has been duplicated from DCF scenario and here on all stations; Fragmentation Threshold size of 256 bytes has been set. So fragmentation of the frames will occur if their size exceeds the fragmentation threshold (which is of 256 bytes). Here in case of DCF and during contention period, all fragments of a single frame will be sent as burst with a single invocation of the DCF medium access procedure. Figure 1.1 Load statistics for DCF and PCF Scenario (iv) DCF_PCF_Frag Scenario: This scenario has been duplicated from DCF_Frag scenario due to which Fragmentation Threshold of 256 bytes has already been set on all stations. Then PCF functionality has been
  • 2. Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations DOI: 10.9790/0661-18214754 www.iosrjournals.org 48 | Page enabled on node_0, node_1, node_3, node_5 and node_7. Here in case of PCF and during a contention free periods, fragments are sent individually following the rules of the PC. As discussed above, DCF is based on CSMA/CA and there is a contention for the medium among the stations. A station only senses the medium before transmission. If the medium is idle, it transmits otherwise if the medium is busy; a station that wishes to transmit has to wait until the current transmission is over and for an additional random back off interval. Thus in this way, there may have collisions which requires retransmission of data after receiving the negative ACKs from receiver [1, 2]. This additional traffic due to the retransmission causes the traffic load in the network. In case of PCF, the existence of AP and CF-Pollable stations creates the contention free period and each station transmits its required data only on its designated interval according to the poll issued by the AP. This causes the collision free transmission and there will be less requirement of retransmission. In the figure 1.1 shown, it has been observed clearly that DCF scenario without PCF (shown in Red and Blue colors) is suffering with higher loads as compared to DCF scenario with PCF (shown in Green and Sky blue colors). The possible cause of this high load is additional traffic of retransmissions, required due to possible collisions in case of DCF scenario. Let see the effect of utilizing PCF and Fragmentation on delay first. II. Effect of PCF on Delay: As discussed above, DCF is based on CSMA/CA in which station has to wait until the medium becomes idle and then additional wait for back off time before it can transmit anything. In addition to this, as PCF pollable traffic has more priority so it has to wait until the traffic of any CF-Pollable station becomes over. In addition to this, in DCF, station has to wait for additional SIFS (Shortest IFS) before sending of data and another SIFS before getting an ACK from the receiver [1]. While in case of PCF, station suffers on delay of its polling turn which depends on the number of Pollable stations. If number of pollable stations is higher, then delay for receiving a poll from the PC will be higher. But as here number of pollable stations is only five due to which polling delay is significantly very low. III. Effect of Fragmentation on Delay: In fragmentation, the frames which are larger than 256 bytes are fragmented into smaller frames. This will cause additional delay because at the transmission side, first large frame will be chopped down into smaller subframes, then each subframe will be added with its header. Similarly, at the receiver end, header will be removed from each subframe and then reassembled into a larger frame. In case of DCF, this delay can be seen significant because here each packet will have to wait before it can access the medium. Similarly, as the number of frames has been increased, the number of collisions may be increased too. This will cause more retransmissions resulting in more delays for the reassembly of the error free subframes into larger frame at the receiver side. The delay due to this fragmentation is relatively small in case of PCF enabled scenario. The effect of PCF and Fragmentation on Delay can be seen in the figure 1.2. As discussed above, DCF_Frag (shown with red line) has the highest delay followed by DCF (shown with blue line). DCF_PCF_Frag (shown with sky blue color) has fragmentation delay and the DCF_PCF (shown with Green color) has the smallest delay as compared to other scenarios. IV. Effect of PCF on Throughput: The scenario without PCF will suffer more delays and thus throughput is small as compared to the scenario with PCF. Secondly, because of the retransmissions due to any possible collisions, effective throughput will also be relatively small as compared to scenario with PCF. Effect of Fragmentation on Throughput, refer to the discussion above, in case of DCF only, the number of frames will be increased, which will cause more collisions resulting in greater number of retransmissions. This will cause effective throughput to be decreased as compared to the throughput in case of scenario with PCF. The above two findings can be seen clearly in the figure 1.3. The highest throughput is in DCF_PCF (shown with Green color) followed by DCF_PCF_Frag (shown with sky blue color). The low throughput is in DCF (shown with Blue color) followed by the DCF_Frag (shown with red color) showing the lowest throughput among the four scenarios. Referred to the figure 1.4 and figure 1.5, in DCF_PCF scenario, node_2 has its PCF Functionality disabled while node_3 has its PCF functionality enabled. Figure 1.4 shows the delay in node_2 and node_3 while figure 1.5 shows the retransmission attempts in node_2 and node_3. As seen in figure 1.4, node_2 and
  • 3. Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations DOI: 10.9790/0661-18214754 www.iosrjournals.org 49 | Page Figure 1.2 Delay statistics for all four scenarios Figure 1.3 Throughput statistics for all four scenarios node_3 has almost the same results for DCF and DCF_Frag scenarios. But in case of DCF_PCF and DCF_PCF_Frag, the delay is much higher in node_2 as compared to that in node_3. The reason for this is that in case of PCF enabled in some nodes, the CF-pollable nodes (like node_3) can transmit right away without any delay in the collision free period (CFP) and the non-CF-Pollable nodes (like node_ 2) experience higher delays due to the existence of the collision-free period during which only CF-Pollable nodes are permitted to transmit. In the figure 1.5, the number of retransmissions in node_3 is considerably low as compared to that in node_2 for the four scenerios. The reason for this is that, in node 3, when PCF is used, it guarantees that there will be no collision as each station is transmitting at
  • 4. Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations DOI: 10.9790/0661-18214754 www.iosrjournals.org 50 | Page Figure 1.4 Delay Station for node_2 and node_3 (in DCF_PCF scenario) its desired interval and thus there will be no retransmission. So the number of transmissions will be lower for DCF_PCF (shown with green color) and DCF_PCF_Frag (shown with sky blue color) in node_3 as compared to node_2. Secondly, the nodes with PCF enabled do not compete for access to the medium, so there will be lower number of stations (nodes) that will contend and transmit during contention period. Thus the number of retransmissions for DCF_Frag (shown with red color) and DCF (shown with blue color) will also be relatively smaller in node_3 as compared to those in node_2. Referred to the figure 1.6 and 1.7 are actually doing comparison between the two scenarios where in one scenario, have only two PCF enabled nodes ( called DCF_two PCF) and the other scenario when have PCF enabled on all nodes (called DCF_allPCF). Referred to the Figure 1.6 is shown the comparison of delay statistics for DCF_twoPCF and DCF_allPCF.
  • 5. Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations DOI: 10.9790/0661-18214754 www.iosrjournals.org 51 | Page Figure 1.5 Retransmission Attempts statistics for node2 and node 3 (in DCF_PCF scenario) It can be seen that the delay in DCF_twoPCF (shown with Pink color) is much higher as compared to the delay in case of DCF_allPCF (shown with Yellow color). As discussed above, the reason for it is that have much chance of collisions and the respective retransmissions when have only two PCF enabled nodes, causing much delay. But when we have all PCF enabled nodes, then there are almost no collisions and retransmissions resulting in much less delay. For the same reason, in Figure 1.6 (a) throughput in DCF_allPCF (shown with Yellow color) is much higher as compared to that DCE_twoPCF (pink color). According to the Figure 1.7 shown, is getting unusual result of load comparison between DCF_allPCF and DCF_twoPCF, because usually if it has less delay and more throughputs, so expect fewer loads in the network. But here DCF_allPCF have more loads (shown with Yellow color) as compared to that in case of DCF_twoPCF (shown with pink color). The possible reason for it can be that, in case of DCF_allPCF, the number of Polls sent by the PC is higher due to the greater number of CF-Pollable nodes as compared to the number of polls sent when only two CF-Pollable nodes have in DCF_twoPCF scenario. This can cause extra load in the network even if there are not any collisions and the resulting retransmissions. If the number of CF-Pollable
  • 6. Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations DOI: 10.9790/0661-18214754 www.iosrjournals.org 52 | Page Figure 1.6(a) Figure 1.6(b) Figure 1.6 (a) Throughput and 1.6(b) Delay statistics for DCF_compared to that in DCF_twoPCF (shown with Pink color).allPCF and DCF_twoPCF
  • 7. Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations DOI: 10.9790/0661-18214754 www.iosrjournals.org 53 | Page Figure 1.7 Load statistics for DCF_allPCF and DCF_twoPCF nodes in the network is increased, this load effect can be experienced more significantly in that case. The Medium Access Delay for all six scenarios is shown in Figures 1.8 and 1.9. From the Figure 1.8, it can be seen clearly that DCF_Frag (shown with Green color) has the highest medium access delay followed by the DCF (shown with Red color) as compared to remaining PCF enabled scenarios. As discussed in above, the reason for high delay in DCF scenarios (DCF_Frag and DCF) is that there is no PCF enabled nodes and all the nodes are accessing the medium during the contention period resulting in collisions and corresponding retransmissions. Between DCF_Frag and DCF, DCF_Frag has more delay because of the fragmentation issues as discussed above. For the remaining four PCF enabled scenarios, results are seen unexpected in Figure 1.8 so their simulation results have been generated again and shown in Figure 1.9. As per Figure 1.9 shown, it can be seen clearly that DCF_PCF_Frag (shown with sky blue color) has higher medium access delay as compared to the remaining DCF_twoPCF, DCF_PCF and DCF_allPCF scenarios. The reason for this is the same fragmentation issues as discussed in above. For the remaining three scenarios, DCF_twoPCF (shown with pink color) has more delay compared to DCF_PCF and DCF_allPCF. The reason for it is the effect on delay due the number of CF- Pollable nodes in the network discussed in above. In DCF_twoPCF, there are only two CF-Pollable nodes resulting in higher number of nodes to work in Contention period resulting in more collisions and corresponding retransmissions. In DCF_PCF (shown with green color), almost half of all the nodes are CF-Pollable resulting in half of the nodes in the network to work during Contention Free period resulting in significantly less number of collisions and retransmissions. Finally in DCF_allPCF (shown with Yellow color), the medium access delay is the lowest as almost all the nodes are working in Contention Free period and there are not any significant collisions and retransmissions. Figure 1.8 Medium Access Delay statistics for DCF_Frag and DCF
  • 8. Performance Measurement Of Wlan Based On Medium Access Control For Wirelessly Connected Stations DOI: 10.9790/0661-18214754 www.iosrjournals.org 54 | Page Figure 1.9 Medium Access Delay statistics for DCF_PCF_Frag, DCF_twoPCF, DCF_PCF and DCF_allPCF V. Conclusion The DCF_Frag has the highest delay followed by DCF when PCF is not enabled on all the nodes in the network. When PCF is enabled in the network, DCF_PCF_Frag has higher delay followed by DCF_twoPCF, DCF_PCF and DCF_allPCF respectively. Polling delay is happened if the number of pollable station is more. To make less such delay uses less number of polling stations. And traffic load occurs due to retransmission. Less number of collisions and retransmissions are occurred during the contention free period. If it is being ensured less traffic load (retransmission) in the network then potentiality is more to get less delay and more throughputs. VI. References: [1] Stallings William, Wireless Communication & Networks. 2nd edition, P-435, prentice- Hall of India, New Delhi-110 0001 [2] Larry L. Peterson & Bruce S. Davie, Computer Networks: A System Approach, 4th edition, section 2.8.2, P-140