English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 46867/50733 (92%)
造訪人次 : 11871642      線上人數 : 351
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    主頁登入上傳說明關於CCUR管理 到手機版


    請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/22049


    題名: New Bluetooth Scatternet Formation for Scalable Spaced Dynamic Environment
    作者: 鄭昇宏
    周立平
    許清琦
    貢獻者: 工學院
    日期: 2005-06-01
    上傳時間: 2012-04-18 16:02:00 (UTC+8)
    摘要: 藍芽已成為短距離無線通訊傳輸的新興技術,由於採用跳頻及分時多工的技術,使得兩個藍芽裝置須經過同步後才能做資料的傳輸。意即,即使兩個藍芽裝置彼此皆在通訊範圍內,也無法立刻做資料的傳輸,必須透過同步的機制使彼此之間有主僕關係,才能夠做資料的傳輸。此外藍芽網路是透過將多個Piconet組織而成的網路拓樸,稱之為Scatternet。藍芽Scatterent拓樸將會影響藍芽網路傳輸效能,因此建構藍芽拓樸網路-Scatternet,便成為一項重要的研究課題。目前多數的建構演算法都無法處理動態環境,及受限於十公尺範圍。然而在無線通訊的環境下,無線裝置的行為幾乎都是動態,裝置隨時都可能進入或離開網路,此外無線裝置彼此間的距離是不應受範圍限制的。即使兩個裝置不在彼此的通訊範為也應該能夠透過第三者傳遞資料。因此在這篇論文中,我們提供了一個建構藍芽網路拓樸的方法,其可以適用於動態環境,且不受範圍的限制。此外在這篇論文中,我們將藍芽網路拓樸-Scatternet建成樹的結構,使得在這樣的網路中容易去做資料的路徑建制。

    Bluetooth is a promising new wireless technology for short-range wireless communication. It is based on a frequency hopping physical layer and time division multiplexing technology. This fact implies that even nodes are within direct communication radio range of each other, only those nodes which are synchronized with each other can communicate. Bluetooth ad hoc networks are based on connecting several piconets into scatternet. The way by which scatternet is formed and the structure of scatternet will have a tremendous impact on the performance of the network. The issue of scatternet formation has been addressed by a number of papers in the technical literature. Most of those papers limit the Bluetooth ad hoc network range in 10 meters and are not appropriate for dynamic environment. In mobile environment, the behavior of mobile device can't be predicted; mobile device could join in and leave out the network arbitrarily. In this paper we present a scatternet formation protocol for dynamic environment and scaled space. The construction of scatternet requires no knowledge on the underlying physical topology and nodes can join in and leave out arbitrarily. If the physical topology is weakly connected, then the algorithm guarantees that the resulting topology will be connected. Our algorithm constructs scatternet into a tree structure that simplifies packet routing and scheduling. We also present simulation results that show our algorithm has low scatternet formation latency and also generates an efficient topology for forwarding packets.
    關聯: 華岡工程學報 19期 p.111 -133
    顯示於類別:[工學院] 學報-華岡工程學報

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML224檢視/開啟


    在CCUR中所有的資料項目都受到原著作權保護.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