Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Congestion Control Method Based on Social Awareness in Delay Tolerant Networks

A congestion control and delay-tolerant network technology, applied in data exchange networks, digital transmission systems, electrical components, etc., can solve the problem of message destination node reception, high probability of successful forwarding, and no consideration of the social relationship between the node carrying the message and the destination node, etc. question

Active Publication Date: 2016-07-06
王堃
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, most of the existing discarding strategies do not consider the social relationship between the node carrying the message and the destination node. It is likely that the destination node discarding the message has a strong social relationship with the current node, and the probability of successful forwarding in the future is very high. The discarding strategy prevents such messages from being received by the destination node quickly, and the routing efficiency is greatly reduced

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
  • A Congestion Control Method Based on Social Awareness in Delay Tolerant Networks
  • A Congestion Control Method Based on Social Awareness in Delay Tolerant Networks
  • A Congestion Control Method Based on Social Awareness in Delay Tolerant Networks

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0068] by figure 1 Take an example to illustrate the process of message forwarding when nodes i and j meet. There are m in the message queue carried by node i 1 ,m 2 ,m 3 ,m 4 Four data packets, the corresponding destination nodes are D 1 ,D 2 ,D 3 ,D 4 . First, nodes i and j respectively calculate the relationship with the first destination node D 1 The social congestion measure of , denoted as SCM i (D 1 ) and SCM j (D 1 ), compare the size of the two to get the SCM i (D 1 )j (D 1 ), node j and message m 1 Destination node D 1 The social congestion metric value of node i is greater than that of node i, indicating that node j for message m 1 The forwarding ability of node i is stronger than that of node i, so the m 1 Join the sending queue. to m 2 ,m 3 ,m 4 Perform the same operation, since node j and destination node D 3 The social congestion measure of node i is smaller than that of node i, that is, the SCM i (D 3 )>SCM j (D 3 ), so m 3 Not in s...

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

A congestion control method based on social perception in a delay-tolerant network. Aiming at the congestion problems caused by intermittent connections, long delays and node cache limitations in social delay-tolerant networks, a congestion control method based on social perception is proposed, considering the node According to the social relationship characteristics and congestion degree of the social relationship, the social congestion measurement value is constructed, and the message is forwarded to the node with a higher social congestion measurement value during the forwarding process. When congestion occurs, according to the social relationship between the destination node corresponding to the message and the current node carrying the message Value, select the message corresponding to the minimum value and discard it, reducing the impact on routing efficiency due to blind packet loss. The simulation results show that compared with the existing algorithms, the SACC algorithm can effectively improve the delivery success rate, reduce the packet loss rate, and reduce the overhead within the tolerable delay range.

Description

technical field [0001] The invention is a congestion control algorithm based on the social relationship between nodes, which belongs to the field of congestion control of delay-tolerant networks. Background technique [0002] Delay Tolerant Networks or DTN (Delay Tolerant Networks) is a restricted network (Challenged Network) that supports the interoperability of various regional networks and converts between the communication characteristics of various regional networks. In the social application scenarios of delay-tolerant networks , the way nodes move usually has certain social characteristics. Using the social attributes of nodes to solve key problems in DTN social scenarios has become an important technical means. Messages are transmitted to key nodes in the network with many social relationships and strong forwarding capabilities. , to improve routing efficiency. But on the other hand, due to the limited network resources, it is easy to cause some nodes, especially th...

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): H04L12/801H04L12/823H04L47/32
Inventor 王堃郭篁
Owner 王堃
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products