簡易檢索 / 詳目顯示

研究生: 方璿
Fang, Hsuan
論文名稱: 一個具服務品質考量的可調適性微網內排程演算法之設計
The Design of An Adaptive Intra-piconet Scheduling Algorithm with QoS Consideration
指導教授: 許靜芳
Hsu, Ching-Fang
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2008
畢業學年度: 96
語文別: 英文
論文頁數: 98
中文關鍵詞: 微網輪詢序列服務時間即時資料
外文關鍵詞: polling order, service time, real-time data, intra-piconet
相關次數: 點閱:94下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 近年來無線通訊技術的發展迅速而且成熟,在眾多的無線技術中,藍芽是一個低成本、低功率消耗、低干擾的短距離無線傳輸技術。在藍芽的規範中,微網是藍芽網路中最基本的單位,微網是由一個主節點裝置以及至多七個從節點裝置所組成。由於藍芽網路的運作方式採行嚴格的主從模式,因此從節點的傳輸是被動的,所有的傳輸都必須經過主節點傳送,主節點必須決定何時開始傳輸以及傳輸需持續多久的時間。我們稱此為微網內排程。
    在本篇論文中,我們提出一個微網內排程演算法支援即時以及非即時的資料傳輸,我們使用非同步非連接連線來傳輸具有即時性要求的資料並且針對非即時性要求的資料提供排程來避免整體系統的效能降低。此外,我們利用偵測資料產生的情形來降低排程演算法的執行次數。也就是當流量變動較大的時候才將排程重新計算。

    In the recent years, the development of the wireless communication is ripe and rapid. In numerous wireless technologies, Bluetooth is low cost, low power consumption, low interference and short-range wireless communication technology and be used to replace the cable connection. In the Bluetooth specification, the piconet is a basic unit in Bluetooth network. A piconet is composed of one node which is called master and the other nodes (up to seven) called slave. Because Bluetooth operates in a strictly master-slave paradigm, the transmission of slave node is passive. All transmissions should pass through the master node, the master node need to decide when to transmit and how long the transmission continued. We call this intra-piconet scheduling.
    In this paper we proposed a scheduling algorithm which considers both real-time and non real-time traffic. We use Asynchronous Connectionless Link (ACL) to carry real-time data and support schedule on non real-time traffic to prevent the overall performance from degrading significantly. Besides, we decrease the computation overhead of our scheduling algorithm by detecting the traffic situation in the piconet. If the variation of the traffic situation is large, the schedule needs to change.

    摘要 I Abstract II List of Figures 3 List of Tables 9 Chapter 1 Introduction 6 Chapter 2 Bluetooth Overview 9 2.1 Physical Radio Layer 12 2.2 Baseband Layer 13 2.2.1 Physical Channels 14 2.2.2 Physical Links 15 2.2.3 Packet Types 15 Chapter 3 Related Work 17 3.1. Generally Practical Algorithms 18 3.2 Adaptive Polling Interval Scheduling Algorithm 20 Chapter 4 The Proposed Scheme 23 4.1 Motivation 23 4.2 Concern the QoS request 24 4.3 The issues in scheduling the common data traffic 25 4.4 Update uplink queue status 27 4.5 Decreasing the computation overhead 29 4.6 Notations 29 4.7 Polling Sequence Determination (PSD) Algorithm 30 4.8 Service Time Estimation (STE) Algorithm 32 4.9 Semi-Dynamic (SD) Algorithm 34 4.10 Hybrid SCO and ACL Traffic Scheduling (HSATS) Algorithm 35 Chapter 5 Performance Evaluation 38 5.1 Assumptions and Scenarios 38 5.3 Throughput Performance 42 5.4 Delay Performance 49 5.5 Reduce Computation Overhead 56 5.6 The Effect of AP Algorithm 63 5.7 Adjusting the Parameters 76 5.7.1 The Effect on Average Delay 76 5.7.2 The Effect on Throughput 83 5.7.3 The Affect on the Number of Activations 89 Chapter 6 Conclusion 96 Bibliography 97

    [1] Bluetooth SIG, http://www.bluetooth.com
    [2] Stands for University of Cincinnati – Bluetooth (UCBT), http://www.ececs.uc.edu/~cdmc/ucbt/ucbt.html
    [3] The Network Simulator - ns-2, http://www.isi.edu/nsnam/ns/index.html
    [4] P. Bhagwat, “Bluetooth: Technology for Short-Range Wireless Apps,” IEEE Internet Computing, May/Jun, 2001, vol. 05, no. 3, pp. 96-103.
    [5] C. Cordeiro , S. Abhyankar, D.P. Agrawal, “A dynamic slot assignment scheme for slave-to-slave and multicast-like communication in Bluetooth personal area networks,” IEEE GLOBECOM 2003, vol 7, pp. 4127-4132.
    [6] Y.S. Chang, S.C. Park, S.Y. Lee, “An enhanced throughput and QoS-aware scheduling policy for Bluetooth,” IEEE WCNC 2004, vol. 2, pp. 1004-1007.
    [7] O. Fabian, H. Levy, “Polling System Optimization through Dynamic Routing Policies,” IEEE INFOCOM 1993, vol. 1, pp. 194-200.
    [8] J.C. Haartsen, “BluetoothTM: a new radio interface providing ubiquitous connectivity,” IEEE VTC 2000, vol. 1, pp. 107-111.
    [9] J.C. Haartsen, “The Bluetooth radio system,” IEEE IPC 2000, vol. 7, no. 1, pp. 28 -36.
    [10] C.F. Hsu, C.Y. Liu, “An Adaptive Traffic-aware Polling and Scheduling Algorithm for Bluetooth Piconets,” Technical Report of Nation Chang Kung University, Department of Computer Science and Information Engineer, July 2007.
    [11] P. Johansson, N. Johansson, U. Korner, J. Elg, G. Svennarp, “Short range radio based ad-hoc networking: performance and properties,” IEEE ICC 1999, vol. 3, pp. 1414-1420.
    [12] M. Kalia, D. Bansal, R. Shorey, “Data scheduling and SAR for bluetooth MAC,” IEEE VTC 2000, vol. 2, pp. 716 -720.
    [13] Y.Z. Lee, R. Kapoor, M. Gerla, “An Efficient and Fair Polling Scheme for Bluetooth,” IEEE MILCOM 2002, vol. 2, pp. 1062-1068.
    [14] Z. Liu, P. Nain, D. Towsley, “On Optimal Polling Policies, Queuing Systems,” vol. 11, pp. 59-83, 1992.
    [15] J. Mišić, V.B. Mišić , “Modeling Bluetooth piconet performance,” IEEE LCOMM 2002. vol. 7, issue 1, pp. 18-20.
    [16] V.B. Mišić, J. Mišić, K.L. Chan “Improving the performance of Bluetooth piconets with synchronous and asynchronous traffic,” IEEE GLOBECOM 2003, vol. 1, pp.205-209
    [17] V.B. Mišić, E.W.S. Ko, J. Mišić, “Adaptive cycle-limited scheduling scheme for Bluetooth piconets,” IEEE PIMRC 2003, vol. 2, pp. 1064-1068.
    [18] V.B. Mišić, E.W.S. Ko, J. Mišić, “Load and QoS-adaptive scheduling in Bluetooth piconets,” IEEE HICSS 2004, pp. 1-8.
    [19] M. Ma, S.Y. Low, “Supporting real-time service in Bluetooth networks,” IEEE HPSR 2005, pp.167-171.
    [20] J. Mišić, V.B. Mišić, E.W.S. Ko, “Fixed Cycles and Adaptive Bandwidth Allocation Can Coexist in Bluetooth,” IEEE CJECE 2004, vol. 9, no. 1-2, pp. 135-147.
    [21] S. Zilrbes, W. Stahl, K. Matheus, J. Haartsen, “Radio Network Performance of Bluetooth,” IEEE ICC 2000, vol. 3, pp. 1563-1567.

    下載圖示 校內:2010-08-27公開
    校外:2010-08-27公開
    QR CODE