Abstract: A Node Staying Probability based Path Compression Algorithm (NSP-PCA) is proposed in this paper. In NSP-PCA, the stability of new local paths is predicted by computing the probability that one node keeps staying in another nodes transmission range. The compressing operation is performed based on the prediction to reduce the blindness of compression. Simulation results show that NSP-PCA lessens the ephemeral and multiple short-cuts observably and achieves lower end-to-end delay, lower routing overhead and higher packet delivery rate compared with both SHORT and PCA.