Responsive image
博碩士論文 etd-0823105-152437 詳細資訊
Title page for etd-0823105-152437
論文名稱
Title
在藍芽MAC層中兼具考慮Uplink和Downlink 佇列的輪詢方法
A Polling Scheme for Bluetooth Piconets Considering on Both Uplink and Downlink Queues
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
69
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2005-07-15
繳交日期
Date of Submission
2005-08-23
關鍵字
Keywords
微網、藍芽、輪詢
polling, piconet, bluetooth
統計
Statistics
本論文已被瀏覽 5685 次,被下載 2431
The thesis/dissertation has been browsed 5685 times, has been downloaded 2431 times.
中文摘要
藍芽(Bluetooth) 是一種低成本,低複雜性,低功率消耗,運作於2.4GHz 頻段的短距離無線通訊網路。近年來,為了改善藍芽在非對稱性系統傳輸的效能(Performance),陸續有一些學者提出輪詢的方法(Polling Schemes)。這些輪詢方法的機制中,有些是考慮以downlink queue 的狀態來做排程(Scheduling),而有些是以uplink queue的狀態為依據來做排程。為了維持藍芽微網(piconets)中的公平性並提升其系統效能,在本文中,我們提出了一種新的輪詢演算法稱為UDPS-Uplink and Downlink queues Polling Scheme,同時考慮這兩種佇列(queue)的狀態來做排程。在模擬實驗部份,我們證實了UDPS和其它常見的幾種輪詢方法中做比較,確實可改進系統的點對點延遲時間(end-to-end delay),並且提高整體系統的效能。
除了UDPS外,其他方法都遇到相同問題就是;具有同一個特定目的端的Slave數目越多(n值越大)時,其延遲情況越嚴重,且穩定性不佳。然而,在UDPS之運作下的delay只稍微地增加(穩定性佳),因為在UDPS的Part B演算法中,有針對此種情況做改善。在throughput表現方面,UDPS接近LWRR,且優於其他的方法,但從穩定度的角度來探討,UDPS卻優於LWRR及ERR,因為由實驗結果中,圖二十四、圖二十八、和圖三十二分別表示ON/OFF比率為由小到大,從這三個圖中看出,在ON/OFF為1:2時,LWRR的throughput最高,而ERR與UDPS次之,而隨著ON/OFF比率越來越大,LWRR的throughput下降幅度卻比ERR高,造成在ON/OFF比率大時,ERR的throughput超越了LWRR,然而UDPS下降幅度卻不高,由此可見,不管ON/OFF比率是由小到大或由大到小,UDPS一直可以保持不錯的穩定性,UDPS為了也要維持公平性,在Part A演算法部分,每個Slave將至少會有被輪詢一次的機會,所以UDPS用犧牲掉少許的throughput來滿足公平性,因此,其throughput才會稍微略低於LWRR。
Abstract
Bluetooth is a low cost, low power consumption, short-range radio technology working on the 2.4 GHz frequency band. Recently, several typical polling schemes have been presented to enhance the performance on asymmetric transmissions between the master and slave. However, such polling algorithms consider only either the uplink queue or the downlink queue state for scheduling. In this paper, we propose an algorithm for Bluetooth Piconets scheduling, called the Uplink and Downlink queue Polling Scheme (UDPS). The goal of this scheduling algorithm is to alleviate the wasted bandwidth by diminishing the visit to inactive slaves. Distinguishing from previous polling schemes that have been proposed, this algorithm considers on both uplink and downlink queue states for increasing the throughput and reducing the delay time of the piconets communication.
This study proposes UDPS, a new Polling Scheme for Bluetooth piconets addresses both Uplink and Downlink queues, considering to remain fair and efficient in asymmetric flow rates. Simulations confirm that the performance of the UDPS compares favorably with that of traditional polling approaches.
目次 Table of Contents
中文摘要…………………………………………………………………I
英文摘要……………………………………………………..……….…II
目錄...…………………………………………………………………...III
圖目錄…………………………………………………………………..VI
表格目錄……………………………………………………...........…VIII
第一章 簡介……………………………………………………………1
1-1 設備位址(Device Addressing)……………………………...5
1-2 實體通道(Physical Channel)……………………………….6
1-3 微網(piconet)與分散網(Scatternet)………………………..7
1-4 資料傳輸型態…………………………..……………...........9
1-5 Bluetooth封包之結構與分析…………………………......10
1-6 藍芽設備的工作狀態…………………………………........14
第二章 相關研究……………………………………………………..18
2-1 理想排程………………………………………...……..….19
2-1.1 Priority Policy (PP) Scheme…………………….....19
2-1.2 K-Fairness Policy (KFP) Scheme……………….…20
2-1.3 PP Scheme with SCO Link……………………..….20
2-1.4 BM LQF Limited (Benchmark-Longest Queue First Limited Service)……………………………...…….22
2-2 實際排程……………………………………...………......22
2-2.1 Pure Round Robin (RR/PRR)…………………….. 23
2-2.2 Exhaustive Round-Robin (ERR)…………………...23
2-2.3 Limited Round Robin (LRR)……………….……...23
2-2.4 Limited and Weighted Round Robin (LWRR).........24
2-2.5 Longest Downlink Queues First (LDQF)……….....24
2-2.6 Exhaustive Pseudo-cyclic Master queue length (EPM)…………………………………………........24
2-2.7 Exhaustive Round-Robin According to Master Queues(MERR)……………………………………25
2-2.8 Exhaustive Round-Robin According to Slave Queues (SERR)……………………………………………..25
第三章 UDPS輪詢演法………………………………………….......26
3-1 研究動機………………………………………………......26
3-2 問題探討………………………………………….…….....28
3-3 兼具考慮Uplink和 Downlink queue的輪詢演算法(UDPS)……………………………………………………..34
3-3.1 參數定義及功能……………… …………….….... .34
3-3.2 UDPS演算法………………………………….…...36
第四章 實驗結果與分析……………………………………….....….40
4-1 隨著Slave連線數及ON/OFF比例變化之Throughput評估…………………………………………………….….....44
4-2 平均點對點延遲時間(Average End-to-End Delay Time)的評估………………………………………………...…..….51
4-3 多個Slave擁有共同目的節點之Average Delay Time評估………………………………………………..….……...53
第五章 結論………………………………………….…………..…...55
參考文獻………………………………………………………….....….56

