Supercharge Your Innovation With Domain-Expert AI Agents!

Dynamic Multipath AODV Routing Method Based on Node Congestion Prediction

A congestion degree and node technology, applied in the field of computer networks, can solve problems such as seldom considering multipath problems, unsatisfactory effects, and only considering link stability problems, achieving low congestion, fewer node hops, avoiding or The effect of congestion

Inactive Publication Date: 2016-07-06
NANJING UNIV OF SCI & TECH
View PDF3 Cites 0 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 Multipath AODV Routing Method Based on Node Congestion Prediction
  • Dynamic Multipath AODV Routing Method Based on Node Congestion Prediction
  • Dynamic Multipath AODV Routing Method Based on Node Congestion 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 prediction. First, the node establishes a gray system GM (1,1) prediction model and a RBF neural network prediction model, and according to the node queue occupancy at the previous n moments , predict the occupancy of the node queue at the n+1th moment, and calculate the node congestion degree; secondly, introduce a multi-path mechanism, and consider the amount of data sent by the node and the average node congestion degree of neighboring nodes in the process of establishing the main path , when certain conditions are met, the multipath mechanism is started. When establishing the main path, the number of node hops and the degree of congestion are considered comprehensively, so that the established main path has the advantages of less number of node hops and less congestion degree. During data transmission, when the next hop master node on the main path will be congested, the congested node is bypassed by establishing an auxiliary path. By adopting this method, the possibility of network congestion can be reduced, the throughput of the network can be increased, the end-to-end delay can be reduced, and the survival time of the network can be extended.

Description

technical field [0001] The invention belongs to the technical field of computer networks, and relates to a routing method of a mobile AdHoc network, in particular to a dynamic multipath AODV routing method based on node congestion degree prediction. Background technique [0002] Mobile AdHoc network (mobile ad hoc network), also known as MANET (MobileAdHocNetworks), is a kind 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 AdHoc network has independent networking capabilities, self-organization, decentralization, and dynamics. It is more durable and has higher invulnerability than a central wireless network. Occasions that require temporary communication, such as rescue, exploration, and target monitoring in dangerous environments. Therefore, the mobile ...

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
Patent Type & Authority Patents(China)
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com