Unlock instant, AI-driven research and patent intelligence for your innovation.

DTN routing method based on node difference and activeness

A technology of node activity and difference, applied in instruments, data exchange networks, data processing applications, etc., can solve the problems of encounter time distribution, increase algorithm uncertainty, application compatibility and limitations, etc., and reduce network resources. cost, and the effect of improving the delivery rate

Active Publication Date: 2019-12-24
NANJING UNIV OF SCI & TECH
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The new algorithm can effectively overcome the problems of the RAPID algorithm, reduce the number of message replication and average delay, and improve the successful delivery rate of messages, but the problem of the encounter time distribution of two nodes in the algorithm increases the uncertainty of the algorithm and the application compatibility and limitations

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
  • DTN routing method based on node difference and activeness
  • DTN routing method based on node difference and activeness
  • DTN routing method based on node difference and activeness

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0071] Such as figure 1 As shown, a total of 30 nodes are set in the campus network in the example. According to the geographical location and the distribution of campus buildings, the nodes are initially divided into 20 initial communities, and the initial communities are labeled 1, 2, ... .., 19, 20, each initial community contains one or more nodes, for example, community 1 contains nodes a, b, and c. Here we use the Newman algorithm to divide and merge the initial communities. First, select the two initial community pairs with the largest modularity Q value-added from the network to merge; if all the initial communities in the network are in the same community, stop merging. For example, community 6 calculates the modularity increment ΔQ with all initial communities, and then finds the community 3 corresponding to the largest ΔQ, merges them into a sub-community, and then performs the same operation on the remaining communities until a community is synthesized . Finally,...

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 DTN routing method based on node difference and activeness, and the method comprises the steps: dividing and combining DTN networks through employing a Newman quick algorithmaccording to the movement non-randomness and sociality of each node of the DTN networks, and forming a plurality of communities; determining the difference between every two nodes, and calculating the activeness of the nodes; when the node which needs to transmit the data packet meets other nodes, exchanging mutual state information, comparing the difference between the two nodes with a set threshold value, if the difference is greater than or equal to the threshold value, taking the encountered node as a to-be-selected node, and otherwise, not transmitting the data packet; and if the activity of the to-be-selected node is greater than that of the data packet node, transmitting the data packet. According to the method, the activeness and the difference of the nodes are combined, and conditions are set for forwarding the data packets, so that the submission rate is increased, and the network resource overhead is reduced.

Description

technical field [0001] The invention belongs to the time-delay tolerant network routing technology, specifically a DTN routing method based on node difference and activity. Background technique [0002] The Delay Tolerant Network (Delay Tolerant Network) was formed when NASA studied the IPN (Interplanetary Network, Interstellar Network). At the SIGCOMM conference in 2003, the Delay Tolerant Network was formally proposed. DTN is a general message-oriented and reliable overlay network architecture, which can deal with frequent network disconnections and high delays in constrained networks, and has a very wide range of applications, such as air-ground communications, military ad hoc networks, Special embedded hardware sensors, etc. DTN routing is usually the key to improving the communication quality of nodes, and it is also one of the current research hotspots and difficulties. Considering that people's mobile phones, computers and other electronic devices, as nodes in the n...

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/727H04L29/08G06Q50/00H04L45/121
CPCH04L45/121G06Q50/01H04L67/535
Inventor 黄炎谷代平胡莹熏魏松杰
Owner NANJING UNIV OF SCI & TECH