ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 The Effects of Stitching Orders in Patch-and-Stitch WSN Localization Algorithms
Cited 17 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
권오흠, 송하주, 박상준
발행일
200909
출처
IEEE Transactions on Parallel and Distributed Systems, v.20 no.9, pp.1380-1391
ISSN
1045-9219
출판사
IEEE
DOI
https://dx.doi.org/10.1109/TPDS.2008.226
협약과제
08DC1100, 감시정찰 센서네트워크 개발, 박상준
초록
A "patch-and-stitch" localization algorithm divides the network into small overlapping subregions. Typically, each subregion consists of a node and all or some of its neighbors. For each subregion, the algorithm builds a local map, called a patch, which is actually an embedding of the nodes it spans in a relative coordinate system. Finally, the algorithm stitches those patches to form a single global map. In a patch-and-stitch algorithm, the stitching order makes an influence on both the performance and the complexity of the algorithm. In this paper, we present a formal framework to deal with stitching orders in patch-and-stitch localization algorithms. In our framework, the stitching order is determined by a stitching scheme and the stitching scheme consists of a stitching policy and a potential function. The potential function is to predict how well a patch will be stitched if patches are stitched according to a given partial order. The stitching policy is a mechanism that determines the stitching order based on the predictions by the potential function. We present various stitching schemes and evaluate them through simulations. In addition, we apply the patch-and-stitch strategy into the anchor-based localization and propose a clustering-based localization algorithm. A potential function is used to partition the network into clusters each of which is centered at an anchor node. For each cluster, a cluster map is constructed via the anchor-free localization algorithm. Then, those cluster maps are combined to form a single global map. We propose a stitching technique for combining those cluster maps and analyze the performance of the algorithm by simulations. © 2009 IEEE.
키워드
Distributed algorithms, Localization algorithm, Patch-and-stitch strategy, Wireless sensor network
KSP 제안 키워드
Anchor-based, Anchor-free localization, Cluster maps, Coordinate system, Distributed algorithm, Partial order, Relative coordinates, Stitching technique, WSN localization, Wireless sensor networks(WSNs), anchor nodes