2013
DOI: 10.1007/s11276-013-0653-2
|View full text |Cite
|
Sign up to set email alerts
|

Analytical analysis of applying packet fragmentation mechanism on IEEE 802.11b DCF network in non ideal channel with infinite load conditions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 21 publications
(6 citation statements)
references
References 54 publications
0
6
0
Order By: Relevance
“…A parallel study is performed on the segmentation process for the packets which are higher in size than MTU. Larger data packets than 1500 bytes will split into smaller packets called fragments to enable them transverse the network [15]. Based on the literature study a proper simulation tool is required to develop the network in the real time simulation.…”
Section: Methodsmentioning
confidence: 99%
“…A parallel study is performed on the segmentation process for the packets which are higher in size than MTU. Larger data packets than 1500 bytes will split into smaller packets called fragments to enable them transverse the network [15]. Based on the literature study a proper simulation tool is required to develop the network in the real time simulation.…”
Section: Methodsmentioning
confidence: 99%
“…In [7], Mohand and Louiza introduced an extension of the Bianchi's Markov chain model with Packet Fragmentation Mechanism (PFM) and the Packet Error Rate (PER). A mathematical model was presented to compute the overall throughput and the mean response time of the IEEE 802.11b and the results were validated by simulation.…”
Section: Related Workmentioning
confidence: 99%
“…Finally, researchers have proven the efficiency of new mechanisms that were proposed to enhance the 802.11 performance. [7] One of the major challenges that faced researchers was the impact of mobility on wireless ad-hoc networks. Mobile ad-hoc networks lack fixed topology due to node mobility, interference, path loss, shadowing.…”
Section: Introductionmentioning
confidence: 99%
“…However, they were a solid starting point for further research. Most of all, they resolved the complicated problem of representing multiple states of the channel access procedure by using Markov chains (see Kosek-Szott et al, 2011;Yazid et al, 2014aYazid et al, , 2014bYazid et al, , 2015b. In this area, Kong et al (2004) presented an analytical model of the IEEE 802.11e EDCA taking into account AIFS and CW.…”
Section: Introductionmentioning
confidence: 99%