1 Introduction
2 Related work
2.1 Network scenario
2.2 Related work
3 Modeling for the DCF mechanism
3.1 DCF mechanism
3.2 Markov chain for the backoff process
Notation | Definition |
---|---|
i
| The number of the retransmission |
k
| The value of a counter |
b(i, k) | Stationary probability of states with a packet waiting to transmit when the number of the retransmission is i and the value of the counter is k |
b(i, k)
e
| Stationary probability of states without packets waiting to transmit when the number of the retransmission is i and the value of the counter is k |
\( {W}_m^i \)
| Window size when the number of the retransmission is i |
m
| The maximum number of the retransmission beyond which the window would not be doubled |
m + f | Retry limit |
q
| Probability that a node has a packet prepared to transmit |
p
| Collision probability |
P
idle
| Probability that the channel is sensed idle |
τ
| Transmission probability |
4 Performance analysis for the V2I fair access
T
i
| The time that a vehicle passes through the communication range of the RSU |
τ
i
| The transmission probability |
V
i
| The velocity |
n
i
| The number of vehicles |
W
i
| The minimum window |
\( {P}_{idle}^i \)
| The probability that the channel is sensed idle |
5 Simulation results
T
p
(μs) | 8184 |
Ts(μs) | 8972 |
Tc(μs) | 8713 |
ACK(μs) | 240 |
DIFS(μs) | 128 |
SIFS(μs) | 28 |
Slot time(μs) | 50 |
Vehicles’ velocity(m/s) | Uniform in [5,45] |
D(m) | 500 |
Mean group size | 2 |
m
| 3 |
f
| 8 |
Average minimum window | 64 |
T(s) | 50 |