Location service is a fundamental building block of many emerging computing/networking paradigms. Manual configuration is one method to determine the location of a node. However, this is unlikely to be feasible for large-scale deployments and scenarios in which nodes move often. In this paper, a theoretical solution for the problem of network localization is provided. In the wireless ad hoc networks, it is difficult to find location of a particular node, in which some nodes know their locations and some other nodes determine their locations based on determining the Euclidean distances from its neighboring nodes.