Localization through Map Stitching in Wireless Sensor Networks

Node localization is an essential problem in ad hoc wireless sensor networks. Map stitching is a type of localization algorithm that has received a great deal of attention recently. In this algorithm, the network is divided into small overlapping sub-regions, each of which creates a local map. Then,...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2008-01, Vol.19 (1), p.93-105
Main Authors: Kwon, Oh-Heum, Song, Ha-Joo
Format: Article
Language:English
Subjects:
Algorithms
Computer networks
Computer Society
Costs
Distributed algorithms
Energy consumption
Global Positioning System
Localization
localization algorithm
location identification
Monitoring
Networks
Performance enhancement
Position (location)
Query processing
Routing protocols
Sensor systems
Sensors
Stitching
wireless sensor network
Wireless sensor 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!
cited_by cdi_FETCH-LOGICAL-c383t-2e2651da02efa0b096091c4139bd18a73cb47275ca9a9eb9e099148f331d91b23
cites cdi_FETCH-LOGICAL-c383t-2e2651da02efa0b096091c4139bd18a73cb47275ca9a9eb9e099148f331d91b23
container_end_page 105
container_issue 1
container_start_page 93
container_title IEEE transactions on parallel and distributed systems
container_volume 19
creator Kwon, Oh-Heum
Song, Ha-Joo
description Node localization is an essential problem in ad hoc wireless sensor networks. Map stitching is a type of localization algorithm that has received a great deal of attention recently. In this algorithm, the network is divided into small overlapping sub-regions, each of which creates a local map. Then, the local maps are stitched together to form a single global map. In this paper, we first propose a new technique for map-to-map stitching that exploits every available distances between two maps. Next, we propose a few anchor-free localization algorithms based on our stitching technique. We experimentally studied the performance of our algorithms under various settings. The results show that our method achieves a significant performance improvement upon the existing method.
doi_str_mv 10.1109/TPDS.2007.70706
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_proquest_miscellaneous_34441126</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4359408</ieee_id><sourcerecordid>2545085461</sourcerecordid><originalsourceid>FETCH-LOGICAL-c383t-2e2651da02efa0b096091c4139bd18a73cb47275ca9a9eb9e099148f331d91b23</originalsourceid><addsrcrecordid>eNqFkTtPwzAUhS0EEqUwM7BEDDClvdd2Hl6QUHlK5SG1iNFyUqd1SeNiJ0Lw60koYmCA6Z7hO0e6-gg5RBggghhOHy8mAwqQDBJIIN4iPYyiNKSYsu02A49CQVHskj3vlwDII-A9cja2uSrNh6qNrYJ64WwzXwR3ah1MalPnC1PNA1MFz8bpUnsfTHTlrQvudf1m3YvfJzuFKr0--L598nR1OR3dhOOH69vR-TjMWcrqkGoaRzhTQHWhIAMRg8CcIxPZDFOVsDzjCU2iXAkldCY0CIE8LRjDmcCMsj453eyunX1ttK_lyvhcl6WqtG28FMBiipTF_5JpEoGgjEFLnvxJMs45Iu0mj3-BS9u4qv1XCqQ0SWmMLTTcQLmz3jtdyLUzK-XeJYLsBMlOkOwEyS9BbeNo0zBa6x-as0hwSNkn5FWJ-Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>912278261</pqid></control><display><type>article</type><title>Localization through Map Stitching in Wireless Sensor Networks</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Kwon, Oh-Heum ; Song, Ha-Joo</creator><creatorcontrib>Kwon, Oh-Heum ; Song, Ha-Joo</creatorcontrib><description>Node localization is an essential problem in ad hoc wireless sensor networks. Map stitching is a type of localization algorithm that has received a great deal of attention recently. In this algorithm, the network is divided into small overlapping sub-regions, each of which creates a local map. Then, the local maps are stitched together to form a single global map. In this paper, we first propose a new technique for map-to-map stitching that exploits every available distances between two maps. Next, we propose a few anchor-free localization algorithms based on our stitching technique. We experimentally studied the performance of our algorithms under various settings. The results show that our method achieves a significant performance improvement upon the existing method.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/TPDS.2007.70706</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Computer networks ; Computer Society ; Costs ; Distributed algorithms ; Energy consumption ; Global Positioning System ; Localization ; localization algorithm ; location identification ; Monitoring ; Networks ; Performance enhancement ; Position (location) ; Query processing ; Routing protocols ; Sensor systems ; Sensors ; Stitching ; wireless sensor network ; Wireless sensor networks</subject><ispartof>IEEE transactions on parallel and distributed systems, 2008-01, Vol.19 (1), p.93-105</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c383t-2e2651da02efa0b096091c4139bd18a73cb47275ca9a9eb9e099148f331d91b23</citedby><cites>FETCH-LOGICAL-c383t-2e2651da02efa0b096091c4139bd18a73cb47275ca9a9eb9e099148f331d91b23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4359408$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27922,27923,54794</link.rule.ids></links><search><creatorcontrib>Kwon, Oh-Heum</creatorcontrib><creatorcontrib>Song, Ha-Joo</creatorcontrib><title>Localization through Map Stitching in Wireless Sensor Networks</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>Node localization is an essential problem in ad hoc wireless sensor networks. Map stitching is a type of localization algorithm that has received a great deal of attention recently. In this algorithm, the network is divided into small overlapping sub-regions, each of which creates a local map. Then, the local maps are stitched together to form a single global map. In this paper, we first propose a new technique for map-to-map stitching that exploits every available distances between two maps. Next, we propose a few anchor-free localization algorithms based on our stitching technique. We experimentally studied the performance of our algorithms under various settings. The results show that our method achieves a significant performance improvement upon the existing method.</description><subject>Algorithms</subject><subject>Computer networks</subject><subject>Computer Society</subject><subject>Costs</subject><subject>Distributed algorithms</subject><subject>Energy consumption</subject><subject>Global Positioning System</subject><subject>Localization</subject><subject>localization algorithm</subject><subject>location identification</subject><subject>Monitoring</subject><subject>Networks</subject><subject>Performance enhancement</subject><subject>Position (location)</subject><subject>Query processing</subject><subject>Routing protocols</subject><subject>Sensor systems</subject><subject>Sensors</subject><subject>Stitching</subject><subject>wireless sensor network</subject><subject>Wireless sensor networks</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNqFkTtPwzAUhS0EEqUwM7BEDDClvdd2Hl6QUHlK5SG1iNFyUqd1SeNiJ0Lw60koYmCA6Z7hO0e6-gg5RBggghhOHy8mAwqQDBJIIN4iPYyiNKSYsu02A49CQVHskj3vlwDII-A9cja2uSrNh6qNrYJ64WwzXwR3ah1MalPnC1PNA1MFz8bpUnsfTHTlrQvudf1m3YvfJzuFKr0--L598nR1OR3dhOOH69vR-TjMWcrqkGoaRzhTQHWhIAMRg8CcIxPZDFOVsDzjCU2iXAkldCY0CIE8LRjDmcCMsj453eyunX1ttK_lyvhcl6WqtG28FMBiipTF_5JpEoGgjEFLnvxJMs45Iu0mj3-BS9u4qv1XCqQ0SWmMLTTcQLmz3jtdyLUzK-XeJYLsBMlOkOwEyS9BbeNo0zBa6x-as0hwSNkn5FWJ-Q</recordid><startdate>200801</startdate><enddate>200801</enddate><creator>Kwon, Oh-Heum</creator><creator>Song, Ha-Joo</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>200801</creationdate><title>Localization through Map Stitching in Wireless Sensor Networks</title><author>Kwon, Oh-Heum ; Song, Ha-Joo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c383t-2e2651da02efa0b096091c4139bd18a73cb47275ca9a9eb9e099148f331d91b23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithms</topic><topic>Computer networks</topic><topic>Computer Society</topic><topic>Costs</topic><topic>Distributed algorithms</topic><topic>Energy consumption</topic><topic>Global Positioning System</topic><topic>Localization</topic><topic>localization algorithm</topic><topic>location identification</topic><topic>Monitoring</topic><topic>Networks</topic><topic>Performance enhancement</topic><topic>Position (location)</topic><topic>Query processing</topic><topic>Routing protocols</topic><topic>Sensor systems</topic><topic>Sensors</topic><topic>Stitching</topic><topic>wireless sensor network</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kwon, Oh-Heum</creatorcontrib><creatorcontrib>Song, Ha-Joo</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kwon, Oh-Heum</au><au>Song, Ha-Joo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Localization through Map Stitching in Wireless Sensor Networks</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>2008-01</date><risdate>2008</risdate><volume>19</volume><issue>1</issue><spage>93</spage><epage>105</epage><pages>93-105</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>Node localization is an essential problem in ad hoc wireless sensor networks. Map stitching is a type of localization algorithm that has received a great deal of attention recently. In this algorithm, the network is divided into small overlapping sub-regions, each of which creates a local map. Then, the local maps are stitched together to form a single global map. In this paper, we first propose a new technique for map-to-map stitching that exploits every available distances between two maps. Next, we propose a few anchor-free localization algorithms based on our stitching technique. We experimentally studied the performance of our algorithms under various settings. The results show that our method achieves a significant performance improvement upon the existing method.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TPDS.2007.70706</doi><tpages>13</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1045-9219
ispartof IEEE transactions on parallel and distributed systems, 2008-01, Vol.19 (1), p.93-105
issn 1045-9219
1558-2183
language eng
recordid cdi_proquest_miscellaneous_34441126
source IEEE Electronic Library (IEL) Journals
subjects Algorithms
Computer networks
Computer Society
Costs
Distributed algorithms
Energy consumption
Global Positioning System
Localization
localization algorithm
location identification
Monitoring
Networks
Performance enhancement
Position (location)
Query processing
Routing protocols
Sensor systems
Sensors
Stitching
wireless sensor network
Wireless sensor networks
title Localization through Map Stitching in Wireless Sensor Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T10%3A02%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Localization%20through%20Map%20Stitching%20in%20Wireless%20Sensor%20Networks&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Kwon,%20Oh-Heum&rft.date=2008-01&rft.volume=19&rft.issue=1&rft.spage=93&rft.epage=105&rft.pages=93-105&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/TPDS.2007.70706&rft_dat=%3Cproquest_ieee_%3E2545085461%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c383t-2e2651da02efa0b096091c4139bd18a73cb47275ca9a9eb9e099148f331d91b23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=912278261&rft_id=info:pmid/&rft_ieee_id=4359408&rfr_iscdi=true