圖目錄
圖一: 一個三合一手機的應用子……………………………………2
圖二: Wireless Personal Area Network……………………………....3
圖三: Bluetooth的通訊協定階層…………………………………....4
圖四 : BD_ADDR 之格式…………………..……………….……….5
圖五 : Master與Slave間以TDD的方式建立一條實體通道……....6
圖六 : 多個時槽封包所需的時槽時間…………………………….…7
圖七 : 微網與分散網之topology………………………………….….8
圖八 : 一個Scatternet中四種Bluetooth節點的角色……………..…8
圖九 : ACL連線利用SCO連線間的時槽傳輸資料之範例……...…9
圖十 : ACL Link Packet Format………………………………………10
圖十一 : SCO Link Packet Format……………………………….......11
圖十二 : Payload Format………………………………………….....11
圖十三 : 工作狀態轉換示意圖………………………………...……14
圖十四 : A single piconet and its queuing model…………..………..17
圖十五: Master 端的MAC 排程結構……………………….……..18
圖十六: PP Scheme with SCO Link…………………………….……21
圖十七: 多個slave擁有共同的目的端之拓樸圖(一)………………29
圖十八: 多個slave擁有共同的目的端之拓樸圖(二)………………31
圖十九 : 一個由7個piconets所組成的scatternet………………...33
圖二十: The function of t to maintain the downlink queue length..................................................................................35
圖二十一 : UDPS之狀態轉換圖……………………………………39
圖二十二: 簡單的NS-2架構………………………….…………….42
圖二十三: NS-2 中C++與Otcl 物件架構關係……………..……..42
圖二十四: ON/OFF 比例為1:2的Throughput……………………..47
圖二十五: ON/OFF 比例為1:3的Throughput………………….….47
圖二十六: ON/OFF 比例為1:4的Throughput…………………..…48
圖二十七: ON/OFF 比例為1:5的Throughput……………………..48
圖二十八: ON/OFF 比例為1:6的Throughput……………………..49
圖二十九: ON/OFF 比例為1:7的Throughput……………………..49
圖三十 : ON/OFF 比例為1:8的Throughput……………………..50
圖三十一: ON/OFF 比例為1:9的Throughput……………………..50
圖三十二: ON/OFF 比例為1:10的Throughput…………………....51
圖三十三: 平均點對點延遲時間……………………………………..52
圖三十四 : 多個Slave擁有共同目的節點之平均延遲時間……..….54



表格目錄
表一 : Packets defined for SCO and ACL link Types…….………….13
表二 : 參數定義……………………………………………..………....34
參考文獻 References
[1] Bluetooth Special Interest Group, Specification of the Bluetooth System. Version 1.2, Nov. 2003.
[2] A. Capone, R. Kapoor, and M. Gerla, “Efficient Polling schemes for Bluetooth picocells,” in Proceedings of IEEE International Conference on Communications ICC 2001, vol. 7, Helsinki, Finland, June 2001, pp. 1990–1994.
[3] Ka Lok Chan, Vojislav B. Mišić, and Jelena Mišić, “Efficient Polling Schemes for Bluetooth Picocells Revisited,” in Proceedings of 37th Annual Hawaii International Conference on System Sciences, Big Island, Hawaii, Jan. 2004, pp. 307–314.
[4] Indraneel Chakraborty, Abhishek Kashyap, Anupam Rastogi Huzur Saran, Rajeev Shorey and Apurva Kumar, “Policies for Increasing Throughput and Decreasing Power Consumption in Bluetooth MAC,” in Proceedings of IEEE International Conference on Personal Wireless Communications, Dec. 2000, pp. 90–94.
[5] N. Johansson, U. Körner, and P. Johansson, “Performance evaluation of scheduling algorithms for Bluetooth,” in Proceedings of BC’99 IFIP TC Fifth International Conference on Broadband Communications, Hong Kong, Nov. 1999, pp. 139–150.
[6] M. Kalia, D. Bansal, and R. Shorey, “MAC scheduling and SAR policies for Bluetooth: A Master driven TDD pico-cellular wireless system,” in Proceedings of Sixth IEEE International Workshop on Mobile Multimedia Communications, San Diego, CA, Nov. 1999, pp. 384–388.
[7] M. Kalia, D. Bansal, R. Shorey, “Data scheduling and SAR for Bluetooth MAC”, in Proceedings of IEEE Vehicular Technology Conference, Tokyo, May. 2000, pp. 716–720
[8] Z. Liu, P. Nain, and D. Towsley, “On optimal Polling policies,” Queueing Systems Theory and Applications, vol. 11, no. 1–2, pp. 59–83, 1992.
[9] Jelena Mišić and Vojislav B. Mišić, “Modeling Bluetooth Piconet performance, "in Proceedings of IEEE Communication Letters, vol. 7, Jan. 2002, pp. 18–20.
[10] Vojislav B. Mišić and Jelena Mišić, “Polling and Bridge Scheduling Algorithms in Bluetooth,” Technical Report TR 03/04, Department of Computer Science, University of Manitoba Winnipeg, Manitoba, Canada, Sep. 2003.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內外都一年後公開 withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code