Abstract: The error in the DV-Hop localization algorithm is primarily in computing the distance between unknown and anchor nodes. Using distance geometry constraints and the Cayley-Menger determinant in two-dimensional space, the distance between unknown and anchor nodes were optimized and corrected. The conditions of distance geometry constraints successfully reduced the error of distance measurements between unknown and anchor nodes, and node localization was determined using trilateration. Simulation results show that the measurement data needing correction increases with the number of anchor nodes, and that this localization algorithm accurately measures the distance between unknown and anchor nodes, thereby improving positioning accuracy of network nodes and greatly increasing the coverage rate of nodes.