Link scheduling plays a pivotal role in accommodating stringent reliability and latency requirements. In this paper, we focus on the availability and effectiveness of applying protocol interference model (PIM) under Rayleigh fading model to solve the problem. The motivation is that PIM caters to distributed link scheduling algorithm design, but usually lead to irrationality due to its localization behavior. While Rayleigh fading model can accurately describe the inherent characteristic of wireless signal propagation, but the features of global interference and channel fading make algorithm design more challenging. To be specific, we first remove the effect of channel fading on algorithmic design by establishing the relationship between Rayleigh fading model and non-fading model. We then propose a centralized once link elimination (OLE) algorithm by utilizing local nature of PIM, and achieve its distributed implementation based on the message delivery with time complexity of $O(\Delta _{\max }\ln \Delta _{\max })$ , where $\Delta _{\max }$ is the maximum number of nodes around a given node inside some range. Furthermore, based on random contention resolution, we design another distributed algorithm to schedule all the links within $O(\Delta ^{3}_{\max }\ln \Delta _{\max })$ rounds. Simulations show that the PIM is of great confidence as same as Rayleigh fading model, and the proposed algorithms outperform three popular link scheduling algorithms.