This Article 
 Bibliographic References 
 Add to: 
The Effects of Stitching Orders in Patch-and-Stitch WSN Localization Algorithms
September 2009 (vol. 20 no. 9)
pp. 1380-1391
Oh-Heum Kwon, Pukyong National University, Pusan
Ha-Joo Song, Pukyong National University, Pusan
Sangjoon Park, Electronics and Telecommunications Research Institute (ETRI), Daejeon
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.

[1] J. Bachrach and C. Taylor, “Localization in Sensor Networks,” Handbook of Sensor Networks: Algorithms and Architectures. Wiley, 2005.
[2] T. Cox and M. Cox, Multidimensional Scaling, second ed. Chapman & Hall, 2001.
[3] I. Cidon and O. Mokryn, “Propagation and Leader Election in a Multihop Broadcast Environment,” Proc. 12th Int'l Symp. Distributed Computing (DISC), 1998.
[4] B.K.P. Horn, H. Hilden, and S. Negahdaripour, “Closed-Form Solution of Absolute Orientation Using Orthonormal Matrices,” J.Optical Soc. Am. A, vol. 5, no. 7, 1988.
[5] X. Ji and H. Zha, “Sensor Positioning in Wireless Ad Hoc Networks Using Multidimensional Scaling,” Proc. IEEE INFOCOM, 2004.
[6] L. Meertens and S. Fitzpatrick, The Distributed Construction of a Global Coordinate System in a Network of Static Computational Nodes from Inter-Node Distances, Kestrel Inst. TR KES.U.04.04, 2004.
[7] D. Moore, J. Leonard, D. Rus, and S. Teller, “Robust Distributed Network Localization with Noisy Range Measurements,” Proc. Second Int'l Conf. Embedded Networked Sensor Systems (ACM SenSys '04), Nov. 2004.
[8] D. Niculescu and B. Nath, “DV Based Positioning in Ad Hoc Networks,” Telecomm. Systems, vol. 22, nos. 1-4, pp. 267-280, 2003.
[9] O.-H. Kwon and H.-J. Song, “Localization through Map Stitching in Wireless Sensor Networks,” IEEE Trans. Parallel and Distributed Systems, Jan. 2008.
[10] O.-H. Kwon and H.-J. Song, “Stitching Orders in Patch-and-Stitch Localization Algorithms for Wireless Sensor Networks,” Proc. Fifth Workshop Positioning, Navigation and Comm. (WPNC '08), Mar. 2008.
[11] N.B. Priyantha, H. Balakrishnan, E. Demaine, and S. Teller, Anchor-Free Distributed Localization in Sensor Networks, MIT Laboratory for Computer Science, TR 892, Apr. 2003.
[12] A. Savvides, C.-C. Han, and M.B. Srivastava, “Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors,” Proc. MobiCom '01, July 2001.
[13] Y. Shang and W. Ruml, “Improved MDS-Based Localization,” Proc. IEEE INFOCOM, 2004.
[14] C. Savarese, J.M. Rabaey, and J. Beutel, “Locationing in Distributed Ad-Hoc Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing (ICASSP '01), May 2001.

Index Terms:
Wireless sensor network, localization algorithm, distributed algorithms, patch-and-stitch strategy.
Oh-Heum Kwon, Ha-Joo Song, Sangjoon Park, "The Effects of Stitching Orders in Patch-and-Stitch WSN Localization Algorithms," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 9, pp. 1380-1391, Sept. 2009, doi:10.1109/TPDS.2008.226
Usage of this product signifies your acceptance of the Terms of Use.