Responsive image
博碩士論文 etd-0112105-093644 詳細資訊
Title page for etd-0112105-093644
論文名稱
Title
可調式藍芽聯網建構演算法
An Adaptive Scatternet Formation Scheme in Bluetooth Personal Area Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
92
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2004-12-21
繳交日期
Date of Submission
2005-01-12
關鍵字
Keywords
微網、聯網、藍芽
scatternet, Bluetooth, piconet
統計
Statistics
本論文已被瀏覽 5669 次,被下載 12
The thesis/dissertation has been browsed 5669 times, has been downloaded 12 times.
中文摘要
藍芽是一具有低功率和低成本的新興短距離且無線的通訊技術,主要是用來取代有線的設備。雖然藍芽是公開的規格,其MAC協定層也是特別設計用來促進ad hoc網路的形成,但是在規格中,卻未對聯網的建立提出解決的方案。因此,目前已有許多學者發表各種形成聯網的方法,但這些方法大都定義在靜態的環境下。在這篇研究中,我們提出一個適用於動態環境的藍芽聯網建構方法,稱為可調式藍芽聯網建構演算法(Adaptive Scatternet Formation Scheme,ASFS)。此演算法由兩部分所組成:建構和維護。在建構藍芽聯網這一部份,聯網中的Coordinator根據抵達率以及離開率得知目前整個聯網的流量狀態,並且依照目前及過去網路的流量狀態指派下一個週期中抵達網路的節點一個適當的角色(Sub-coordinator、Master或Slave),並將其分配給適合的微網。在維護機制中,由於ASFS適用在動態的環境下,亦即允許節點可隨意的進入與離開聯網,因此,ASFS能夠擴張網路拓樸、修復因節點離開而分裂的網路拓樸、動態地調整整個聯網,以盡可能的保持最少的微網個數。在模擬實驗中,我們使用網路模擬器(NS-2)的延伸模組來模擬各項表現。我們分析節點在各種抵達狀態的預測結果,並且和同樣適用在動態環境的TSF演算法比較,發現ASFS演算法在傳送封包的時間和聯網內的微網個數皆有較佳的表現,在建構聯網的時間上亦反應出平行建構的優點。
Abstract
Bluetooth is a highly promising, low-cost, and low-power technology for short-range wireless communication. It is intended to replace existing cables between electronic devices. Bluetooth is an open specification. Even whose MAC protocol is designed for facilitating the construction of ad hoc networks, the issue of scatternet formation is left open in the Bluetooth Specification. Several researchers have proposed various solutions to form a scatternet. But most of them focused on static environment. This investigation presents an Adaptive Scatternet Formation Scheme (ASFS) for forming a scatternet for Bluetooth devices. Unlike earlier work, the proposed method is designed to work with dynamic environment where nodes can arrive and leave arbitrarily. ASFS consists of two parts, formation and maintenance. In formation, a coordinator is used to monitor the flow of nodes (arriving and leaving). This information is then used to assign the new arrival node a suitable role (Sub-coordinator, Master or Slave) to establish the link and assign it to an appropriate piconet. In maintenance, nodes are allowed to arrive and depart arbitrarily. The proposed method can incrementally extend the topology and heal the partitions of scatternet due to nodes arriving or missing. It dynamically adjusts the scatternet to minimize the number of piconets. We employed the Network Simulator, NS-2, as the simulation and analyzed the predicted results when nodes arrive in various conditions. The simulation result demonstrates that ASFS achieves better results than TSF (Tree Scatternet Formation, the algorithm is proposed by Tan et al.[17] and works well in dynamic environment) in packet transmission time and number of the piconets. The scatternet formation time reflects the advantage of parallel formation.
目次 Table of Contents
目錄
中文摘要 I
英文摘要 III
目錄 V
圖目錄 VIII
表格目錄 XI
第一章 緒論 1
1.1 論文動機與目的 1
1.2 藍芽技術簡介 2
1.2.1 藍芽技術發展背景 3
1.2.2 無線電(Radio) 4
1.2.3 藍芽連接(Link)類型之定義 5
1.2.4 藍芽裝置定址 6
1.2.5 藍芽裝置狀態種類 7
1.2.6 連線建立之程序 10
1.2.7 微網(Piconet)與聯網(Scatternet) 13
1.3 論文架構 14
第二章 相關研究文獻 15
第三章 可調式藍芽聯網建構演算法 26
3.1 網路拓樸架構與環境假設前提 26
3.1.1 架構模型 26
3.1.2 環境假設 30
3.2 可調式藍芽聯網建構演算法 31
3.2.1 各節點角色的說明 31
3.2.2 偵測並評估抵達的節點 32
3.2.3 新抵達節點的指派 37
3.3 維護機制 41
3.3.1 在網路元件內微網間的維護機制 41
3.3.2 在網路元件中微網內的維護機制 44
第四章 模擬分析 48
4.1 在各種節點抵達情況下α值的評估 48
4.1.1 節點的抵達呈Poisson分布 49
4.1.2 節點的進入呈現常態分布 54
4.1.3 節點以固定的抵達率進入聯網(Constant Bite Rate) 58
4.1.4 節點以隨機的方式進入聯網 63
4.2 藍芽聯網建構時間 66
4.3 平均的傳送時間 71
4.4 平均的微網個數 73
第五章 結論 75
參考文獻 77
參考文獻 References
[1]. S. Basagni and C. Petrioli, “Multihop scatternet formation for Bluetooth networks,” in Proceedings of the IEEE Semiannual Vehicular Technology Conference, (VTC 2002), Boston, USA, Vol. 1, May 2002, pp. 424-428.
[2]. Bluehoc: Bluetooth Performance Evaluation Tool, http://oss.software.ibm.com/developerworks/opensource/bluehoc/, 2001.
[3]. J. Bray and C. F. Sturman, Bluetooth: connect without cables. Prentice Hall, 2001.
[4]. C.-C. Foo and K.-C. Chua, “Bluerings – bluetooth scatternets with ring structures,” in Proceedings of IASTED International Conference on Wireless and Optical Communication (WOC2002), Canada, July 2002, pp. 50-57.
[5]. T.-C. Huang, C.-S. Yang, C.-C. Huang, and S.-W. Bai, “Hierarchical Grown Bluetrees (HGB) - An Effective Topology for Bluetooth Scatternets,” in Proceedings of 2003 International Symposium on Parallel Processing and Applications (ISPA 2003), Japan, July 2003, pp. 152-164.
[6]. C. Law, A. K. Mehta, and K.-Y. Siu, “Performance of a New Bluetooth Scatternet Formation Protocol,” in Proceedings of ACM Mobile Ad Hoc Networking and Computing (MoblHoc), USA, October 2001, pp. 183-192.
[7]. C. Law and K.-Y. Siu, “A Bluetooth scatternet formation algorithm,” in Proceedings of the IEEE Symposium on Ad Hoc Wireless Networks 2001, San Antonio, USA, vol.5, Nov. 2001, pp. 2864-2869.
[8]. X. Luo, B. Li, I. L.-J. Thng, Y.-B. Lin, I. Chlamtac, “An adaptive measured-based preassignment scheme with connection-level QoS support for mobile networks,” IEEE Transactions on Wireless Communications, vol. 1, July 2002, pp. 521-530.
[9]. NS-2 Network Simulator, http://www.isi.edu/nsnam/ns/, 1989.
[10]. K. Persson, D. Manivannan and M. Singhal, “Bluetooth Scatternet Formation: Criteria, Models and Classification,” in Proceedings of the IEEE Consumer Communications and Networking Conference (CCNC 2004), Las Vegas, USA, Jan. 2004, pp. 59-64.
[11]. C. Petrioli, S. Basagni, and I. Chlamtac, “Configuring BlueStars: Multihop scatternet formation for Bluetooth networks,” IEEE Transactions on Computers, vol.52, June 2003, pp. 779-790.
[12]. L. Ramachandran, M. Kapoor, A. Sarkar, and A. Aggarwal, “Clustering algorithms for wireless ad hoc networks,” in Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Boston, USA, Aug. 2000, pp. 54–63.
[13]. T. Salonidis, P. Bhagwat, L. Tassiulas, and R. LaMaire, “Distributed topology construction of Bluetooth personal area networks,” in Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Computer and Communication Societies, (the IEEE Infocom 2001), vol.3, April 2001, pp. 1577– 1586.
[14]. T. Sato and K. Mase, “A Scatternet Operation for Bluetooth Ad Hoc Networks”in Proceedings of the 5th International Symposium on Wireless Personal Multimedia Communications, 2002, Vol.1, Oct. 2002, pp. 223-227.
[15]. R. Shorey, B.A. Miller, “The bluetooth technology: merits and limitations,” in Proceedings of IEEE International Conference on Personal Wireless Communications 2000, Dec. 2000, pp. 80-84.
[16]. Specification of the Bluetooth System, Version 1.2, http://www.bluetooth.com, Nov. 2003.
[17]. G. Tan, “Blueware: Bluetooth Simulator for ns,” MIT Technical Report, MIT-LCS-TR-866, USA, Oct. 2002.
[18]. G. Tan, A. Miu, J. Guttag and H. Balakrishnan, “An Efficient Scatternet Formation Algorithm for Dynamic Environments,” in Proceedings of IASTED Communication and Computer Networks (CCN), Nov. 2002, pp. 527-536.
[19]. Z. Wang, R.J. Thomas, and Z.J. Haas, “Bluenet-a new scatternet formation scheme,” in Proceedings of 35th Hawaii International Conference on System Science (HICSS-35), Big Island, Hawaii, Jan. 2002, pp. 61-69.
[20]. S.-F. Yang, T.-C. Huang, C.-S. Yang and S.-W. Bai, “A Self-determinant Scatternet Formation Algorithm for Multi-hop Bluetooth Networks,” in Proceedings of the 2003 International Conference on Parallel Processing Workshop (ICPP 2003 Workshops), Kaohsiung, Taiwan, ROC, October 2003, pp. 289-298.
[21]. G. Z´aruba, S. Basagni, and I. Chlamtac, “Bluetrees —scatternet formation to enable Bluetooth-based personal area networks,” in Proceedings of the IEEE International Conference on Communications 2001, Helsinki, Finland, June 2001, pp. 273-277.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內一年後公開,校外永不公開 campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 3.142.255.189
論文開放下載的時間是 校外不公開

Your IP address is 3.142.255.189
This thesis will be available to you on Indicate off-campus access is not available.

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

QR Code