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

Congestion control method based on socially aware in delay tolerant network

A congestion control and delay-tolerant network technology, applied in data exchange networks, digital transmission systems, electrical components, etc., can solve the problems of reduced routing efficiency, no consideration of the social relationship between the node carrying the message and the destination node, and the reception of the message destination node.

Active Publication Date: 2014-01-22
王堃
View PDF2 Cites 4 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
  • Congestion control method based on socially aware in delay tolerant network
  • Congestion control method based on socially aware in delay tolerant network
  • Congestion control method based on socially aware in delay tolerant network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0067] 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

The invention discloses a congestion control method based on socially aware in a delay tolerant network in order to solve the problem of congestion caused by discontinuous connection, long-time delay and node cache limit of the social delay tolerant network. A social congestion metric is constructed by considering the social relation characteristic and congestion level of each node; in a transmitting process, a message is transmitted to the node with relatively high social congestion metric; when congestion is caused, the message corresponding to the least value according to the social relation value between the target node corresponding to the message and the current message-carrying node is selected and discarded, and the influence on the routing efficiency caused by blind packet loss is reduced. A simulation result shows that compared with the current algorithm, an SACC (socially aware congestion control) algorithm has the advantages that within a tolerant time-delay range, the success rate of transmission can be effectively improved, the packet loss rate is reduced, and spending is reduced.

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 application scenarios, node movement 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 the network with many social relationships and strong forwarding capabilities. key nodes to improve routing efficiency. But on the other hand, due to the limited network resources, it is easy to cause some nodes, especially the congestion problem of key nodes, which degrades...

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 Applications(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