| Summary: | 碩士 === 國立中央大學 === 資訊工程研究所 === 90 ===
Bluetooth has a master-slave configuration, called a piconet. Since all communications must go through masters, the polling policy adopted by a master significantly influences the bandwidth utilization of a piconet. In this thesis, we focus on Bluetooth data links and propose an efficient Pattern Matching Polling (PMP) policy for link scheduling. For each master-slave pair, by estimating both sides'packet arrival rates, the master judiciously selects a polling pattern that can best utilize the network bandwidth. A pattern is a sequence of Bluetooth packet types (DH1/DH3/DH5/DM1/DM3/DM5) to be used by the master and slave to exchange information. Based on the selected pattern, the master then polls the slave with proper packet types at proper time slots. In return, the slave also replies with proper packet types. The ultimate goal is to reduce the number of NULL packets and unfilled payloads so as to increase bandwidth efficiency, which is defined as the average payload being transmitted per non-empty slot. The policy is also extended for use in a multi-link environment where a master has more than one slave. Simulation experiments demonstrate that the proposed PMP policy improves bandwidth efficiency and network throughput at the expense of moderate packet delays, compared to the naive greedy solution.
|
|---|
