Abstract
Based on the characteristics of weak mobility in wireless Mesh network, this paper researched the Destination Sequenced Distance Vector (DSDV) routing and proposed Divide Cluster-DSDV protocol. This protocol introduces the clustering algorithm in the information redundancy problem for DSDV routing. Based on the existing clustering algorithm, the protocol also modifies the standard of evaluation link Metric in DSDV protocol which using the relay node to maximize the throughput of the network. Further this paper refers to the design idea of Mixed Routing Protocol (ZRP) to alleviate the problem of heavy load of cluster head in DC-DSDV. This paper adopts the wireless ad-hoc network on-demand plane distance vector routing protocol (AODV) routing lookup between clusters and proposes domain-AODV protocol to solve the problem of broadcast storm (BSP) which by means of probability radio avoid BSP.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
