Bluetooth Scatternet Formation Of Topology And Routing

The Bluetooth network must be satisfy for much service request when the data flow is sent. It may be embodied as much parameter combination, such as the transmission delay, throughput and dependability, and so on. The delay may be shorter from sending terminal to receiving terminal in the process of the network transmission. And it should hold holding the fastest speed of sending data from one point to another point, and enhance the network dependability. It is the main aim of forming the network.There are many kinds of interference in the Bluetooth scatternet. The frequency hopping squence of Bluetooth is independence in ever piconet.It is random to choose one from 79 frequency channels when every piconet sends data packets, so it appears the interference quest of the same frequency. if the interference piconets of using the same slot select the same frequency as the goal piconet, it appears the interference quest of the same frequency. In the paper, the interference quest of the same frequency is analyzed theoretically. The transmission delay of Bluetooth scatternet and throughput of Bluetooth networks system are accounted theoretically in the base of analyzing Bluetooth scatternet interference, according to the probability of successfully sending data ,.Bluetooth Ad Hoc personal area network is an independent wireless network what is composed of Bluetooth-enabled mobile devices. It could freely communicate and collaborate with each other in the area without extra infrastructure. It will be widely used in the future due to the changing of the way in processing and storing information, and has a promising perspective of wide applications. There are still many challenging points before it comes true. Before it becomes reality, many challenging issues should be addressed. The main issues are Bluetooth scatternet formation, routing and scheduling. The research in the field is theoretically and practically important. The thesis researched on Bluetooth AD HOC personal area network, analyzing the main algorithms and comparing schemes of the issues what have been presented. It raised a series of related algorithms and schemes to analyze the performances and validates them with simulations.The topic of the paper is the improvement of algorithm based on the tree scatternet topology, because the expansibility of the tree scatternet topology is better The ameliorated points are the process of selecting first point, the process of selecting standby point, and designing the self-healing process of dynamic networks. Such as the tradition formation of Bluetooth scatternet, the first point is selected manually. It goes against the rule of Ad Hoc. Further more the connectivity of the Bluetooth scatternet is not assured, and the manual design often appears the problem that there are some points can not connect to the Bluetooth scatternet. The process of first point design is in the base of the condition that all points have been discovered in the paper. The first point was selected by the comparing of Bluetooth physical address weight. Further more the process of selecting standby point adopt the way by comparing the frequency value to find the nearest leafage point from the piconet what the first point controls. This way what to deal with considers the problem of the first point separated from the Bluetooth scatternet. It is not considered that the problem of a point may page or scan paging from another point interminably. Furthermore, converging separate networks and new nodes's joining the existing network are not enabled in this protocol,and the network can not heal automatically when it is partitioned due to some link's invalidation either.There are two parts of content in the design of routing arithmetic, that is the routing discover and the routing maintenance. The way of the routing discovering adopts the way that the routing list has been prepared in advance. It is as the same as the process of topology discovering. The process of routing maintenance is base on topology changed. The solution raised in the paper is combining the part and the whole routing list maintenance.The arithmetic is designed by controlling the embranchment network to reduce the load of the first point, because there is the problem that the first point's load is much more excessive. The sub tree point deals with the embranchment assignment, which is defined by the bridge point of the first point what controls the piconet. If the aim point is in the embranchment network, the control point will deal with the assignment of sending data. Thus load of the first point is reduced.