MINT: maximizing information propagation in predictable delay-tolerant network

Information propagation in delay tolerant networks (DTN) is difficult due to the lack of continues connectivity. Most of previous work put their focus on the information propagation in static network. In this work, we examine two closely related problems on information propagation in predicable DTN. In particular, we assume that during a certain time period, the interacting process among nodes 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 information at the final stage. This problem is well-known influence maximization problem which has been extensively studied for static 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 extensive experiments using $10,000$ users from real contact trace.