Family layering opportunity routing algorithm based on a genetic relationship under an MSN

Abstract

The invention discloses a family layering opportunity routing algorithm based on a genetic relationship under an MSN, and the algorithm comprises the steps: enabling nodes with the same social relationship to be located in the same family according to a genetic relationship index, and enabling different families to have cross parts; in the community and the cluster which are divided into groups and layered, self-recommended nodes generate group nodes and relay nodes through comparison of comprehensive recommended values; taking a transition probability predicted by the genetic relationship asa forwarding basis; according to the method, blind forwarding is optimized through the family nodes and the relay nodes, reliable path links are predicted and associated while the number of copies iseffectively controlled, an encounter delivery strategy based on the node genetic relationship is achieved, the transmission reliability is improved, social selfish is protected, and meanwhile flow resistance and selfish resistance are improved.

Description

technical field [0001] The invention relates to an opportunity routing algorithm, in particular to an opportunity routing algorithm based on kinship relationship under the MSN. Background technique [0002] MSN develops an opportunistic network. There is no need for a complete link between the source node and the destination node. It uses the opportunity of encounter brought by node movement to realize the network communication of the "store-carry-forward" mode, which exists in the society under the mobile network. clustering features. In the early days, opportunistic networks were used in many extreme environments lacking basic communication facilities, such as space communication, disaster relief, and wartime communication. With the increasing popularity of smart PDA (Personal Digital Assistant) devices, mobile social networks have gradually formed and are increasingly expanding. In order to carry out data transmission and sharing more effectively, in the case of limited...

AI Technical Summary

Problems solved by technology

Literature [Research on Message Forwarding and Collaboration Mechanism of Socialized Opportunity Network] Aiming at the influence of social selfishness on network performance and inter-node collaboration ability during cross-community message transmission, using game theory, a game model of node message forwarding is established to further study social selfishness Incentive and message forwarding mechanism, which is more to resist social selfishness, while ignoring its use value

The literature [Opportunistic Network Routing Algorithm Based on Social Selfishness] proposes a routing algorithm based on social selfishness. In this routing algorithm, nodes send the message with the largest forwarding income first, and select the destination node with a stronger social relationship and a higher delivery rate. Larger nodes with strong forwarding willingness are used as forwarding nodes. However, the algorithm does not take into account the social selfishness of the forwarding nodes themselves, and the performance is greatly reduced when the meeting nodes have no relationship with the destination node.

Images