BibTeX:

@article{IJIRSTV1I9057,
     title={ Survey on Range Free-Localization Schemes Based on Anchors Count in WSN Model},
     author={Yuvashree A K and Venkatakrishnan M},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={1},
     number={9},
     pages={186--192},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV1I9057.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

The range-free localization algorithm in wireless sensor network tolerates network anisotropy with a small number of anchors and range-free approaches exploit network connectivity information (i.e., the hop count of the shortest path between nodes) to localize normal nodes with a limited number of anchors in large-scale networks. The localization algorithm calculates location accuracy and localization performance under particular level demonstrated by both theoretical analysis and simulations. In this paper we present some of the basic range free localization algorithms available in wireless sensor networks.

Convex Position Estimation, Distance Vector, Mobile WSN, Particle Swarm Optimization, Point in Triangulation