The thesis deals with sensor networks and their localization. First section describes sensor networks in general and explains problems of localization and routing. The second part deals with localization using anchors. The principal of the Dv-hop and DV-Distance are there described in detail. These algorithms are used for simulations in Matlab in the main part of this thesis. According to the simulations the most sufficient number of sensors for good localization is estimated.

Universal algorithm approach is very a unique and quite useful. It can be used for most of the localization problems. A number of research studies have been taken to evaluate the different algorithms. The literature review and surveys are the key sources to get the resultant algorithm. This thesis addresses different kind of localization problems and provides a universal solution for these problems. I have done a very important literature review and some industry based surveys. The result of surveys and literature review was a bit same, so it was quite easy to find solution for those similar problems. The idea behind this universal solution is very simple. I chose two algorithms which were quite useful in the localization and merge. The resultant algorithm proves more useful than other two algorithms. The author finds it very healthy and useful algorithm. Moreover, there is need to improve some aspects. There is need to implement this algorithm practically. Some sort of professional skills are required to make this algorithm worthy.