Hop limited epidemic-like information spreading in mobile social networks with selfish nodes (Q2841097)

In this paper, the authors evaluate an information spreading algorithm in mobile social networks similar to SIR epidemic model. Information is transmitted based on the physical link (which is determined by the inter-meeting time between two nodes following an exponential distribution) as well as social link (following a scale-free network). Two relevant features for information spreading are considered in the paper: the limited hop count and selfish behavior of users. The information accumulation can not exceed the maximal hop count, which is a constant over the whole network. Information exchanges between users if they physically meet and with two different probabilities according to whether they are friend or not. Through extensive simulations, they find that the maximal hop count and the selfish behavior have important impact on the information spreading process: users may not always willing to help others. The impact of selfish behavior also has an effect on the distribution of friends.