Routing Algorithm Based On Bluetooth Ad Hoc Networks Bgodr

In Bluetooth Ad Hoc networks, network formation and routing schemes, which are based on demand or location information, have many insufficiencies, and theirs applications have had a lot of restrictions. In order to reduce Bluetooth network topology maintenance and routing control overhead, improve the efficiency of network formation, narrow the scope of route searching, reduce the routing hops to the destination node, Bluetooth Greedy On-demand Routing (BGODR) ,which is based on location information and routing on-demanded, is firstly proposed. The Bluetooth technology is inducted into the traditional protocol of Greedy Routing based on location information, to make the Bluetooth nodes routing on-demanded.In network formation phase, with the inquiry mechanism, Bluetooth node can search its neighbors' topological information in leisure time, and select the appropriate interval to start the paging process, and update the location information of neighbors according to the node's speed, and which is not available in the current Bluetooth network formation algorithms. In route searching phase, Bluetooth node uses Greedy Forwarding or Minimum Angle Forwarding to find the next hop, and the roles of routing path can be confirmed in the backward process of RREP, and it's the major innovation of this paper. Bridge of slave/slave routing path and bridge of master/slave routing path complete the role distributing in data and control packets sending with route searching and route maintaining. The scope of the effective radio range is restricted , which make Physical link more stable, and Minimum Angle Forwarding strategy is adopted in route rearching phase to resolve the local optimization problem caused by Greedy Forwarding,and which also has a certain value innovation.The Bluetooth simulation module (UCBT) based on NS2 is adopted to simulate the scatternet formation and route discovery of BGODR.The theory and experiment research indicated: with BGODR, delay of node's connection maintaining time is cut down ,and the probability of discoverable neighbor is increased with a high level. Beacon_hello mechanism based on the node's speed, is not only reflect the change of network topology in time, but also have more efficiency and less control overhead than BAODV. Greedy Forwarding and Minimum Angle Forwarding strategy is adopted in route rearching phase,to make BGODR has less route discovery expenses and more efficiency of route discovery than BAODV.