About AdHoc Wireless Network Routing Protocol

A major feature of AdHoc wireless networks is that they require a large number of routing protocols. General wired routes must be transformed to adapt to AdHoc wireless networks. We will discuss in detail some types of AdHoc wireless network routing protocols. Through these analyses, I hope you can understand this.

AdHoc wireless network routing protocol analysis

According to the particularity of AdHoc wireless network routing protocols, a variety of Adhoc Network Routing Protocols have been proposed in recent years. The MANET team of IETF is currently focusing on the research of AdHoc Network Routing Protocols and has proposed many protocol drafts, in addition, professional researchers have published a large number of articles on AdHoc Network Routing Protocols, and proposed many AdHoc Network Routing Protocols, such as DSDV and WRP. According to the routing trigger principle, the current routing protocols can be roughly divided into a prior routing protocol, reactive routing protocol and Hybrid Routing Protocol ｡

AdHoc wireless network routing protocol-a prior Routing Protocol

The predicate routing protocol is also known as the table-driven routing protocol. Each node maintains a route table containing route information arriving at the node, and updates the route table at any time based on changes in the network topology, therefore, the route table can accurately reflect the network topology. Once the source node sends a message, it can immediately obtain the route to the target node, this type of routing protocol is usually used to adapt to AdHoc wireless network requirements by modifying the existing wired routing protocol, such as the destination node sequence distance vector protocol (DSDV) obtained by modifying the routing information protocol (RIP) therefore, the delay of this routing protocol is small, but the Protocol requires a large number of routing control packet routing, the Protocol overhead is large. Common prior routing protocols include DSDV, HSR, GSR, WRP ｡

DSDV avoids the generation of routing loops by setting serial numbers for each route. It uses time-driven and event-driven technologies to control the transmission of Route tables, that is, each mobile node retains a route table locally, the information includes all valid sink points, route hops, and serial numbers of the destination route, the serial number of the destination route is used to distinguish between the new and old routes to avoid loop generation. Each node periodically transmits the local route table to the neighboring nodes, or when the route table changes, the route information is also sent to the neighboring points. When no node moves, large data packets (including multiple data units) with long intervals are used for Route updates; after the neighboring node receives information about the route table that contains the modification, it first compares the size of the serial number of the source K sink route, however, routes with a small serial number are eliminated. If they are the same, the optimal standard routing (such as the shortest path) is used )｡

HSR (HierarchicalStateRouting) is a routing protocol used for hierarchical networks. An advanced node stores the location information of all its child nodes, the logical sequence address is allocated to the node along the path from the highest-level root node to the lowest-level leaf node. You can use the sequence address for node addressing ｡

GSR is a global state routing protocol. It works in a similar way as DSDV. It uses a link state routing algorithm, but avoids the flooding of routing packets, it includes a nearby node table, network topology table, next hop route table, and distance table ｡

WRP is a distance-vector routing protocol. Each node maintains a distance table, route table, link overhead table, and message retransmission table, generate your own SST using the Shortest Path of the neighboring node, and then pass the update information to the neighboring node. When the network route table does not change, the receiving node needs to return an idle message to indicate the connection. Otherwise, the distance table is modified to find a better path. This algorithm is characteristic when any adjacent node changes, check the robustness of all adjacent nodes to eliminate the loop, with fast convergence ｡

Reactive routing protocol for AdHoc Wireless Network Routing Protocol

The reactive routing protocol, also known as on-demand or on-demand routing, is a Route Selection Method for Finding routes as needed. nodes do not need to maintain timely and accurate routing information, the Routing Query process is initiated only when data is sent. Compared with the prior routing protocol, the reactive routing protocol has a low overhead, but the latency of datagram transmission is large, it is not suitable for real-time applications. Commonly Used reactive routing protocols include ovv, DSR, and TORA ｡

AdhocOndemandDistanceVectorRouting Protocol: the source node broadcasts a route request message before sending data, and the nearby node broadcasts the message again after receiving the message, until the request message arrives at the target node or the intermediate node that knows the route of the target node, the target node or intermediate node returns a response message along the original path, after receiving the response, the source node knows the route to the target node ｡

The DSR protocol is called the Dynamic Source Routing Protocol and is a source routing protocol. The packet header of each group contains the entire source-destination route information. It uses the routing Cache Technology to store source route information, when a new route is learned, the route cache content is modified. The Protocol includes two aspects: route discovery and route maintenance ｡

The TORA protocol is a source-class initialization on-demand routing selection protocol. It adopts a link inversion distributed algorithm and is highly adaptive, efficient, and scalable, it is suitable for highly dynamic mobile and multi-hop wireless networks. Its main feature is that control packets are located at a small part of nodes closest to topology changes, therefore, nodes only retain the route information of neighboring points. The routes in this algorithm are not necessarily optimal, and sub-optimal routes are often used to reduce the overhead of route discovery ｡

TORA consists of three basic modules: Route creation, route maintenance, and route deletion ｡

Hybrid Routing Protocol for AdHoc Wireless Network Routing Protocol

Adhoc wireless networks cannot completely solve the routing problem simply by using a prior or reactive routing protocol. Therefore, many scholars have proposed a Hybrid Routing Protocol that combines the advantages of a prior and reactive routing protocol, for example, the ZRP protocol is a combination of a prior and reactive routing protocol. All nodes in the network have a self-centered virtual zone, the number of nodes in the zone is related to the configured zone radius. Therefore, the zone overlaps with each other, which is different from the group routing. in the zone, a prior routing algorithm is used, the central node uses the intra-region routing protocol IARP to maintain a route table to other Members in the zone. It uses on-demand routing for routes of nodes outside the zone and uses the interval routing protocol IERP to establish a temporary route ｡

However, the implementation of Hybrid Routing also faces many difficulties, such as the selection and maintenance of the family, the rational selection of prior and reactive routing protocols, and the high traffic of network work ｡