Research On The Information Search Algorithm Based On Stationary Distribution In Delay-tolerant Networks

DTN as a new end-to-end storage forwarding architecture, received wide attention in recent years. But the majority of work in DTN focus on routing schemes, the ability to rapidly and conveniently access information is also an important feature the DTN should have since the ultimate goal of establishing such network is to allow mobile users to quickly and efficiently access information.First, this paper introduces the network concept and characteristics, some typical applications of DTN, the applied prospect and developing tendency of DTN, clarification of routing algorithms in DTN, several typical routing strategies and comparison of routing algorithms. Then, the paper introduces the related knowledge of Markov chain.In the end, the paper proposes a two-hop information search algorithm in delay-tolerant networks. we divide the information search into two phases:query and feedback, and propose an information search algorithm based on stationary distribution (ISSD). The Markov model is applied to calculate the node's ability of query and feedback. In the former phase, we select the nodes with higher query probability as the query nodes. In the latter phase where a query node enters the destination community, we will select the node located in the destination community with the highest feedback probability as a feedback node. The simulation results show that our algorithm improves the delivery ratio and also reduces the network resource consumption compared with some existing schemes.