Supercharge Your Innovation With Domain-Expert AI Agents!

Dynamic multi-path AODV routing method based on node congestion degree prediction

A technology of congestion degree and node, which is applied in the field of computer network, can solve problems such as only considering the link stability problem, the effect is not very ideal, and rarely consider the multipath problem, so as to achieve low congestion degree, few node hops, and ease congestion Effect

Inactive Publication Date: 2013-12-25
NANJING UNIV OF SCI & TECH
View PDF3 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Most of the existing solutions only consider the link stability at the current moment, and seldom consider the multipath problem, the effect is not very ideal

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Dynamic multi-path AODV routing method based on node congestion degree prediction
  • Dynamic multi-path AODV routing method based on node congestion degree prediction
  • Dynamic multi-path AODV routing method based on node congestion degree prediction

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] The present invention will be further described in detail below in conjunction with the accompanying drawings.

[0049] figure 1 It is a schematic diagram of the Hello message format. On the basis of the Hello message format of the original AODV protocol, the present invention adds a NTNCD field of the node congestion degree at the next moment and a field of the available amount of the remaining queue of the node at the next moment, and other fields remain unchanged. The present invention only adds two pieces of information to the Hello message, and diffuses the congestion degree of the local node and the availability of the MAC layer queue without adding any additional control overhead.

[0050] figure 2 It is a schematic diagram of node neighbor congestion table format. The neighbor congestion table is divided into three parts, which are the neighbor node number, the NTNCD of the neighbor node and the remaining queue availability of the neighbor node.

[0051] ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a dynamic multi-path AODV routing method based on node congestion degree prediction. Firstly, a node builds a grey system GM (1,1) prediction model and an RBF neural network prediction model, the quantity occupied by a node queue at the n+1 moment is predicted according to the quantities occupied by node queues during previous n moments, and the node congestion degree is obtained through calculation; then a multi-path mechanism is led in, in the primary path building process, the size of data sent by a node and the average node congestion degree of adjacent nodes are taken into consideration comprehensively, and the multi-path mechanism is started when certain conditions are met. When the primary path is built, the hop and the congestion degree of the nodes are considered comprehensively, so that the built primary path has the advantages of being few in node hop and little in congestion degree. In data transmission, when a master node of the next hop on the primary path is to be congested, an auxiliary path is built so as to avoid the congested node. By means of the method, the probability that a network is congested is reduced, the throughput of the network is increased, end-to-end delay is shortened, and lifetime of the network is prolonged.

Description

technical field [0001] The invention belongs to the technical field of computer networks, and relates to a routing method of a mobile Ad Hoc network, in particular to a dynamic multipath AODV routing method based on node congestion degree prediction. Background technique [0002] Mobile Ad Hoc network (Mobile Ad Hoc Network), also known as MANET (Mobile Ad Hoc Networks), is a type of dynamic network composed of mobile nodes communicating with each other through shared wireless channels, and does not depend on any fixed infrastructure. All nodes in the network are equal in status and participate in route discovery and route maintenance. The mobile Ad Hoc network has independent networking capabilities, and features such as self-organization, decentralization, and dynamics. It is more durable and has higher invulnerability than a central wireless network. It is more suitable for transportation, battlefields, and emergency rescue. , Rescue, exploration, target monitoring in da...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04W40/18H04W28/14H04W16/22
Inventor 卜祥贺田金川兰少华吴歉歉陆维迪董萍
Owner NANJING UNIV OF SCI & TECH
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More