05.01.2013 Views

Ad Hoc Networks : Technologies and Protocols - University of ...

Ad Hoc Networks : Technologies and Protocols - University of ...

Ad Hoc Networks : Technologies and Protocols - University of ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

QoS Routing 239<br />

where is the number <strong>of</strong> consecutive back<strong>of</strong>fs experienced for the packet<br />

to be transmitted. To support different priorities, the back<strong>of</strong>f computation<br />

can be changed as follows<br />

where is the priority <strong>of</strong> node<br />

2 DIFS: As shown in Figure 8.3, this is the minimum interval <strong>of</strong> time<br />

required before initiating a new packet transmission after the channel has<br />

been busy. To lower the priority <strong>of</strong> a flow we can increase the DIFS period<br />

for packets <strong>of</strong> that flow. However, it is difficult to find an exact relation<br />

between the DIFS period for a flow <strong>and</strong> its throughput. Figure 8.8 shows<br />

the different DIFS values <strong>and</strong> the corresponding relative priorities. This<br />

idea is similar to the concept <strong>of</strong> AIFS in 802.11e, as described in Section<br />

8.4.3.<br />

Figure 8.8. Service Differentiation using different DIFS values<br />

3 Maximum Frame Length: Channel contention using the DCF functionality<br />

is typically used to send a single frame. By using longer frames,<br />

higher throughput can be provided to high-priority flows.<br />

8.5 QoS Routing<br />

The QoS metrics <strong>of</strong> an end-to-end route depends on the links <strong>of</strong> the computed<br />

route. There are three main challenges in computing a route satisfying QoS<br />

requirements. First, the QoS metric on each link must be either computed<br />

continuously or discovered on dem<strong>and</strong>, when the route request packet is being<br />

forwarded. Second, broadcast based routing algorithms do not explore all<br />

possible routes. Third, mechanisms to compute the available b<strong>and</strong>width on<br />

a link are coarse <strong>and</strong> are based on observing other parameters such as queue<br />

length <strong>and</strong> channel access history.

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

Saved successfully!

Ooh no, something went wrong!