Presentation is loading. Please wait.

Presentation is loading. Please wait.

Providing QoS in Ad Hoc Networks with Distributed Resource Reservation IEEE802.11e and extensions Ulf Körner and Ali Hamidian.

Similar presentations


Presentation on theme: "Providing QoS in Ad Hoc Networks with Distributed Resource Reservation IEEE802.11e and extensions Ulf Körner and Ali Hamidian."— Presentation transcript:

1 Providing QoS in Ad Hoc Networks with Distributed Resource Reservation IEEE802.11e and extensions Ulf Körner and Ali Hamidian

2 The Goal To provide QoS guarantees to WLANs operating in ad hoc mode –by allowing stations to reserve resources (medium time) –by distributing the existing admission control and scheduling algorithms Example of application area: gaming

3 No QoS in IEEE 802.11 Today’s WLANs do not offer any QoS –usually not a big problem if you just surf the Internet –bad voice/video quality if you use e.g. Skype or MSN messenger

4 802.11 MAC & its QoS Limitations 802.11 has two medium access methods: –distributed coordination function (DCF) All data flows have the same priority –point coordination function (PCF) Not possible for stations to send QoS requirements to the AP Unknown transmission time of the polled stations 802.11e introduces: –hybrid coordination function (HCF) enhanced distributed channel access (EDCA) HCF controlled channel access (HCCA)

5 Hybrid Coordination Function (HCF) transmission opportunity (TXOP): A bounded time interval during which a station may transmit multiple frames –Solves the PCF problem with unknown transmission times traffic specification (TSPEC): Contains information about the QoS expectation of a traffic stream (frame size, service interval, data rate, burst size, delay bound, etc.) –Solves the PCF problem with the inability to send QoS needs

6 Enhanced Distributed Channel Access (EDCA) Contention-based “ Enhanced DCF ” access category (AC): Each station has four ACs ( ” transmission queues ” ). Each AC contends for TXOPs independently of the other ACs Service differentiation is realized by varying –Different parameters AIFSN[1] CWmin[1] CWmax[1] TXOPlimit[1] AIFSN[2] CWmin[2] CWmax[2] TXOPlimit[2] AIFSN[4] CWmin[4] CWmax[4] TXOPlimit[4] AIFSN[3] CWmin[3] CWmax[3] TXOPlimit[3] virtual collision handler Background [1]Best effort [2]Video [3] Voice [4] mapping to AC

7 HCF Controlled Channel Access (HCCA) Contention-free “Enhanced PCF” Medium access controlled by a QoS access point (QAP) HCCA allows stations with QoS traffic to reserve TXOPs using TSPECs

8 Motivation of our Work: QoS Limitations in 802.11e Problem with EDCA –Random medium access & no distributed admission control => not possible to guarantee QoS Problem with HCCA –Centralized infrastructure requirement => HCCA not useful in ad hoc networks We need a solution which is –Deterministic (unlike EDCA) Remove the random medium access delays –Distributed (unlike HCCA) Remove the need of an access point

9 EDCA with Resource Reservation (EDCA/RR) distributed admission control and scheduling possibility to reserve TXOPs for deterministic and contention-free medium access

10 EDCA/RR Operation Similar to EDCA as long as LP frames (AC_Background and AC_BestEffort) are sent

11 EDCA/RR Operation When a HP frame (AC_Video and AC_Voice) reaches the MAC sublayer, the source checks whether its new stream can be admitted

12 EDCA/RR Operation If admission control OK: schedule the new stream broadcast ADDTS request containing TSPEC wait for ADDTS response ADDTS request

13 EDCA/RR Operation Once all ADDTS responses are received by the source, it waits until its first reserved TXOP at service start time & starts transmitting ADDTS response

14 EDCA/RR Operation deterministic and contention-free medium access: the source has now reserved TXOPs every scheduled service interval (SI) HP data frames

15 Results EDCA/RR implementation in ns-2 based on an enhanced 802.11/802.11e implementation EDCA vs. EDCA/RR Stationary behaviour: How is the average end- to-end delay of a HP-stream affected when the number of LP streams increases?

