1 / 37

Providing QoS in Ad Hoc Networks with Distributed Resource Reservation IEEE802.11e and extensions

Providing QoS in Ad Hoc Networks with Distributed Resource Reservation IEEE802.11e and extensions. Ulf Körner and Ali Hamidian. The Goal. To provide QoS guarantees to WLANs operating in ad hoc mode by allowing stations to reserve resources (medium time)

satin
Download Presentation

Providing QoS in Ad Hoc Networks with Distributed Resource Reservation IEEE802.11e and extensions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Providing QoS in Ad Hoc Networks with Distributed Resource ReservationIEEE802.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 WLANsdo 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. mapping to AC Background [1] Best effort [2] Video [3] Voice [4] 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 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

  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 whenthe number of LP streams increases?

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

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

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

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

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

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

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

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

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

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

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

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

  28. Throughput: EDCA vs. EDCA/RR EDCA EDCA/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

  34. Results - 5 % packet error

  35. Results - 0 % packet error

  36. Multi-hop Resource Reservation • A: if traffic is admitted, send RREQ-ADDTSRequest • B: if traffic is admitted, send RREQ-ADDTSRequest • C: if traffic is admitted, schedule traffic and send RREP-ADDTSResponse • B: schedule traffic and send RREP-ADDTSResponse • 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

More Related