Please use this identifier to cite or link to this item:
Title: Connectivity-based skeleton extraction in wireless sensor networks
Authors: Jiang, H
Liu, W
Wang, D 
Tian, C
Bai, X
Liu, X
Wu, Y
Liu, W
Keywords: Algorithm/protocol design
Sensor networks
Skeleton extraction
Issue Date: 2010
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on parallel and distributed systems, 2010, v. 21, no. 5, 5159344, p. 710-721 How to cite?
Journal: IEEE transactions on parallel and distributed systems 
Abstract: Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction for the topology has shown great impact on the performance of such services as location, routing, and path planning in wireless sensor networks. Nonetheless, current studies focus on using skeleton extraction for various applications in wireless sensor networks. How to achieve a better skeleton extraction has not been thoroughly investigated. There are studies on skeleton extraction from the computer vision community; their centralized algorithms for continuous space, however, are not immediately applicable for the discrete and distributed wireless sensor networks. In this paper, we present a novel Connectivity-bAsed Skeleton Extraction (CASE) algorithm to compute skeleton graph that is robust to noise, and accurate in preservation of the original topology. In addition, CASE is distributed as no centralized operation is required, and is scalable as both its time complexity and its message complexity are linearly proportional to the network size. The skeleton graph is extracted by partitioning the boundary of the sensor network to identify the skeleton points, then generating the skeleton arcs, connecting these arcs, and finally refining the coarse skeleton graph. We believe that CASE has broad applications and present a skeleton-assisted segmentation algorithm as an example. Our evaluation shows that CASE is able to extract a well-connected skeleton graph in the presence of significant noise and shape variations, and outperforms the state-of-the-art algorithms.
ISSN: 1045-9219
EISSN: 1558-2183
DOI: 10.1109/TPDS.2009.109
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 10, 2018


Last Week
Last month
Citations as of May 31, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 12, 2018

Google ScholarTM



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