Algorithm 2 Optimal Contention Window Selction
Initialization: 𝚥 = 0, 𝚤 = 0, T${}_x$ = 0.
	procedure
2:	count 𝚤▹𝚤 is a flow sensed at the physical layer by a node, which is out of transmission range but within the sensing range
4:	count 𝚥	▹ 𝚥 is a flow within the transmission range
6:	for each TS duration do	▹ MAC layer is divided into Time Slots (TS) of fixed intervals
8:	𝚥’s duration = 10% × 𝚥’s time + 90% × T${}_x$ duration	▹ time taken by 𝚥 flow
10:	$T_x$ = 0
12:	for each packet p do
14:	if p is CTS then
16:	T${}_x$ = T${}_{rtc}$ + T${}_{cts}$
18:	elseif p is ACK then
20:	T${}_x$ = T${}_{data}$ + T${}_{ack}$
22:	end if
24:	end for
26:	end for
28:	$\mathfrak{R}=\frac{𝚥}{TSduration}$	▹ $\mathfrak{R}$ is real allocation of bandwidth
30:	$\mathfrak{F}$ = $\frac{𝚥}{𝚤+𝚥}$	▹ $\mathfrak{F}$ is the fair allocation of bandwidth to a node
32:	CW${}_{adjusted}$ = CW $\times \frac{R}{F}$
34:	CW${}_{optimal}$ = $\kappa \times C{W}_{adjusted}$	▹ if packet is marked using Equation (6) and $\kappa$ > 1 is a delay factor.
36:	CW${}_{optimal}$ = CW${}_{adjusted}$	▹ if packet is not marked using Equation (6)
38:	end procedure