Analysis of Node Localization in Wireless Sensor Networks
Sensor networks are dense wireless networks of small, low-cost sensors, which collect and disseminate environmental data. Sensor nodes are very small, lightweight, and unobtrusive. The problem of localization, that is, "Determining where a given node is physically located in a network", can be mainly divided into two parts range-based (fine-grained) or range-free (coarse-grained) schemes. This Paper presents the analysis of range based algorithms on the basis of few network parameters (Network Size, Anchor node Density, Array node density) and tried to find out the best range based algorithms by doing simulation on matlab. The metric selected for the analysis is Standard Deviation of localization error.