Let Pi, dropdenote the packet-dropping probability of host i.
Finally, the saturated throughput of host i, S i is thus given by: (16).
The normalized saturation throughput of host i, nS i, which is defined as the fraction of time that the channel is used for host i to successfully transmit payload, can be expressed as: (15).
For the simplicity of illustration, we adopt the notation, Figure 2 The state transition diagram of host i.
To host i, let p i, e denote the probability of a packet corrupted due to error-prone channels.
For host i, let s i, t) and c i, t) be the stochastic process representing the backoff stage and backoff time counter at time t, respectively.
To host i (i = 0 to K -1), let p i, c denote the probability of a packet collided with other hosts.
Thus the average packet delay of host i, E i [D], provided that this packet is not discarded, is then derived with Equations 13 and 20: (20).
To host i, let E i [Tdrop] be the average number of slots required for a packet to experience Lretry + 1 failures in the (0,1,...,Lretry) stages.
Let Pi, singledenote the probability that only host i transmits and the remaining K-1 stations are idle on condition that at least one station transmits.
The average number of slots required for host i to successfully transmit a packet, E i [X], is given by: (19).
