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 sub-regions, each of which creates a local map. Then,...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2008-01, Vol.19 (1), p.93-105
Main Authors: Kwon, Oh-Heum, Song, Ha-Joo
Format: Article
Language:English
Subjects:
Algorithms
Computer networks
Computer Society
Costs
Distributed algorithms
Energy consumption
Global Positioning System
Localization
localization algorithm
location identification
Monitoring
Networks
Performance enhancement
Position (location)
Query processing
Routing protocols
Sensor systems
Sensors
Stitching
wireless sensor network
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 sub-regions, 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.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2007.70706