簡易檢索 / 詳目顯示

研究生: 蘇義峰
Su, I. F.
論文名稱: 藍牙分散式網路中以時間頻寬平衡為基礎的連線排程方法
Time bandwidth balance-based scheduling in Bluetooth scatternet
指導教授: 鐘太郎
Jong, T. L.
口試委員: 黃裕煒
謝奇文
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 電機工程學系
Department of Electrical Engineering
論文出版年: 2011
畢業學年度: 99
語文別: 中文
論文頁數: 86
中文關鍵詞: 藍牙排程
外文關鍵詞: Bluetooth, Scheduling
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 本論文主要以藍牙技術實際應用的觀點出發,討論實際應用上的連線排程。藍牙技術的連線排程在學術上一直有論文提出來探討,但大多數的探討並沒有針對實際應用。而大部份的論文都以循環(Round Robin)的方法為主軸,其宗旨大多強調「公平性」。但是實際上應該根據應用的不同而因時制宜。因為藍牙技術本身的傳輸速率不高,所以過分地去強調高傳輸速率的排程似乎毫無意義。反觀藍牙的基本精神是在便利性與低功耗,也就是說藍牙的服務品質似乎比傳輸速率更加來的重要。尤其是當連線愈多的時候,在排程上更加是不可以有所謂的「公平」。比方說,聲音的品質就遠比檔案傳輸的速率來的重要。這是因為人類的感官可以明顯地感受出聲音品質的差異感。在連線較多的情況下,假設每個連線所分配到的時間頻寬已經不大了,甚至連聲音連線(A2DP)的頻寬也明顯不足時。「公平性」的訴求就似乎變得不重要了。重要的是要如何維持聲音連線所需要的頻寬以確保聲音的品質。因此本論文提出以時間頻寬平衡的排程方法,再加上在計算Bandwidth Debt時可因時制宜的權重參數來解決這類的問題。此排程演算法可以分為三個步驟,分別是根據所提簡化的Link Priority計算公式選出Link Priority大於臨界值(0)的Link、再根據Frame Time來判斷推選出Candidates、最後根據所提Bandwidth Debt投票選擇需被排程的Low Priority Link。根據實驗結果可以清楚地呈現出,縱使在多個FTP連線下採用所提的排程方法能夠使A2DP連線的傳輸延遲可以被有效地降低而達到確保A2DP的連線頻寬與聲音品質。而利用調整Bandwidth Debt的權重參數大小亦可達到在不同干擾下保持A2DP連線的聲音品質。根據實驗模擬結果,如果A2DP的權重調整為90時,可以滿足所有重傳次數1~4、連線數2~7的情境。在一般情形下,權重參數設定為10~15即可滿足絕大部份的連線數與干擾情境下A2DP連線的聲音品質。


    In this thesis, investigation on the issues of time bandwidth balance scheduling of Bluetooth communication from a practical applications viewpoint is discussed. Some research papers have been reported in the past on the issue of Bluetooth scheduling. However, most of them are focused on the “fairness” and transmission throughput of utilizing the Bluetooth transmission bandwidth among devices, without considering the service quality in practical applications situations. In practical applications, different Bluetooth devices require different processing and response time and service quality. Since the transmission rate in Bluetooth is not high, it would be pointless to overemphasize in transmission throughput. Whereas the major benefits of Bluetooth are convenience and low power consumptions, which means the service quality of Bluetooth seems more important than the “fairness” and transmission throughput, especially in circumstances where there are more Bluetooth connections and devices requiring high QoS, For example, the QoS in audio quality should be more important than the throughput in file transfer. That’s because the human auditory systems can clearly distinguish the difference and quality of sounds. When the connections increase, assuming that the time bandwidth allocated for each connection is not big and even not enough for the audio connections, the fairness issue in scheduling becomes less important. What’s important is how to maintain the connection bandwidth of the audio device (A2DP connection) so that the audio quality is maintained. In this thesis, a time bandwidth balance-based scheduling is proposed to solve such problem. First, participant links with Link Priority greater than 0 are selected based on a simplified formula devised to compute the Link Priority. Second, candidate links are chosen from the participant links based on a frame time criterion. Finally, a bandwidth debt for each candidate link is computed using proposed formula and is used to decide the scheduling of each candidate link. Some experiments are performed and results show that the proposed scheduling method can effectively maintain the connection bandwidth and sound quality of A2DP connection under multiple FTP connections situations. Meanwhile, by adjusting the weight of bandwidth-debt of A2DP connection, the proposed time bandwidth balance-based scheduling can tolerate severe interference circumstances (measured by the number of retransmission) and maintain the sound quality of A2DP connection (provide 300 timeslots/s for A2DP) under up to extra 6 FTP connections.

    摘要 i Abstract ii 誌謝 iv 章節目錄 v 圖目錄 x 表目錄 xiii 1 簡介 1 1.1 緣起與動機 1 1.2 研究主題背景 2 1.3 研究主題簡介 5 1.4 論文架構 5 2 藍牙系統 6 2.1 運作概念 6 2.2 核心系統架構 8 2.2.1 通道管理器 10 2.2.2 L2CAP資源管理器 10 2.2.3 裝置管理器 11 2.2.4 鏈結管理器 11 2.2.5 基頻資源管理器 11 2.2.6 鏈結控制器 12 2.2.7 射頻 12 2.3 資料傳輸架構 13 2.3.1 資料交流管道 13 2.3.2 資料交流架構實體 14 2.3.2.1 藍牙通用封包結構 15 2.4 網路架構 17 3 藍牙射頻層 18 3.1 頻帶與頻道 18 3.2 發射機特性 18 3.2.1 基本位元率 19 3.2.1.1 調變特性 19 3.2.1.2 頻率容忍 20 3.2.2 加強位元率 21 3.2.2.1 調變特性 21 3.2.2.2 頻帶內的混附發射(in-band spurious emission) 22 3.2.2.3 頻率容忍 23 4 藍牙基頻層 25 4.1 概述 25 4.1.1 藍牙計時器 26 4.1.2 藍牙裝置定址 27 4.1.3 存取碼 28 4.2 實體通道 28 4.2.1 實體通道的定義 29 4.2.2 基本微網路實體通道 29 4.2.2.1 主從關係的定義 30 4.2.2.2 跳頻特性 30 4.2.2.3 時槽 30 4.2.2.4 微網路計時器 31 4.2.2.5 傳送與接收的時序 31 4.2.3 適應微網路實體通道 34 4.2.4 呼叫掃描實體通道 35 4.2.4.1 估計計時器 35 4.2.4.2 跳頻特性 35 4.2.4.3 呼叫程序的時序 36 4.2.4.4 呼叫回應的時序 36 4.2.5 詢問掃描實體通道 38 4.2.5.1 詢問用的計時器 38 4.2.5.2 跳頻特性 38 4.2.5.3 詢問程序的時序 39 4.2.5.4 詢問回應的時序 39 4.2.6 跳頻選取 40 4.2.6.1 跳頻選取機制 40 4.2.6.2 選取器核心 43 4.2.6.3 適應選取器核心 44 4.3 實體鏈結 45 4.3.1 連線管理 45 4.4 邏輯傳輸 46 4.4.1 邏輯傳輸位址 (LT_ADDR) 47 4.5 邏輯鏈結 47 4.6 封包 48 4.6.1 封包格式 48 4.6.1.1 基本位元率 48 4.6.1.2 加強位元率 48 4.6.2 存取碼 49 4.6.3 封包標頭 49 4.7 資料處理 50 4.7.1 ARQ機制 51 4.7.2 重傳過濾 53 4.8 鏈結控制器的操作 54 5 以時間頻寬平衡為基礎的連線排程 56 5.1 Frame-based 排程 57 5.2 Frame的定義 57 5.2.1 Inquiry相關 57 5.2.1.1 INQUIRY_FRAME 57 5.2.1.2 INQUIRY_SCAN_FRAME 58 5.2.2 Page相關 59 5.2.2.1 PAGE_FRAME 59 5.2.2.2 PAGE_SCAN_FRAME 59 5.2.3 ACL相關 60 5.2.3.1 MASTER_NEW_CONN_FRAME 60 5.2.3.2 SLAVE_NEW_CONN_FRAME 61 5.2.3.3 MASTER_ACL_FRAME 61 5.2.3.4 SLAVE_ACL_FRAME 62 5.2.3.5 M2S_TDD_SW_FRAME 62 5.2.3.6 S2M_TDD_SW_FRAME 63 5.2.4 SYNC相關 63 5.2.4.1 MASTER_SCO_FRAME 63 5.2.4.2 SLAVE_SCO_FRAME 63 5.2.4.3 MASTER_ESCO_FRAME 64 5.2.4.4 SLAVE_ESCO_FRAME 64 5.3 Links與State 64 5.3.1 Links 64 5.3.1.1 Inquiry Link 65 5.3.1.2 Inquiry Scan Link 65 5.3.1.3 ACL Link 65 5.3.1.4 SYNC Link 65 5.3.1.5 Asb Link 65 5.3.1.6 Psb Link 65 5.3.2 States 66 5.3.2.1 Critical States 66 5.3.2.2 High Priority State 66 5.3.2.3 Low Priority State 66 5.4 Low priority states 66 5.4.1 Link Priority的計算 67 5.4.2 排程演算法 69 5.4.3 Adaptive Serving Interval 70 5.4.4 Concession Mode 71 6 實測驗證 73 6.1 裝置搜索 73 6.1.1 探索週遭裝置 73 6.1.2 配對 74 6.1.3 搜尋服務 75 6.2 實際測試 76 6.2.1 建立FTP連線 76 6.2.2 同時建立FTP及A2DP連線 77 6.2.3 抗干擾能力分析 78 7 結論 82 8 參考文獻 84

    [1] J. B. Lapeyrie, T. Turletti, “FPQ: a fair and efficient polling algorithm with QoS support for bluetooth piconet,” IEEE INFOCOM, Vol. 2, pp. 1322-1322, Apr. 2003.
    [2] A. Capone, M. Gerla, and R. Kapoor, “Efficient Polling Schemes for Bluetooth Picocells,” Proc. IEEE Int’l Conf. Comm. (ICC), pp. 1990-1994, Jun. 2001.
    [3] G. Zussman, A. Segall, U. Yechiali, “Bluetooth time division duplex – analysis as a polling system,” Sensor and Ad Hoc Communications and Networks, 2004.,IEEE SECON 2004, pp. 547-556, Oct. 2004.
    [4] Ait Yaiz. Rachid, Heijenk. Geert, “Polling Best Effort Traffic in Bluetooth,” Wireless Personal Communications 23, pp. 195-206, 2002.
    [5] Y. Liu, Q. Zhang and W. Zhu, “A priority-based MAC scheduling algorithm for enhancing QoS support in bluetooth piconet,” Communications, Circuits and Systems and West Sino Expositions, IEEE 2002 International Conference on, Vol. 1 , pp. 544-548, Jul. 2002
    [6] M. Kalia, D. Bansal, and R. Shorey, “Data scheduling and SAR for Bluetooth MAC," IEEE VTC, Vol. 2, pp. 716-720, May 2000
    [7] M. Kalia, D. Bansal and R. Shorey, “MAC scheduling and SAR policies for Bluetooth: a master driven TDD pico-cellular wireless system,” IEEE International Workshop on Mobile Multimedia communications, 1999 (MoMuC '99), pp. 384 –388
    [8] N. Glomie, N. Chevrollier, and I. ElBakkouri, “Intereference Aware Bluetooth Packet Scheduling,” Proc. IEEE Global TeleComm. Conf. (GLOBECOM), pp. 2857-2863, Nov. 2001.
    [9] P. Johansson,R. Kapoor, A. Kazantzidis, M. Gerla, "Rendezvous scheduling in Bluetooth scatternets", Communications, 2002. ICC 2002. pp. 318-324, Jul 2002.
    [10] L. Har-Shai, R. Kofman, G. Zussman, and A. Segall, “Interpicnoet Scheduling in Bluetooth Scatternets,” Proc. OPNETWORK Conf., Aug. 2002.
    [11] L. Har-Shai, R. Kofman, A. Segall, and G. Zussman, “Load Adaptive Interpiconet Scheduling in Small-Scale Bluetooth Scatternets,” IEEE Comm. Magazine, vol. 42, no. 7, pp. 136-142, July 2004.
    [12] N. Johansson, U. Korner, and L. Tassiulas, “A Distributed Scheduling Algorithm for a Bluetooth Scatternet,” Proc. 17th Int’l Teletraffic Congress, Sept. 2001.
    [13] R. Kapoor, A. Zanella, and M. Gerla, “A Fair and Traffic Dependent Scheduling Algorithm for Bluetooth Scatternets,” ACM Mobile Networks and Applications, vol. 9, no. 1, pp. 9-20, Feb. 2004.
    [14] M. Kazantzidis and M. Gerla, “On the Impact of Interpiconet Scheduling in Bluetooth Scatternets,” Proc. Int’l Conf. Internet Computing (IC2002), vol. 1, pp. 37-43, June 2002.
    [15] Vojislav B. Misic and Jelena v Misic, “Adaptive Interpiconet Scheduling in Small Scatternet,” ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 2, pp. 45-58, Apr. 2003.
    [16] W. Zhang and G. Cao, “A Flexible Scatternet-Wide Scheduling Algorithm for Bluetooth Networks,” Proc. 21st IEEE Int’l Performance, Computing, and Comm. Conf., pp. 291-298, 2002.
    [17] C.L. Liu and K.L. Yeung, “A simple adaptive packet scheduling scheme for Bluetooth Scatternet,” IEEE VTC 2003, Orlando, USA, Oct., 2003.
    [18] Sokullu. R., Poyraz U., “CQDDR Based Bluetooth Throughput Improvement”, 2006, In the Proceedings of ELECO 2006, pp. 116-121.
    [19] Radosveta S., Engin K., "Adaptive Packet Selection Algorithm For Bluetooth Data Packets", Proceedings of the 6th WSEAS International Conference on Applied Computer Science, Hangzhou, China, April 15-17, 2007.
    [20] A. Das, A. Ghose, A. Razdan, H. Saran and R. Shorey, “Enhancing performance of asynchronous data traffic over the Bluetooth wireless ad-hoc network,” IEEE INFOCOM 2001.
    [21] Bluetooth SIG, “Bluetooth Specification” ver.2.1 p. Core and ver 4.0, 2011.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE