Localization through map stitching in wireless sensor networks

Node localization is an essential problem in ad hoc wireless sensor networks. Map stitching is a type of localization algorithm that has received a great deal of attention recently. In this algorithm, the network is divided into small overlapping subregions, each of which creates a local map. Then, the local maps are stitched together to form a single global map. In this paper, we first propose a new technique for map-to-map stitching that exploits every available distances between two maps. Next, we propose a few anchor-free localization algorithms based on our stitching technique. We experimentally studied the performance of our algorithms under various settings. The results show that our method achieves a significant performance improvement upon the existing method.