DocumentCode :
2394405
Title :
Fine-Grained Localization with Pairwise Nodes Coverage
Author :
Li, Xiaoguang ; Wu, Jie
Author_Institution :
Dept. of Comput. Inf. & Sci., Temple Univ., Philadelphia, PA, USA
fYear :
2011
fDate :
20-24 June 2011
Firstpage :
111
Lastpage :
117
Abstract :
Localization is an important design issue in wireless sensor networks. In this paper, we will focus on the sensor deployment for localization with the consideration of coverage and accuracy. Our pairwise localization pattern requires the information of only two coverages for the target. With this information, there are two possibilities of the position. In order to determine the correct location, we design minimum node deployment with regular pattern and an adaptive sequence based localization algorithm (ASL). The proposed ASL algorithm could accurately localize the node in the monitoring area with minimum cost. Also, we extend our results with the noisy model and provide an analysis of the deployment issue. The simulation results show that compared with the traditional triangular and other localization methods, our strategy can achieve the minimum energy, and maximum lifetime.
Keywords :
sensor placement; wireless sensor networks; ASL algorithm; WSN; adaptive sequence-based localization algorithm; fine-grained localization; minimum node deployment design; noisy model; pairwise localization pattern; pairwise node coverage; sensor deployment; wireless sensor networks; Adaptation models; Equations; Mathematical model; Monitoring; Noise; Noise measurement; Wireless sensor networks; Deployment; localization; pairwise-coverage; scheduling; wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems Workshops (ICDCSW), 2011 31st International Conference on
Conference_Location :
Minneapolis, MN
ISSN :
1545-0678
Print_ISBN :
978-1-4577-0384-3
Electronic_ISBN :
1545-0678
Type :
conf
DOI :
10.1109/ICDCSW.2011.19
Filename :
5961347
Link To Document :
بازگشت