A Grid-Based Linear Least Squares Self-Localization Algorithm in Wireless Sensor Network

Self-localization is one of the key technologies in the wireless sensor networks (WSN). Some traditional self-localization algorithms can provide a reasonable positioning accuracy only in a uniform and dense network, while for a nonuniform network the performance is not acceptable. In this paper, we...

Full description

Saved in:
Bibliographic Details
Main Authors: Wei Wang, Haoshan Shi, Pengyu Huang, Dingyi Fang, Xiaojiang Chen, Yun Xiao, Fuping Wu
Format: Article
Language:English
Published: Wiley 2015-08-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1155/2015/317603
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Self-localization is one of the key technologies in the wireless sensor networks (WSN). Some traditional self-localization algorithms can provide a reasonable positioning accuracy only in a uniform and dense network, while for a nonuniform network the performance is not acceptable. In this paper, we presented a novel grid-based linear least squares (LLS) self-localization algorithm. The proposed algorithm uses the grid method to screen the anchors based on the distribution characteristic of a nonuniform network. Furthermore, by taking into consideration the quasi-uniform distribution of anchors in the area, we select suitable anchors to assist the localization. Simulation results demonstrate that the proposed algorithm can greatly enhance the localization accuracy of the anonymous nodes and impose less computation burden compared to traditional Trilateration and Multilateration.
ISSN:1550-1477