Link scheduling has always been a fun-damental problem in wireless networks for its direct impacts on the performance of wireless networks such as throughput capacity, transmission delay, lifetime, etc. Existing work is mainly established under graph-based models, which are not only impractical but also incorrect due to the essentially fading characteristics of signals. In this paper, we study the shortest link scheduling problem under two more realistic mod-els, namely the signal to interference plus noise ra-tio (SINR) model and the Rayleigh fading model. We propose a centralized square-based scheduling algo-rithm (CSSA) with oblivious power control under the SINR model and prove its correctness under both the SINR model and the Rayleigh fading model. Fur-thermore, we extend CSSA and propose a distributed square-based scheduling algorithm (DSSA). Note that DSSA adopts CSMA/CA so that a wireless node can compete for the wireless channel before starting its communication. We also show theoretical analysis and conduct extensive simulations to exhibit the cor-rectness and efficiency of our algorithms.