A Novel P2P Service Discovery Algorithm Based on Markov in Internet of Things

In order to adapt to the characteristics of high mobility, low density in Internet of Things, this paper proposes a novel P2P service discovery algorithm based on Markov. The Markov is used to achieve the prediction of the meeting time interval between any two nodes, and to construct a two-stage prediction model of meeting time interval. This paper uses the model to improve the Spay and Wait routing protocol to improve the delivery success rate of service message. The experiments show that the algorithm can improve both of the recall rate and precision without sacrificing too much time.