It is essential to acquire the location of sensor nodes in the wireless sensor networks (WSNs), since the data collected with nodes would become meaningless without their location. In the existing studies, range-free localization schemes have been proved suitable to large-scaled WSNs due to the low cost in hardware implementation. However, the defect of those schemes is their poor accuracy in anisotropic networks with coverage holes. To tackle this problem, we propose a range-free localization scheme that combines the advantages of geometric constraint and hop progress-based methods. The geometric information provided by the combination of anchor pairs and unknown nodes is used to design the discrimination conditions, and each node divides the anchor pairs into one of three proposed categories. For different categories of anchor pairs, corresponding methods are proposed to estimate the distancse between sensor nodes. In this way, the trade-off between distance estimation accuracy and anchor utilization can be achieved. Simulation results indicate that the proposed scheme outperforms other schemes in terms of localization accuracy and proportion of outliers with acceptable computational and time complexity, where the localization accuracy and proportion of outliers in the proposed scheme are improved by up to 47% and 61% compared to DV-maxHop.