Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/61113
Title: An approximate convex decomposition protocol for wireless sensor network localization in arbitrary-shaped fields
Authors: Liu, W
Wang, D 
Jiang, H
Liu, W
Wang, C
Keywords: Approximate convex decomposition
Localization
Wireless sensor networks
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on parallel and distributed systems, 2015, v. 26, no. 12, 7000585, p. 3264-3274 How to cite?
Journal: IEEE transactions on parallel and distributed systems 
Abstract: Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. In this paper, we develop a new localization protocol based on approximate convex decomposition (ACDL), with reliance on network connectivity information only. ACDL can calculate the node virtual locations for a large-scale sensor network with a complex shape. We first examine one representative localization algorithm and study the influential factors on the localization accuracy, including the sharpness of the angle at the concave point and the depth of the concave valley. We show that after decomposition, the depth of the concave valley becomes irrelevant. We thus define the concavity according to the angle at a concave point, which reflects the localization error. We then propose ACDL protocol for network localization. It consists of four main steps. First, convex and concave nodes are recognized and network boundaries are segmented. As the sensor network is discrete, we show that it is acceptable to approximately identify the concave nodes to control the localization error. Second, an approximate convex decomposition is conducted. Our convex decomposition requires only local information and we show that it has low message overhead. Third, for each convex section of the network, an improved MDS algorithm is proposed to compute a relative location map. Fourth, a fast and low complexity merging algorithm is developed to construct the global location map. Besides, by slight modification on the third step, we propose a variant of ACDL, denoted by ACDL-Tri, which is fully distributed and scalable while the localization accuracy is still comparable. We finally show the efficiency of ACDL by extensive simulations.
URI: http://hdl.handle.net/10397/61113
ISSN: 1045-9219
EISSN: 1558-2183
DOI: 10.1109/TPDS.2014.2383031
Appears in Collections:Journal/Magazine Article

SFX Query Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Dec 9, 2017

Page view(s)

26
Last Week
1
Last month
Citations as of Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.