Pascal’s triangle-based range-free localization for anisotropic wireless networks

This paper introduces a Pascal’s triangle model to draw the potential locations and their probabilities for a normal node given the hop counts to the anchors according to the extent of detour of the shortest paths. Based on our proposed model, a Pascal’s triangle-based localization (PTL) algorithm u...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks 2016-10, Vol.22 (7), p.2221-2238
Main Authors: Lee, Sangwoo, Jin, Myungjun, Koo, Bonhyun, Sin, Cheonsig, Kim, Sunwoo
Format: Article
Language:English
Subjects:
Accuracy
Algorithms
Analysis
Anchors
Anisotropy
Communication
Communications Engineering
Computer Communication Networks
Connectivity
Electrical Engineering
Engineering
Estimates
IT in Business
Localization
Matlab
Networks
Pascal (programming language)
Performance evaluation
Position (location)
Sensors
Studies
Wireless 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:This paper introduces a Pascal’s triangle model to draw the potential locations and their probabilities for a normal node given the hop counts to the anchors according to the extent of detour of the shortest paths. Based on our proposed model, a Pascal’s triangle-based localization (PTL) algorithm using local connectivity information is presented for anisotropic wireless networks with a small number of anchors. The superiority of the PTL algorithm has been validated over the state-of-the-art algorithms through MATLAB simulations. We have shown that compared to the other algorithms, the PTL algorithm achieves higher localization accuracy with even fewer anchors. We have also validated the performance of the PTL algorithm in a real environment.
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-015-1095-9