2012
DOI: 10.1186/1687-1499-2012-274
|View full text |Cite
|
Sign up to set email alerts
|

Performance enhancement of IEEE 802.11 DCF using novel backoff algorithm

Abstract: In the IEEE 802.11 distributed coordination function (DCF), the binary exponential backoff algorithm selects a random backoff number from a uniform probability distribution to avoid the problem of packet collision. In this article, we present a novel backoff algorithm that uses a binominal distribution rather than a uniform distribution to determine the backoff value. Simulation results show that the proposed algorithm outperforms the original IEEE 802.11 DCF algorithm.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…By this it increases the delivery ratio of the data packets significantly and total end-to-end delay of packets. It's normal , since the value of cw is bounded, the algorithm prevents the selection of small backoff values ( min value =value of last cw when failure of transmission occurs cwf) contrary to the BEB algorithm which will allow the selection of ,backoff value which ranges between( 0 ,cw-1) [26] proposed Binomial BackOff Algorithm (BiBA), is introduced. It assumes nodes under saturated condition, error free channel and no hidden terminal.…”
Section: Pessimistic Linear Exponential Backoff (Pleb)mentioning
confidence: 99%
“…By this it increases the delivery ratio of the data packets significantly and total end-to-end delay of packets. It's normal , since the value of cw is bounded, the algorithm prevents the selection of small backoff values ( min value =value of last cw when failure of transmission occurs cwf) contrary to the BEB algorithm which will allow the selection of ,backoff value which ranges between( 0 ,cw-1) [26] proposed Binomial BackOff Algorithm (BiBA), is introduced. It assumes nodes under saturated condition, error free channel and no hidden terminal.…”
Section: Pessimistic Linear Exponential Backoff (Pleb)mentioning
confidence: 99%
“…The CRC value helps to verify the backoff value and also to minimize the overhead of the hash function in (2). After, the CRC value generated, the equation in (2) shows how to calculate the hash value. In this case if the hash value is h, hash function uses the output of a deterministic function "f" which is shown in equation 3.…”
Section: B Verifiable Deterministic Backoff Value Generationmentioning
confidence: 99%
“…Due to dissemination of wireless bandwidth among ad hoc nodules, MAC processes may rely on IEEE 802.11 DCF access contrivance [4].The disputation contrivance of the IEEE 802.11 is a frail variation contrivance of contention window (CW) and has numerous problems to be enhanced. There are humble and adaptive systems to augment the disputation contrivance of IEEE 802.11, but they do not revenue ideal presentation [5]. Because of the backoff phase contrivance, nodules in a network are frequent in diverse backoff phases, which persuade huge disparities in designated backoff counters and reasons little temporary justice [6].…”
Section: Introductionmentioning
confidence: 99%