The Effect of Retransmission Cutoff in S-ALOHA Systems with Binary Exponential Backoff Algorithm

Jun-Bae Seo and Victor Leung Dept. of Electrical and Computer Engineering University of British Columbia

September 29, 2010

We consider ... Exponential backoff algorithm in S-ALOHA system

Retransmission (Retx) cutoff.

and show ...

Performance tradeoff among throughput, mean and variance of retx delay against tolerable packet dropping probability. System stability with (W/) and without (W/O) retx cutoff.

Contents 1. Previous works 2. Assumptions and System Model 3. Analysis 4. Numerical Examples 5. Conclusions

Previous works

In [JSAC-Kim92][TWC-Liu02][TWC-Sakakibara03],
Packet is retransmitted with probability p. Stability is mainly examined retx cutoff. Packet dropping probability is not evaluated.

In [TWC-Xiao00][TNET-Kwak05],
BEB algorithm is used. IEEE 802.11with unsaturated condition [TWC-Xiao00]. S-ALOHA system with saturated condition [TNET-Kwak05]. Variance of retx delay is not considered.

Performance comparison of the system W/ & W/O retx cutoff including packet dropping prob. and variance of delay.

Assumptions and System model

Assume S-ALOHA system with BEB algorithm.

At the i-th retx, a terminal uses Wi = U(0, W0 2i1 1) for 1 i K.

After tx failure at the K -th retx,

W/O retx cutoff, WK is repeatedly used. W/ retx cutoff, a packet is dropped.

Finite population with unsaturated trafc condition.

A packet generation based on Bernoulli trial with probability for idle terminals.

Analysis - (1/2)

Tag user approach :

almost identical to Bianchis model in IEEE 802.11 except unsaturated trafc condition.
A Markov chain consists of an idle state and W0 states. PK
i=1

2i retx

For retx delay analysis, an absorbing Markov chain is used.

Idle state Absorbing state.

Analysis - (2/2)

Stability : We prove that the following nonlinear equation has a unique solution of pr .
pr = i=1 i,0 h(pr ) = pr i=1 i,0 . The existence of solution : h(0) < 0 and h(1) > 0. Its uniqueness : There exist two subintervals, [0, ] and c (, 1].
h() < 0 and dh/dpr () = 0. dh/dpr (c ) > 0.
K K

Numerical Examples - (1/3)

0.4 0.35 0.3 0.25 0.2 0.15 0.1 0.05 0 0

0.4 0.35 0.3 0.25 0.2 0.15 0.1 0.05 0 0

0.02

0.04

0.06

0.08

0.1

0.02

0.04

0.06

0.08

0.1

Figure: 1. Throughput comparison, M = 70, W0 = 2, Solid : K = 6, Dashed : K = 7, Dash-dotted : K = 8, : simulation.

Numerical Examples - (2/3)

300

180 160

250 140 200 120 100

150

D
80 60 40 20 0.02 0.04 0.06 0.08 0.1 0 0

100

50

0 0

0.02

0.04

0.06

0.08

0.1

Figure: 2. Mean delay comparison, M = 70, Solid : K = 6, Dashed : K = 7, Dash-dotted : K = 8, : simulation.

Numerical Examples - (3/3)

x 10
3
6

7 6 5 4

10

10

Variance of delay

10

Pd

10

3 2 1 0 0

10

10

0.02

0.04

0.06

0.08

0.1

10

0.02

0.04

0.06

0.08

0.1

Figure: 3 and 4. Packet dropping probability, and variance of delay vs. number of terminals, M = 70, Solid : K = 6, Dashed : K = 7, Dash-dotted : K = 8, : simulation.

Conclusions

EB algorithm w/ & w/o retx cutoff in S-ALOHA system.

W/O retx cutoff, large K is preferable for throughput and mean delay.
Huge delay variance.

W/ retx cutoff, delay performance is signicantly improved.

Packet dropping and throughput in tolerable level. K constructs a tradeoff between throughput/packet dropping probability and delay performance.

Stability of BEB algorithm is guaranteed with/without retx cutoff. As future work, we consider an optimization problem of BEB algorithm by estimating the number of terminals.