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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Proactive QoS Rout<strong>in</strong>g <strong>in</strong> Ad Hoc Networks 69condition. Compared with 80% OLSR, 40% OLSR evenly directs traffic throughoutthe network, so under high movement (speed 20m/s, and 10m/s) where the wirelessmedia are rather busy, 40% OLSR has better optimal bandwidth routes than that ofthe 80% OLSR, although it has more overhead than 80% OLSR. Under low movement(speed 5m/s, 1m/s, and 0m/s), the added overhead of 40% OLSR has a negativeeffect on the network bandwidth condition, thus the 40% OLSR has less optimalbandwidth than 80% OLSR. As the 20% OLSR has the highest overhead, its optimalbandwidth routes have the lowest available bandwidth.From the results, we can also see that because the orig<strong>in</strong>al OLSR has the lowestoverhead, it provides the network with the best bandwidth condition – its best bandwidthpaths have the highest bottleneck bandwidth among all the OLSR versions.However, as the orig<strong>in</strong>al OLSR does not make efforts to f<strong>in</strong>d these optimal bandwidthpaths, the actual path it f<strong>in</strong>ds may have a lower bandwidth than the paths the QoSOLSR versions f<strong>in</strong>d. In the follow<strong>in</strong>g, we compare and analyze the actual bandwidthon the path the 4 versions of OLSR calculate.Table 4. Avaliable bandwidth on the optimal paths (measured as idle time).Algorithm 20m/s 10m/s 5m/s 1m/s 0m/sQoS 20% 77.68% 80.93% 82.29% 84.69% 89.73%QoS 40% 82.23% 84.92% 86.29% 87.46% 90.17%QoS 80% 78.17% 84.27% 87.17% 90.08% 92.34%Orig<strong>in</strong>al 87.07% 87.28% 90.63% 91.14% 93.08%The actual average available bandwidth the rout<strong>in</strong>g algorithms calculate= the available bandwidth on the optimal paths x ((1- “Bandwidth Difference”)x “Error Rate”) + (1- “Error Rate”))= the available bandwidth on the optimal paths x (1- “Bandwidth Difference”x “Error Rate”)Us<strong>in</strong>g the “Bandwidth Difference” and “Error Rate” values, the result for actualaverage available bandwidth the rout<strong>in</strong>g algorithms calculated is shown (see Fig. 7).We can see that although the QoS OLSR versions <strong>in</strong>troduce more overhead, theroutes they compute still have higher available bandwidth than the routes <strong>in</strong> a networkrunn<strong>in</strong>g the orig<strong>in</strong>al OLSR. In movement patterns with maximum speed 20m/s,10m/s, 5m/s, and 1m/s, among all the OLSR algorithms, the 40% OLSR always computesthe route with the best available bandwidth, as it has less overhead than 20%OLSR and more accurate bandwidth <strong>in</strong>formation than 80% OLSR. In the fixed networkcase, because of few topology updates, all the algorithms have low overhead.Thus, 20% OLSR f<strong>in</strong>ds the routes with highest bandwidth, for it has the most accuratebandwidth <strong>in</strong>formation. Based on these results, we conclude that the QoS OLSRversions do achieve bandwidth improvement over the orig<strong>in</strong>al OLSR algorithm.5 Analysis of QoS Rout<strong>in</strong>g and Future WorkAs mentioned <strong>in</strong> Section 1, there is a trade-off between the QoS performance that theQoS rout<strong>in</strong>g protocol achieves and the additional cost it <strong>in</strong>troduces. The QoS OLSR

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

Saved successfully!

Ooh no, something went wrong!