Efficiency Improvement On Dynamic Routing Algorithm For Bluetooth Ad Hoc Network By Adjacent Node Selection Mechanism

Based on Bluetooth ad hoc network,this thesis researches the influence of the adjacent node selection mechanism on the performance of the dynamic routing protocol,and doesn’t change anything about the dynamic routing protocol.This thesis focuses on the high density of user scenarios,analyzes the root causes of data redundancy and data collision,and comes out “adjacent node selection mechanism”,which is based on sharing neighbors to solve these problems in dynamic routing protocol.The adjacent node selection mechanism,from the network perspective,is aimed at reducing the network connection which is not necessary to reduce the number of forwarding packets,thereby reducing data redundancy in the network.However,in the fast-change network,this strategy has bad affect on the reliability of the dynamic routing protocol,so,this thesis,then,puts up with a reliability optimization algorithm,which is based on the heartbeat mechanism of Bluetooth ad hoc network.The reliability optimization algorithm allows the node to realize the topology variation in time upon some connection disconnect and make up for a certain number of new connections.Based on comparison,this thesis designs and implements a simulation program to verify the enhance of adjacent node selection mechanism to dynamic routing protocol.In order to quantify the increased performance,this thesis defines a series of parameters as performance measurement: k,λ and μ,k reflects the user density under different application scenarios,λ and μ reflect the performance improve-degreement of the dynamic routing protocol in the Bluetooth ad hoc network with the adjacent node filtering mechanism compared to the dynamic routing protocol in the normal Bluetooth ad hoc network.According to these parameters,this thesis researches the relationship of user density and the amplitude of the performance improved by the adjacent node selection mechanism.