An On-Demand Routing Strategy for Wireless Network of Master-Driven Subnetworks: Taking Bluetooth Scatternet for example

碩士 === 國立臺灣大學 === 資訊管理研究所 === 89 === Wireless networking related researches are more and more popular today. Personalized digital devices make WPAN(Wireless Personal Area Network) related topics more important, and Bluetooth appears in a result. Generally, Bluetooth can support wireless c...

Full description

Bibliographic Details
Main Authors: Shen-Hsu Chen, 陳甚旭
Other Authors: Yuh-Jzer Joung
Format: Others
Language:zh-TW
Published: 2001
Online Access:http://ndltd.ncl.edu.tw/handle/00189058946629568813
Description
Summary:碩士 === 國立臺灣大學 === 資訊管理研究所 === 89 === Wireless networking related researches are more and more popular today. Personalized digital devices make WPAN(Wireless Personal Area Network) related topics more important, and Bluetooth appears in a result. Generally, Bluetooth can support wireless communications of any two devices within 10 meters, forming a star-topology network, instead of peer to peer communication. Bluetooth also provides scatternets to let any two devices keep connected when their distance is more than 10 meters. When building connection between devices in the scatternet environment, we have to find the route from the sender to the receiver by some routing algorithm. Most of the existed routing algorithms only take the minimum delay from the sender to the receiver into consideration when selecting the best route for them. We found that Bluetooth piconet is master-driven network, which has some characteristics different from the traditional wired network, i.e. internet. At the same time, we also fount that some real-world applications, such as database queries or look-up services, may concern more about the round-trip delay between the sender and the receiver, instead of the one way minimum delay from the sender to the receiver. So first, we prove that in bluetooth scatternet environment, one way minimum delay does not mean round-trip minimum delay. Then we propose two new approaches, sender decides and receiver decides, which select the best route based on the minimum round-trip delay, and we compare these two approaches with the existed approach. Both of our approaches are theoretically better than the existed one, no matter in round-trip delay or in route setup time, when taking no network congestion into consideration. Such results show its meanings in both research and practical use. Hoping that the following researchers can test its performance in real-world environment for further study.