Improved AODV routing protocol based on load balancing

Abstract

The invention discloses an improved AODV routing protocol based on load balancing, which is characterized in that load balancing measurement is redesigned for the AODV routing protocol, a path from a source node to a destination node of each node and the CPU utilization rate, memory occupancy rate and throughput of a single node are introduced, different weights are given, and the load balancing measurement is calculated by using a weight factor function. Therefore, the link state and the node processing capability in the network are measured. According to the invention, a better path is selected for the nodes in the network to avoid the nodes with heavy load, so that the transmission path is ensured not to be congested as far as possible.

Description

technical field [0001] The invention belongs to the technical field of communication, and in particular relates to an improved AODV route. Background technique [0002] AODV (Adhoc On-demand Distance Vector Routing, Adhoc On-demand Distance Vector Routing Protocol) is a source-driven on-demand routing protocol. Each node using the AODV protocol maintains a routing table that stores the next-hop routing information to the destination node. Each routing table entry is marked with a time-to-live TTL value. If the route is not used within the lifetime, the route will expire and terminate. And every time a route is used, the lifetime TTL value will be updated to ensure that the route is not deleted prematurely. The traditional AODV protocol effectively solves the problem of routing and forwarding between nodes in the wireless ad hoc network, but there are still a series of defects in its protocol mechanism, as follows: [0003] (1) The AODV routing protocol uses RREQ broadcast...

AI Technical Summary

Problems solved by technology

[0004] (2) Only one route to the destination node is maintained in the routing table. If the link fails, the data packet being transmitted will be lost

Since there is no alternative route available, the source node has to re-initiate a new round of pathfinding, which greatly increases the end-to-end delay

[0005] (3) AODV uses the shortest number of hops as the route selection standard, which cannot ensure that the selected route is the best route, and is not suitable for heavy-loaded networks

The minimum number of hops tends to choose nodes with far distances and links with few hops for transmission, without considering the busyness of nodes in the network and the quality of links. In large wireless networks, nodes at the center of the network will be blocked due to geographical location. High probability is selected as the intermediate node of the path to forward data packets, causing these nodes to be under heavy load for a long time, and these nodes may even be temporarily paralyzed due to overload, RREQ packets are discarded or return timeout

Once the RREP packet is lost, the source node will restart the route search process, thereby increasing the transmission delay

Images