Opportunistic network routing method based on spectral clustering community division

Abstract

The invention discloses an opportunistic network routing method based on spectral clustering community division. The method comprises the following steps of setting the number of network node communities, division classes and the number of nodes and starting carrying out random movement by all nodes; after simulation is carried out for certain period of time, carrying out community division on the nodes in the network through utilization of a spectral clustering algorithm according to contact times and contact duration among the nodes; calculating community reachable probability centrality of a target node, intra-community node reachable probability centrality and a message copy control utility value according to community division results; carrying out movement and encounter by the nodes, and determining whether messages are forwarded or deleted according to the reachable probability centrality and the copy control utility; and periodically updating the community reachable probability centrality, the intra-community node reachable probability centrality and the message copy control utility value. According to the method, through adoption of the spectral clustering algorithm, the community division effect is good, the message transmission is clearly improved, and the network cost is reduced.

Description

technical field [0001] The invention relates to a chance network routing method based on spectral clustering community division. Background technique [0002] In an opportunistic network, the movement of nodes has a great impact on the communication between nodes, intermittent interruptions often occur, the network topology is unstable, and the dynamic changes are large, so the research on opportunistic networks is often based on the movement of nodes The opportunity to meet in the network is used to complete the data transmission, and a "storage-carry-forward" routing transmission strategy is adopted. This kind of network has a certain social nature. Nodes often gather together or appear in some places with high frequency according to social relationships, forming various community structures. The communities formed here can generally determine the real or logical community boundaries. The activities of nodes inside the community are relatively frequent, the chances of mee...

AI Technical Summary

Problems solved by technology

Literature "A Message Transmission Algorithm Based on Community Opportunity Network" (Niu Jianwei, Zhou Xing, Liu Yan, et al. A Message Transmission Algorithm Based on Community Opportunity Network [J]. Computer Research and Development, 2009, 46(12): 2068-2075.) The message transmission process is divided into two stages: the intra-community and the inter-community. The "multi-copy + control" method is adopted in the community, and the nodes with a large degree of sociality are used to transmit messages between the communities. However, this method adopts a static community The division method does not take into account the impact of node changes on the community

Images