Research on DSDV routing protocol based on wireless Mesh network
Yin Feng-jie, Yang Hui, Ying Zhang
Abstract
Yin Feng-jie, Yang Hui, Ying Zhang
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.
OpenAlex reports 20 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Wireless Routing Protocol, Computer network, Dynamic Source Routing, Computer science, Zone Routing Protocol, Destination-Sequenced Distance Vector routing, Enhanced Interior Gateway Routing Protocol, Optimized Link State Routing Protocol