Encounter Delivery Strategy for Strongly Relational Relay Nodes in MSN
Zhiyu Zhang, Bin Liu, Maojie Xue · Journal of Physics Conference Series · 2020
Abstract MSN has the characteristics of social network, and the nodes under intellectual consideration show social selfishness, which is characterized by kinship index. We propose an encounter delivery strategy based on strong-relationship relay nodes. Firstly, in the hierarchical communities and clusters based on the kinship index, the active strong relationship node set is obtained through the open strong relationship priority algorithm and Markov prediction. Then establish a kinship trust model, conduct behavior detection on active strong relationship nodes to obtain a comprehensive kinship trust value, and then screen out some of the “false kinship” nodes to screen out a set of trusted active strong relationship nodes. Finally, according to the kinship indication with the destination node, the node’s kinship movement behavior is predicted, and the candidate relay node set is selected. Simulation experiment results show that this strategy can improve the reliability of message transmission, reduce network delay, and improve the efficiency of data packet transmission to a certain extent.