Research On DSDV Routing Protocol Algorithm In Wireless Mesh Network

With the rapid development of science and technology,the traditional network model has been unable to meet people’s needs,more and more different types of networks are widely used in daily work and life where the wireless LAN and mobile ad-hoc network for today’s widest range of applications both networks.The development has been limited because of their own shortcomings,wireless Mesh network has emerge as the times require.In the past ten years,wireless Mesh network has developed into a popular network,in recent years,wireless Mesh network’s research is more and more focus on joint design scheme,and routing protocol also pay more attention to the overall functional and coordination.This paper focus on the wireless mesh network routing protocol for detailed analysis and research.Wireless Mesh network can be seen as a special Hoc Ad network on the macro,its routing protocols are based on Ad Hoc network protocol or directly to copy their agreement,but the difference between the two kinds of network leads to the performance of the protocol can’t play a very well in which we need to improve on that.This paper selected Destination Sequenced Distance Vector(DSDV) routing based on wireless mesh network characteristics,and proposed Divide Cluster-DSDV.The protocol in DSDV routing information redundancy introduced clustering algorithms that carried out on the network.The paper aim at apply to DSDV protocol,therefore, by using the existing clustering algorithms and to perfect and improve the clustering algorithm.This paper also to modify the standard of metric which using the relay node to maximize the throughput of the network.DC-DSDV routing protocol can alleviate the redundancy of routing table information in DSDV protocol,although,new problems have also been created that to ease the problem that each member can maintain a large number of routing table information with the heavy workload of the cluster. The paper draws on the design idea of hybrid routing protocol ZRP order to resolve the problem of DC-DSDV protocol.And a MZRP routing protocol is proposed,based on DC-DSDV,to alleviate the problem of heavy load of cluster head. This paper adopts the wireless ad-hoc network on-demand plane distance vector routing protocol (AODV) routing lookup between clusters and proposed domain-AODV protocol to solve the problem of broadcast storm(BSP) which by means of probability radio avoid BSP.Finally, this paper makes a comparison between the network simulation experiment,the network delay,throughput, delivery ratio and network load by NS2 simulation software.The results show that the improved routing protocol compared to the existing routing protocols can with the increase of network scale, network performance changes are within the acceptable range, and the fluctuation is more gentle, effectively alleviate the difficulties in extending the network size.