Social attribute-driven delay tolerant network routing improved algorithm

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...

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 improve data forwarding efficiency and delivery success rate. Delete the original data copy after data transmission, data transmission is based on single-copy routing, and the disadvantage of single-copy routing is that the copy diffusion speed is slow and the data may miss the chance to meet the destination node in the process of data transfer to the highly active node , reduce the success rate of data delivery and increase the data transmission delay; if the original data is not deleted after data transmission, the data will be transmitted to nodes with higher overall or local betweenness centrality than the nodes through the flooding mechanism. The flood mechanism speeds up the rate of information transmission, improves the success rate of information delivery and reduces network delay, but increases the network load. As the network scale increases, the network performance will decrease, that is, the nodes use the flooding mechanism when transmitting information. strategy, but does not consider the increase in network load and network congestion caused by the flooding mechanism

[0012] The Bubble Rap delay-tolerant network routing strategy is based on the betweenness center in the social attribute as the basis for forwarding data, but the higher the betweenness centrality does not mean that the nodes are high in all communities, and the information converges to the nodes with higher overall betweenness centers , causing the information not to be transmitted to the destination node with low intermediary centrality, whether to delete the original data after forwarding the data, if it is deleted, it will be a single copy, and if it is not deleted, it will become a flooding mechanism. The former leads to slow information diffusion, while the latter As the network size increases, the network will be congested

Images