A rate-compatible puncturing scheme for LDPC codes is proposed based on the fact that a one-step recoverable (1-SR) node is more reliable than a k-SR node (k>;1) and a 1-SR node with more survived check nodes can be recovered more reliably in a recovery tree, so the scheme tries to obtain 1-SR nodes which have multiple survived check nodes as many as possible. Simulation results show that the puncturing scheme has better performance than both the random puncturing scheme and the novel method in [5].