16 Throughput: EDCA 1 LP-stream and 4 HP-streams each started 10 s apart. ad hoc network

17 Throughput: EDCA 1 LP-stream and 4 HP-streams each started 10 s apart. ad hoc network 1 LP stream

18 Throughput: EDCA ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart. 1 LP stream + 1 HP stream

19 Throughput: EDCA ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart. 1 LP stream + 2 HP streams

20 Throughput: EDCA ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart. 1 LP stream + 3 HP streams

21 Throughput: EDCA ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart. 1 LP stream + 4 HP streams

22 Throughput: EDCA/RR ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart.

23 Throughput: EDCA/RR ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart. 1 LP stream

24 Throughput: EDCA/RR ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart. 1 LP stream + 1 admitted HP stream

25 Throughput: EDCA/RR ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart. 1 LP stream + 2 admitted HP streams

26 Throughput: EDCA/RR ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart. 1 LP stream + 3 admitted HP streams

27 Throughput: EDCA/RR ad hoc network 1 LP-stream and 4 HP-streams each started 10 s apart. 1 LP stream + 3 admitted HP streams + 1 rejected HP stream

28 Throughput: EDCA vs. EDCA/RR EDCAEDCA/RR

29 End

30 Average End-to-End Delay - 1 HP source - 150 simulation runs! - simulation time: 200 s

31 Problem due to Hidden Stations The hidden station C doesn’t receive A’s ADDTS request so it can start sending just before A’s TXOP starts! ==> no QoS guarantees!

32 Solving the Hidden Station Problem The TSPEC is included in the ADDTS response so when B sends an ADDTS response to A, C hears that message and learns about A’s reservation In addition: Send RTS_TSPEC and CTS_TSPEC in the beginning of each TXOP

33 Results - 0 % packet error nbr of LP- streams average end-to-end delay (ms) 99 % confidence interval (ms) EDCAEDCA/RREDCAEDCA/RR 00.6912.33(0.69,0.69)(12.13,12.53) 16.2112.22(6.20,6.22)(12.02,12.42) 211.1712.27(11.14,11.19)(12.08,12.47) 313.9312.22(13.90,13.96)(12.01,12.42) 417.1212.38(17.08,17.16)(12.19,12.57) 520.5112.25(20.46,20.56)(12.06,12.45)

34 Results - 5 % packet error nbr of LP- streams average end-to-end delay (ms) 99 % confidence interval (ms) EDCAEDCA/RREDCAEDCA/RR 00.9912.55(0.99,0.99)(12.37,12.73) 14.6812.44(4.68,4.69)(12.27,12.61) 25.2512.54(5.24,5.25)(12.35,12.73) 35.5912.34(5.58,5.60)(12.16,12.52) 45.9212.64(5.91,5.93)(12.45,12.82) 56.2812.53(6.27,6.29)(12.34,12.72)

35 Results - 0 % packet error nbr of LP- streams jitter (10 -6 s 2 )C 2 [d] EDCAEDCA/RREDCAEDCA/RR 00.02480.050.32 140481.040.32 2180481.450.32 3276481.420.32 4406491.380.32 5577491.370.32

36 Multi-hop Resource Reservation 1)A: if traffic is admitted, send RREQ-ADDTSRequest 2)B: if traffic is admitted, send RREQ-ADDTSRequest 3)C: if traffic is admitted, schedule traffic and send RREP-ADDTSResponse 4)B: schedule traffic and send RREP-ADDTSResponse 5)A: schedule traffic and send data AODV + EDCA/RR

37 Summary EDCA/RR –is a MAC scheme with distributed admission control and scheduling –allows stations to reserve TXOPs for deterministic and contention-free medium access


Download ppt "Providing QoS in Ad Hoc Networks with Distributed Resource Reservation IEEE802.11e and extensions Ulf Körner and Ali Hamidian."

Similar presentations


Ads by Google