Research On Localized Routing Algorithm In Mobile Ad Hoc Networks

Mobile Ad-Hoc Network is widely adopted in occasions like battlefields,earthquake fields,and temporary conferences.Its popularity profits from the no-Control,no-infrastructure and flexibility.However,the limitation of energy mobile devices narrows the development of Ad-Hoc Network.Clearly,the desire of applying highly efficient routing algorithm,reducing the overhead and slowing down the consumption of energy is the key and urgent problem.This paper bases the research on early achievements.By analyzing the pros and cons of present routing algorithms,an Improved Directional Broadcast Algorithm based on Brownian motion(DBB-AODV)has been put forward and verified by experiments.According to our algorithm,overhead of network has been obviously reduced.Traditional routing algorithms lay mostly on the algorithm themselves,and turn deaf ear on the distribution of mobile nodes.This paper assumes that the valuable encountered nodes have the tendency of placing near the destination node.To introduce the pattern of arrangement of nodes,history encounter records of nodes and Brownian motion Theory are used to determine the routing strategy.The DBB-AODV algorithm deduces the location of destination node relying on these assumptions and ideas.By applying probability forward theory,DBB-AODV can make localization fixed-direction broadcast.According to the simulation result compared with present classic algorithm by NS2,DBB-AODV has relatively high Packet delivery ratio,small end-to-end delay,short path length and light routing overhead.