Social attribute-driven delay tolerant network routing improved algorithm

A technology of delay-tolerant network and social attributes, which is applied in the field of improved routing algorithm of delay-tolerant network, which can solve the problems of information staying in highly active nodes, slow information diffusion speed, and information cannot be transmitted.

Pending Publication Date: 2021-01-29
王程
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] First, according to the routing strategy, nodes with higher overall intermediary centers are more active in the network. In order to quickly transmit information, nodes with higher overall intermediary centers are selected as forwarding nodes. When encountering the destination node or the community where the destination node is located, the information will be passed to the node of the community where the destination node is located; if all forwarding nodes do not meet the nodes of the community where the destination node is located during the transmission , the information delivery fails; the reason for the failure is that the information is always transmitted to the node with high activity, and it is believed that the node with high activity can definitely deliver the information to the destination node, but the reality is that the node with high activity It shows that it can transmit information quickly, but it cannot guarantee that it has the opportunity to meet all nodes in the network, that is, the node with the highest overall intermediary center does not indicate that it is active in all communities, resulting in information delivery failure;
[0010] Second, according to the definition of betweenness centrality and the method of community division, the nodes between communities usually have a high overall betweenness centrality, and nodes with high overall betweenness centrality have a high overall activity. The data forwarding strategy will cause information to stay on nodes with high activity and cannot be transmitted to nodes with lower activity;
[0011] The third is that during the data forwarding process, routing uses the social community and betweenness centrality attributes to select nodes with higher overall activity and higher activity within the community as forwarding nodes to impr

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
  • Social attribute-driven delay tolerant network routing improved algorithm
  • Social attribute-driven delay tolerant network routing improved algorithm
  • Social attribute-driven delay tolerant network routing improved algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0050] The following will further describe the technical solution of the social attribute-driven delay-tolerant network routing improvement algorithm provided by the present invention in conjunction with the accompanying drawings, so that those skilled in the art can better understand the present invention and implement it.

[0051] The invention analyzes the shortcomings of the Bubble Rap algorithm, and proposes a specific modification scheme to further improve the delivery rate of data and reduce network delay and network load. According to the Bubble Rap routing algorithm, information is quickly transmitted to the most active node in the whole, and the active node with data may not be connected with the community where the destination node is located; after the node forwards the data, the original copy data is deleted, and the forwarding data is based on a single copy The forwarding of data is based on the flooding mechanism without deleting the original copy data. The forme...

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

According to a social attribute-driven delay tolerant network routing improved algorithm provided by the invention, data is quickly transmitted to a node with relatively high node overall intermediarycentrality by Bubble Rap, so that a node with relatively low node overall intermediary centrality may not obtain a message, a scheme for balancing the overall center intermediary degree and the localcenter intermediary degree to evaluate the intermediary centrality is provided, it is clear that junction points have a certain probability to transmit data to nodes with low intermediary centralityevaluation, a flooding-based mechanism is adopted in the Bubble Rap data transmission process, and in order to reduce the number of copies in a network, data transmission and TTW time are carried outbased on an improved binary forwarding method, the expiration time of a data copy in a node is shortened under the influence of small transmission speed, copy data in a network is greatly reduced, network load and node resources are reduced, network congestion caused by a flooding mechanism is avoided to a large extent, and network performance is improved.

Description

technical field [0001] The invention relates to an improved delay-tolerant network routing algorithm, in particular to an improved delay-tolerant network routing algorithm driven by social attributes, and belongs to the technical field of delay-tolerant network routing algorithms. Background technique [0002] With the rapid development of Internet technology, the TCP / IP protocol cluster has been widely used and has become the communication standard of the Internet. The TCP / IP protocol must meet the following conditions for end-to-end communication: First, there is a communication link from the source node to the destination node. The second is that the maximum end-to-end communication round-trip time should not be too long, and the third is the small end-to-end packet loss rate; however, there are some restricted networks in reality, such as fast mobile networks, sparse mobile wireless ad hoc networks, etc. The characteristics of the network are: there is no complete commun...

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/02H04L12/721H04W28/02H04W28/08G06F17/11
CPCG06F17/11H04L45/14H04W28/0289H04W28/08H04W40/02
Inventor 王程何克慧
Owner 王程
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