13.07.2015 Views

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Ste<strong>in</strong>er Systems for Topology-Transparent Access Control <strong>in</strong> MANETs 255S(2,k,v) M<strong>in</strong>imum ThroughputS(2,k,v) M<strong>in</strong>imum Throughput vs. TDMAM<strong>in</strong>imum Throughput0.40.30.20.1Ratio to TDMA Throughput40302010010 20 30 40Size of Neighbourhood010 20 30 40Size of NeighbourhoodFig. 3. M<strong>in</strong>imum throughput for (a) S(2,k,v); and (b) versus TDMA, for k =3, 6, 9, 12.M<strong>in</strong>imum Frame Throughput0.140.120.10.080.060.040.020S(2,k,v) M<strong>in</strong>imum Frame Throughput10 20 30 40Size of NeighbourhoodRatio to TDMA Frame ThroughputS(2,k,v) M<strong>in</strong>imum Frame Throughput vs. TDMA4321010 20 30 40Size of NeighbourhoodFig. 4. M<strong>in</strong>imum frame throughput for (a) S(2,k,v); and (b) versus TDMA, for k =3, 6, 9, 12.Aga<strong>in</strong>, we look at frame throughput, this time the m<strong>in</strong>imum value, <strong>in</strong> Fig. 4(for the same k’s and v’s). Not surpris<strong>in</strong>gly, the m<strong>in</strong>imum frame throughput islower than when us<strong>in</strong>g the more optimistic acknowledgement model. The ma<strong>in</strong>difference between this figure and Fig. 2 is the x-<strong>in</strong>tercepts. Here, they correspondto k, clearly show<strong>in</strong>g that with m<strong>in</strong>imum frame throughput, once theneighbourhood exceeds the design parameter, all guarantees are lost immediately.This is also true for the ratio of m<strong>in</strong>imum frame throughput over TDMAwith the same frame length (b). This figure also shows that the m<strong>in</strong>imum framethroughput is essentially constant for each k as long as the design parameter issatisfied.Figure 4 shows us someth<strong>in</strong>g very important, <strong>in</strong> addition. Larger Ste<strong>in</strong>ersystems give us a m<strong>in</strong>imum frame throughput substantially better than TDMAwhen the neighbourhood is with<strong>in</strong> the bound. This is <strong>in</strong> stark constrast with theschemes <strong>in</strong> [2,10]; they never outperform TDMA on m<strong>in</strong>imum frame throughputwhen orthogonal arrays of strength two are used.Figure 5 is different from all other figures <strong>in</strong> that it plots expected throughputversus density of the neighbourhood. That is, the x-axis is the percentage ofnodes that are neighbours — these are not absolute values, and represent much

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!