Abstract: This paper presents a method of removing copy on the basis of multiple message copies to control message copies reasonably. With the variety characteristic of copies at the encounter of nodes in the networks, we construct the discrete time Markov chain of message copies and set up birth and death model, and then verify and obtain stationary distribution. Simulation result shows that the linear relationship between encounter number and time is almost same with that given by the theory model. In comparison with epidemic routing, the message copies decrease obviously, and the success delivery efficiency of message reaches 90% and even reaches 100% if the delay time is increasing.