無線藍芽網路之繞徑及群播協定

Bluetooth是一種短距離無線通訊的技術，並具有低耗電量、低成本及體積小等特性。本論文擬在藍芽網路中發展繞徑及群播通訊協定。首先，在繞徑通訊協定此議題上，本論文提出一個位置感知的繞徑協定(LAMP)，利用位置資訊動態調整散網架構、縮短繞徑長度及建立備份繞徑，以同時達到省電及高效能傳輸之目的。之後，本論文亦提出繞徑維護演算法(ROMA)，以保證藍芽裝置的連結、重建繞徑並減少繞徑長度。另一方面，在群播通訊協定此議題上，為了在藍芽網路提供群播服務，建立一個群播樹以提供群播訊息給所有的群播成員，將可減少網路延遲及節省頻寬與電量消耗，然而，礙於藍芽通訊協定的限制，一個現有的散網拓撲可能不適合建構一個有效的群播樹，這將造成電量消耗及傳輸延遲。因此，本論文提出一個二層式的群播樹通訊協定(TMCP)，利用角色轉換技術以建構有效的群播樹，使得群播樹的高度及傳輸延遲可以被減少。由實驗的數據顯示，本論文所提出的協定能有效縮短繞徑長度、重建繞徑、提供良好的郡播服務、減少網路延遲及提高頻寬使用率。

關鍵字

藍芽；無線個人區域網路；位置感知；繞徑協定；群播樹

並列摘要

Bluetooth is a low power, low cost, and short-range wireless technology developed for personal area networks. This thesis aims at developing routing and multicasting communication protocols for Bluetooth radio networks. In the routing issue, this thesis firstly presents a Location Aware Mobility based routing Protocol (LAMP), which considers location information of the devices to minimize the number of hop of the route between any source and destination and constructs the backup path to prevent the route from failure raised due to the mobility of devices. Next, we propose a novel ROute Maintenance Algorithm (ROMA) for guaranteeing the connectivity among devices, reconstructing the routes dynamically, and reducing the path length based on the location information and mobility of devices. In the multicasting issue, this thesis proposes a Two-layer Multicast Communication Protocol (TMCP) using role switching techniques for constructing an efficient multicast tree is developed. In order to provide multicast services in the multicasting issue, constructing a multicast tree can serve the delivery of multicast messages for all multicast members so that the propagation delay is reduced and the bandwidth and energy consumption are saved. However, due to the constrain of Bluetooth protocol, a given connected scatternet topology may not be appropriate for constructing an efficient multicast tree and hence causes energy consumption and end-to-end delay. The proposed TMCP collects as many as possible the members into the same piconet, reduces the length of multicast paths and assigns each member with a proper role. The constructed multicast tree has several features, including as few as possible the non-member devices, the smallest tree level and the minimal propagation delay. Experimental results show that our protocols can efficiently construct the shortest routing paths, reestablish the routing paths, offer multicast service and outperform in terms of the transmission delay, bandwidth and energy consumption as compared to the other protocols that we have considered.

並列關鍵字

Bluetooth ； Wireless Personal Area Network ； Location Aware ； Routing Protocol ； Multicast Tree

參考文獻

[1] The Bluetooth Specification, http://www.bluetooth.org.

[3] G. J. Yu, C. Y. Chang, K. P. Shih and S. C. Lee, "Relay Reduction and Disjoint Routes Construction for Scatternet over Bluetooth Radio Systems," Journal of Network & Computer Applications, vol. 30, Apr. 2007, pp. 728-749.

[4] C. Perkins and P. Bhagwat, “Destination Sequenced Distance Vector Routing for Mobile Computers,” in Proc. of the ACM SIGCOMM, Sep. 1994.

[6] S. Giordano, I. Stojmenovic and L. Blazevic, “Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy,” In Ad Hoc Wireless Networking, Kluwer Academic Publishers, 2003.

[8] M. Sun, C. K. Chang and T. H. Lai, “A Self-Routing Topology for Bluetooth Scatternets,” in Proc. of the International Symposium on Parallel Architectures, May 2002.

國際替代計量

無線藍芽網路之繞徑及群播協定

全文下載

主題瀏覽