Davood's Homepage

Finding the geographical location of each node in ad-hoc networks is called localization. Localization, generally, is a hard problem and cannot be solved in polynomial time. But in dense networks it is easy to localize nodes. On the other hand, in sparse networks, it is not hard to show that there is no unique solution for the localization problem. In contrast, around spesific density of nodes, the localization problem will be very hard. In this project, we look for these hard instances of localization problem.

Up from earth center through the seventh gate
I rose, and on the throne of saturn sate,
and many a knot unraveled by the road;
but not the master-knot of human fate