Research On DSR Routing Protocol Based On Load-Balance Algorithm

With the rapid development of information technology, wireless communication technology has been improved. Ad Hoc network is a wireless mobile communication network which is made up of a group of mobile nodes attached devices with a wireless transceiver. It does not rely on the default and the temporary infrastructure, network, mobile nodes in network exchange information with its own wireless transceiver equipment. This self-creation, self-organizing and self-management networks are being used widely in the battlefield, fires, earthquakes and other special occasions. It fills the blank field where traditional Internet networks will not be able to workWith the nodes fast moving in Ad Hoc network, network topology will be constantly changed. So the traditional routing protocol for the Internet can not be applied to Ad Hoc network.. It is necessary to use the appropriate routing algorithm to solve the Ad Hoc network routing problem. Therefore, routing protocol is the hot area for research. in mobile Ad Hoc network at this stage.This thesis summarizes the concepts, characteristics and difficulties of Ad Hoc networks at first. My research is focus on Ad Hoc routing problems. The Ad Hoc routing protocols can be classed into two types on the basis of the ways of finding routing paths, which are proactive routing and reactive routing protocols. My research mainly analyses one prominent on-demand routing protocols: Dynamic Source routing protocol (DSR), and design a detailed MATLAB simulation model for DSR protocol.Based on studying deeply in the characteristic of mobile Ad Hoc networks, analyzing the shortages in multi-path routing protocol, this thesis puts forward a new kind of routing algorithm based on load-balance. Firstly, algorithm analyzes the queuing model and put forward two formulas to evaluating the partial function and whole function for Ad Hoc networks. Using the connective matrix and traffic matrix, the usage condition of every link and function index can be calculated. At last, we set the threshold value to limit the excessive usage of links, reduced the possibility of congestion. Simulations and comparisons with some typical route algorithms show our algorithm is robust and effective.