MINT: Maximizing Information Propagation in Predictable Delay-Tolerant Network

Information propagation in delay tolerant networks (DTN) is dif-ficult due to the lack of continues connectivity. Most of previous work put their focus on the information propagation in static net-work. In this work, we examine two closely related problems on in-formation propagation in predicable DTN. In particular, we assume that during a certain time period, the interacting process among n-odes is known a priori or can be predicted. The first problem is to select a set of initial source nodes, subject to budget constraint, in order to maximize the total weight of nodes that receive the in-formation at the final stage. This problem is well-known influence maximization problem which has been extensively studied for stat-ic networks. The second problem we want to study is minimum cost initial set problem, in this problem, we aim to select a set of source nodes with minimum cost such that all the other nodes can receive the information with high probability. We conduct exten-sive experiments using 10, 000 users from real contact trace