Optimized Pessimistic Fibonacci Catalan Back-off

Algorithm (PFCB)
By:Umang Gupta (106114098) ,
Hari Subbiah (106114052)

The Fibonacci Backoff algorithm and the Pessimistic Fibonacci

Backoff are proposed to improve network performance depending
on contention window size. This research introduces a new hybrid
Backoff algorithm called Pessimistic Fibonacci Catalan Backoff
(PFCB) Algorithm which merges the two previous algorithms with
a new Catalan Sequence (ratio between successive numbers
approaches 4 as value increases) in order to find the most proper
contention window sizes that reduce collisions as much as
possible.
PFCB Algorithm:
0. Set Backoff timer to initial value
1. While ( BOT 0 ) do for each time slot
2. If channel is idle then BOT = BOT-1
3. If channel is idle for more than IDFS then
4. Send
5. If send failure then
6. If NOB <= N then
7. CW = CW * 2
8. BOT = Rand (x);
9. Else
10. If N < NOB< M
11. If Ack Failure Count <=3

12. CW = CW^3
13. BOT = Rand (x);
14. Else
15. Use Catalan CW BOi+1=Catalan(I) --- CW = next Catalan (CW)
16. Else
17. If Ack Failure Count <=2
18. Use Fibonacci CW BOi+1=fib(I) --- CW = next fib (CW)
19. BOT = Rand (x);
20. Else
21. Use Catalan CW BOi+1=Catalan(I) --- CW = next Catalan (CW)
22. Else
23. CW= Initial value
24. BOT = 0 (Initial value)
25. Go to 1
26. Stop
Note : 1 X CW-1, NOB: Number of Backoffs, N,M: CW

Flow Chart:
BOT= Initial value
CW= Initial value

Success

Channel Idle
SEND
Failure

NOB <= N
True
CW = CW * 2

Else

BOT = Rand (x)

N < NOB<
M
Else

True

Ack Failure Count

<=3
Else

True

CW = CW^3
BOT = Rand (x)

Catalan CW BOi+1=Catalan(I)

Ack Failure Count <=2

True

Else

Fibonacci CW BOi+1=fib(I)
BOT = Rand (x)

Catalan CW BOi+1=Catalan(I)

Explanation:
This algorithm uses a combination of Catalan, Fibonacci, cubic
and exponential increment behaviors. PFCB increases the
contention window size exponentially and a transmission failure
occurs to give a longer waiting time before retransmission, then
PFCB increases the timer cubically in order to avoid increasing
Backoff extremely. If Ack failure increases during this time, then

Catalan sequence is used. After a fixed number of cubic/Catalan

increments PFCB starts to increase the timer, using a Fibonacci
series to achieve a less dramatic growth of the contention window
size, allows nodes to perform more tries to access the channel.
Again if Ack failure increases during this time, Catalan series
increases the timer, to improve overall network performance
mainly to achieve the best data delivery ratio with fewer routing
load in the network.
This algorithm aims to achieve less growth in the contention
window size to allow the nodes to access the channel after
incrementing Backoff time. NS-2 simulator was used and we
implemented proposed algorithm in it. Many parameters were
used to measure the network efficiency such as packet delivery
ratio, delay time, throughput, and packet loss.
Conclusion:
This research proposes the PFCB algorithm designed which is
compared in contrast to the STD-BEB and PFB algorithms. The
results show that the new proposed algorithm outperforms the
other compared ones, in terms of packet delivery fraction, end-toend Delay time, throughput and packet loss.