A Localization Algorithm for Wireless Sensor Networks

Node localization is important in many WSN applications. Most of existing algorithms are not applicable for networks in a concave area. To address this problem, a novel localization algorithm is proposed. The key of this algorithm is the design of neighborhood function which only uses distances between neighbor nodes to generate a new set of estimated locations from an old set. Both range-based and range-free localization can use it to estimate locations of nodes if distances between neighbor nodes are measured by hardware or estimated by distance estimation algorithms. Simulation results indicate that this algorithm can achieve accurate and reliable localization results in a concave area.