1 / 28

A Flexible Bandwidth Management Scheme in Bluetooth

A Flexible Bandwidth Management Scheme in Bluetooth. Chin-Fu Liu Multimedia and Communications Laboratory Department of Computer Science and Information Engineering National Chi Nan University Taiwan, R.O.C. Advisor : Chun-Chuan Yang. Outline. Introduction

hadassah-floyd
Download Presentation

A Flexible Bandwidth Management Scheme in Bluetooth

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. A Flexible Bandwidth Management Scheme in Bluetooth Chin-Fu Liu Multimedia and Communications Laboratory Department of Computer Science and Information Engineering National Chi Nan University Taiwan, R.O.C. Advisor : Chun-Chuan Yang

  2. Outline • Introduction • Basic Version of Bandwidth-Based Polling (BBP-bas) Scheme • Extended Version (BBP-ext) • Scheduling algorithm for BBP-ext • Performance Evaluation • Conclusion

  3. Introduction - Bluetooth • Low cost • Low complexity • In a small area • Piconet

  4. Introduction • Time Division Duplex • Master based polling

  5. Introduction

  6. Introduction – QoS Support in BT. • Goals of bandwidth management1.Bandwidth satisfaction2.Fairness • Goal of Bandwidth-Based Polling (BBP) 1.Bandwidth management2.Minimal Control signaling3.Lower Jitter on SCO links

  7. BBP notation • QoS-slave • SCO-slave • BE-slave (best effort slaves) • BBP-bas • BBP-ext

  8. Bandwidth Based Polling Scheme - Basic versionBasic idea and slots allocation for QoS slaves • Framing structure of time slots • Dynamic frame for flexibility • Polling many times

  9. Bandwidth Based Polling Scheme - Basic versionBasic idea and slots allocation for QoS slaves • DH11 = DH5+DH5+DH1 • DH5 > DH3 >> DH1 • Maximum polling times

  10. PicoFrameSize & PicoFrameLimit Master Slavei (BwRqi) RequestSlot & Framelimit Bandwidth Based Polling Scheme - Basic versionBasic idea and slots allocation for QoS slaves • Progressive bandwidth allocation • Negotiation process

  11. Bandwidth Based Polling Scheme - Basic versionQoS slave actions • #Bytesi = BwRQi * PicoFrameLimit * 625μs • Payload type :ByteCount >= #Bytesi or DH5*K

  12. Bandwidth Based Polling Scheme - Basic versionQoS slave actions FrameLimiti=(RequestSloti Byte#)/(BwRQi*625μs)

  13. Bandwidth Based Polling Scheme - Basic versionMaster actions • PicoFrameSize - by RequestSloti • PicoFrameLimit - by FrameLimiti

  14. Bandwidth Based Polling Scheme - Extended versionSupport SCO-Slave • SCO link - Isochronous service by TSCO • HV3 TSCO=6 (64Kbps CBR service) • Adaptive TSCOEx:TSCO =16 (24Kbps) • Soft SCO links - Jitters due to shifting

  15. Bandwidth Based Polling Scheme - Extended versionSupport SCO-Slave

  16. Bandwidth Based Polling Scheme - Extended versionSupport Best Effort Slave (BE-Slave) • Equilibrium state • Unused Slots = PicoFrameLimit - PicoFrameSize • Slots quantum = (PFL-PFS)/(# of BE-slaves)

  17. Bandwidth Based Polling Scheme - Extended versionPacket format in BBP-Ext Original Packet Master→QoS slave QoS slave→Master Master→BE slave BE slave→Master

  18. Scheduling algorithm for BBP-extScheduling all kinds of slaves • Round RobinS1=DH3 S2=DH8 S3=DH10 TSCO=10

  19. Scheduling algorithm for BBP-extDelay/Jitter analysis • Reasons for shifting:(1) Undividable packet of QoS-slave (2) Other SCO-slaves • Maximum shift → 4+(N-1)*2 Slots • Tsniff=TSCO • Nsniff-attempt=Maximum shift

  20. Performance EvaluationSimulation Env & Performance Criteria • 1 slot=625μs • Bandwidth utilization • Fairness and flexibility with QoS slaves • Maximum shift in SCO links

  21. Performance EvaluationSimulation Result & Discussion K=4 Req=150K

  22. Performance Evaluation – Case 1Simulation Result & Discussion K=1

  23. Performance Evaluation – Case 1Simulation Result & Discussion K=4

  24. Performance Evaluation - Case 2Simulation Result & Discussion K=4 TSCO=10

  25. Performance Evaluation – Case 3Simulation Result & Discussion K=4 TSCO=10

  26. Performance Evaluation – Case 4Simulation Result & Discussion

  27. Performance EvaluationSimulation Result & Discussion K=1 K=2 K=4 K=8

  28. Conclusion • A dynamic framing structure • Distributed Mechanism • Minimal Control signaling • Good performance and flexibility by BBP • Future WorkMaster’s request Admission controlBluetooth 2.0

More Related