Abstract: Based on the Euclidean distance, a distributed grid location estimation was proposed as follows to improve the original estimation. Comparing the information on hop count between the measured nodes and beacon nodes, the quick self-locating of measured nodes was implemented. How the Euclidean distance is used to substitute for the matched threshold so as to improve the accuracy of location and how to use the distributed computation to save the energy consumption of network were studied, then the Dijkstra algorithm was used to compute the minimum hop count between nodes. Simulation results showed that the improved estimation can locate the nodes quickly and accurately with energy saving at low cost especially with the high robustness provided.