Probabilistic-routing-oriented DTN (delay-tolerant network) congestion avoiding method

A delay tolerant network and congestion avoidance technology, applied in the field of delay tolerant network, can solve the problems of node congestion, not considering the success rate of data transmission, not considering the number of copies of data packets, etc., to achieve the effect of avoiding congestion.

Active Publication Date: 2015-09-30
HARBIN ENG UNIV
View PDF5 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] Based on the above analysis, for the defects of the existing congestion control methods and congestion avoidance methods: the congestion control method does not consider the number of copies of data packets in the network, and it is very likely to discard the data packets with the least number of copies in the cache, making these The data packet cannot reach the destination node, resulting in the loss of the data packet; at the same time, it only starts from deleting the cached data packet of the node, without considering that the number of copies of the new data packet received by the node in the network may be higher than t

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
  • Probabilistic-routing-oriented DTN (delay-tolerant network) congestion avoiding method
  • Probabilistic-routing-oriented DTN (delay-tolerant network) congestion avoiding method
  • Probabilistic-routing-oriented DTN (delay-tolerant network) congestion avoiding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0025] Step 1: The source node S sends a message M to the destination node D. Messages are prioritized according to the message prioritization method.

[0026] Step 2: For messages with a determined priority, use the message copy number threshold allocation method to set the copy number threshold Q that can be generated by a single message.

[0027] Step 3: Determine whether any node L that has message forwarding is meeting any node N, if yes, go to step 4; otherwise, go to step 8.

[0028] Step 4: Determine whether the probability of N reaching the destination node D is greater than L, if yes, perform step 5; otherwise, return to step 3.

[0029] Step 5: Determine whether the copy number K of the message M sent by the message sending node L is equal to the threshold Q, if not, go to step 6; otherwise, go to step 7.

[0030]Step 6: L copies the message to the meetin...

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 belongs to the field of DTNs (delay-tolerant networks), and particularly relates to a probabilistic-routing-oriented DTN congestion avoiding method. The method comprises steps as follows: a source node S sends messages M to a target node D, priority division is performed on the messages with a message priority division method; for the messages with priorities determined, a copy number threshold value Q which can be produced by each single message is set with a message copy number threshold value distributing method; whether any node L forwarding messages is encountering any node N or not is judged; whether the probability from N to the target node D is larger than L or not is judged; whether the copy number K of the messages M of the node L forwarding the messages is equal to the threshold values Q or not is judged. With the adoption of the method, sizes of the messages sent by the source node, life cycles of the messages and the probability from the source node to the target node are comprehensively considered, the copy number threshold values are set for the messages, and copy numbers of messages in a network can be effectively limited, so that the phenomenon of congestion in the network is avoided.

Description

technical field [0001] The invention belongs to the field of delay-tolerant networks, and in particular relates to a probabilistic routing-oriented delay-tolerant network congestion avoidance method. Background technique [0002] Delay Tolerant Network (DTN) is a new type of network, which has the characteristics of high latency, intermittent connectivity, topology variability, and limited node resources. In order to overcome these network limitations and ensure the arrival rate of message transmission, the delay-tolerant network uses the services provided by the transport layer, uses the hop-to-hop hosting mechanism, and uses the "store-carry-forward" method to transmit messages. However, DTN has the characteristics of high latency, intermittent connectivity, topology variability, and limited node resources, which lead to the fact that managed nodes may need to store received messages for a long time to cope with possible network delays and interruptions until they receive ...

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): H04L12/865H04L47/6275
CPCH04L47/12H04L47/6275
Inventor 王慧强王贺哲吕宏武冯光升朱金美林俊宇
Owner HARBIN ENG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products