Research On Network Topology Construction And Scheduling Algorithms For Bluetooth Ad Hoc Personal Area Networks

Bluetooth is a de facto global standard for short-range wireless data and voice communication. It enables easily various personal data devices to have wireless communication function since it has many intriguing characteristics, such as low cost, low power, small size, free spectrum and short-range communication. It will be widely deployed in different fields.Bluetooth ad hoc personal area network is an independent wireless network composed of Bluetooth-enabled mobile devices, which can freely communicate and collaborate with each other in some area without extra infrastructure. This kind of network will change our way of dealing with and storing information in the near future and has promising perspective of wide applications. Before it becomes reality, many challenging issues should be addressed. The main issues are Bluetooth scatternet formation, routing, scheduling and access point handoff. The research in these areas is theoretically and practically important.The thesis delves into Bluetooth ad hoc personal area network, analyzes and compares the main algorithms and schemes of these issues researchers have currently presented, puts forwards a series of related algorithms and schemes, and analyzes their performances and validates them with simulations.The constraints and characteristics of Bluetooth scatternet present great challenges in efficiently constructing the topology of Bluetooth network. The thesis presents a distributed algorithm for topology construction of Bluetooth scatternet. It is simple, effective and recursive with good scalability. It has no restriction that nodes are in the range of communication of one another. With the related extended functionality, it can adapt to dynamic network environment. The thesis proves theoretically andvalidates with experiments that the algorithm has the following performances: O (log N) time complexity, O (N) message complexity and O (log N) diameter of the constructed scatternet.In multiple hop scatternet, a routing scheme is required to correctly forward the traffic of data packets. With special address denotation, the network routing algorithm based on the algorithm of construction topology realizes unicast and broadcast routing of data packets. It has small overhead and does not require the procedures of route discovery and route reply, and does not require taking routing information in data packets.The network performance is low with the default intra-piconet scheduling scheme in round robin mode. The thesis puts forwards a self-adaptive intra-piconet scheduling algorithm based on the basic link modes. The goal of power optimization can be achieved by automatically changing the link modes and the related parameters of the network devices according to the uniformed data of the dynamic traffic transferred in the physical links supervised in real time. It also verifies that the algorithm can considerably increase the throughput of the network, lower the power consumption of Bluetooth-enabled devices, and then optimizes the performance of the system after analyzing the results of the algorithm simulation.Some nodes in Bluetooth ad hoc personal area networks participate in multiple piconets in time division duplex and forward network traffic. It needs one inter-piconet scheduling algorithm since at a time the node presents hi only one of the piconets it participates. Sniff mode provides a flexible method to support inter-piconet scheduling scheme without any protocol modification. According to the supervised dynamic traffic of the physical links, the self-adaptive inter-piconet scheduling algorithm based on sniff mode adjusts in real time the allocation ratio of the node's tune slots to its connected links. With the comparison and analysis of the results of the simulation in various flow models, it validates that the algorithm can enhance the throughput of the system, lower the delay of the system and then improve the performance of the network.The jump mode is one link mode for scheduling framework with wide flexibility and light overhea...