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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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,...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


