Due to its characteristics such as long communication delay, high dynamic topology, sparse distribution of nodes and frequent link break, routing are the key research issues of delay tolerant networks. Prophet algorithm forwards the packets to the node with maximum probability of successful delivery by recording history information of nodes encounter. Prophet reduces the invalid copy of message, so that effectively reduce the network overhead and the traffic load in the network. However, the calculation of probability in Prophet does not consider the network situation. In this paper, we proposed an IProphet algorithm, which take into account connection status to calculate nodes' encountering probability. Simulations show that the proposed algorithm has a better performance.