A New Bluetooth Scatternet Construction Algorithm Based On Capabilities Of Actual Devices

Bluetooth is an open specification for short-range wireless data and voice communication and has received great attention recently. One of its important applications is to construct wireless ad hoc network.However, Bluetooth specification only defines the construction of piconet topology and can't supply any standard specifications for scatternet topology. It is hard to satisfy the requirement of forming wireless network among more than eight devices. So many bluetooth scatternet formation algorithms are proposed. These algorithms follow a same research pattern. They don't take the capabilities of actual devices into consideration. They abstract different bluetooth devices as uniform nodes and distribute roles to devices at random. In fact, the capabilities of bluetooth devices are diverse. The requirements of different roles for the capabilities of devices are various. If an algorithm ignores such differences, the performance of the scatternet may be far away from the expectation when the algorithm actually works. It is hard to ensure the feasibility of the algorithm.This thesis analyses the technical characters, application future and research situation of Bluetooth in detail. To solve the problem of the research pattern followed by the existing bluetooth scattemet formation algorithms, an idea is proposed that scatternet should be constructed based on the capabilities of actual devices. The idea asks algorithms to distribute appropriate roles according to their capabilities and makes the best use of everything. Such idea combines algorithms with applications firmly and improves their rationalities and feasibilities. On the basis of the idea, the thesis improves BTCP Algorithm. The simulation has proved the idea greatly improves the rationality and stability of the scatternet. The thesis also puts forward a new distributed scatternet construction algorithm - Saturation Algorithm. The algorithm has such advantages: Devices with great capabilities act as Master and Bridge; Every piconet tries to achieve the link saturation in order to decrease the number of piconets; The number of M/S Bridges is well controled; Devices can communicate locally earlier. It is proved by the theoretic analysis and simulation results that the new algorithm has chosen devices with great capabilities to act as Master and Bridge and it outperforms other algorithms in aspects of the number of piconets, roles acted by a device, M/S Bridges and forming scatternet time.