Exploiting Temporal and Spatial Regularities for Content Dissemination in Opportunistic Social Network

Abstract EN

Recently, content dissemination has become more and more important for opportunistic social networks.

The challenges of opportunistic content dissemination result from random movement of nodes and uncertain positions of a destination, which seriously affect the efficiency of content dissemination.

In this paper, we firstly construct time-varying interest communities based on the temporal and spatial regularities of users.

Next, we design a content dissemination algorithm on the basis of time-varying interest communities.

Our proposed content dissemination algorithm can run in O(nlogn) time.

Finally, the comparisons between the proposed content dissemination algorithm and state-of-the-art content dissemination algorithms show that our proposed content dissemination algorithm can (a) keep high query success rate, (b) reduce the average query latency, (c) reduce the hop count of a query, and (d) maintain low system overhead.