DisLoc: A Convex Partitioning Based Approach for Distributed 3-D Localization in Wireless Sensor Networks
Accurate localization in wireless sensor networks (WSNs) is fundamental to many applications, such as geographic routing and position-aware data processing. This, however, is challenging in large scale 3-D WSNs due to the irregular topology, such as holes in the path, of the network. The irregular t...
Gespeichert in:
Veröffentlicht in: | IEEE sensors journal 2017-12, Vol.17 (24), p.8412-8423 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 8423 |
---|---|
container_issue | 24 |
container_start_page | 8412 |
container_title | IEEE sensors journal |
container_volume | 17 |
creator | Jin Fan Yidan Hu Luan, Tom H. Mianxiong Dong |
description | Accurate localization in wireless sensor networks (WSNs) is fundamental to many applications, such as geographic routing and position-aware data processing. This, however, is challenging in large scale 3-D WSNs due to the irregular topology, such as holes in the path, of the network. The irregular topology may cause overestimated Euclidean distance between nodes as the communication path is bent and accordingly introduces severe errors in 3-D WSN localization. As an effort towards the issue, this paper develops a distributed algorithm to achieve accurate 3-D WSN localization. Our proposal is composed of two steps, segmentation and joint localization. In specific, the entire network is first divided into several subnetworks by applying the approximate convex partitioning. A spatial convex node recognition mechanism is developed to assist the network segmentation, which relies on the connectivity information only. After that, each subnetwork is accurately localized by using the multidimensional scaling-based algorithm. The proposed localization algorithm also applies a new 3-D coordinate transformation algorithm, which helps reduce the errors introduced by coordinate integration between subnetworks and improve the localization accuracy. Using extensive simulations, we show that our proposal can effectively segment a complex 3-D sensor network and significantly improve the localization rate in comparison with existing solutions. |
doi_str_mv | 10.1109/JSEN.2017.2763155 |
format | Article |
fullrecord | <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_JSEN_2017_2763155</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8068189</ieee_id><sourcerecordid>10_1109_JSEN_2017_2763155</sourcerecordid><originalsourceid>FETCH-LOGICAL-c418t-139c8dff2ca5957dbca39f5af3359bc4ff0bb00abb9f629135c95e643d3fbf133</originalsourceid><addsrcrecordid>eNo9kMtOwzAQRS0EEqXwAYiNfyDFzsSxza605aWqIBUEu8h2bDCUuLLD8-tJ1IrNzEj3nlkchI4pGVFK5OnNcrYY5YTyUc5LoIztoEE3RUZ5IXb7G0hWAH_aRwcpvRJCJWd8gPzUp3kwZ3iMJ6H5tN_4TsXWtz40vnnG5yrZGo_X6xiUecEuRNwBbfT6o-0CyKa4o9XK_6oewb7Bjz7alU0JL22Tuv7Ctl8hvqVDtOfUKtmj7R6ih4vZ_eQqm99eXk_G88wUVLQZBWlE7VxuFJOM19ookI4pB8CkNoVzRGtClNbSlbmkwIxktiygBqcdBRgiuvlrYkgpWleto39X8aeipOpdVb2rqndVbV11zMmG8dba_74gpaBCwh8pS2dG</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>DisLoc: A Convex Partitioning Based Approach for Distributed 3-D Localization in Wireless Sensor Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Jin Fan ; Yidan Hu ; Luan, Tom H. ; Mianxiong Dong</creator><creatorcontrib>Jin Fan ; Yidan Hu ; Luan, Tom H. ; Mianxiong Dong</creatorcontrib><description>Accurate localization in wireless sensor networks (WSNs) is fundamental to many applications, such as geographic routing and position-aware data processing. This, however, is challenging in large scale 3-D WSNs due to the irregular topology, such as holes in the path, of the network. The irregular topology may cause overestimated Euclidean distance between nodes as the communication path is bent and accordingly introduces severe errors in 3-D WSN localization. As an effort towards the issue, this paper develops a distributed algorithm to achieve accurate 3-D WSN localization. Our proposal is composed of two steps, segmentation and joint localization. In specific, the entire network is first divided into several subnetworks by applying the approximate convex partitioning. A spatial convex node recognition mechanism is developed to assist the network segmentation, which relies on the connectivity information only. After that, each subnetwork is accurately localized by using the multidimensional scaling-based algorithm. The proposed localization algorithm also applies a new 3-D coordinate transformation algorithm, which helps reduce the errors introduced by coordinate integration between subnetworks and improve the localization accuracy. Using extensive simulations, we show that our proposal can effectively segment a complex 3-D sensor network and significantly improve the localization rate in comparison with existing solutions.</description><identifier>ISSN: 1530-437X</identifier><identifier>EISSN: 1558-1748</identifier><identifier>DOI: 10.1109/JSEN.2017.2763155</identifier><identifier>CODEN: ISJEAZ</identifier><language>eng</language><publisher>IEEE</publisher><subject>3D wireless sensor networks ; Convex partition ; localization ; Network topology ; Partitioning algorithms ; Three-dimensional displays ; Wireless sensor networks</subject><ispartof>IEEE sensors journal, 2017-12, Vol.17 (24), p.8412-8423</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c418t-139c8dff2ca5957dbca39f5af3359bc4ff0bb00abb9f629135c95e643d3fbf133</citedby><cites>FETCH-LOGICAL-c418t-139c8dff2ca5957dbca39f5af3359bc4ff0bb00abb9f629135c95e643d3fbf133</cites><orcidid>0000-0002-9443-8411 ; 0000-0002-2788-3451</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8068189$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8068189$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jin Fan</creatorcontrib><creatorcontrib>Yidan Hu</creatorcontrib><creatorcontrib>Luan, Tom H.</creatorcontrib><creatorcontrib>Mianxiong Dong</creatorcontrib><title>DisLoc: A Convex Partitioning Based Approach for Distributed 3-D Localization in Wireless Sensor Networks</title><title>IEEE sensors journal</title><addtitle>JSEN</addtitle><description>Accurate localization in wireless sensor networks (WSNs) is fundamental to many applications, such as geographic routing and position-aware data processing. This, however, is challenging in large scale 3-D WSNs due to the irregular topology, such as holes in the path, of the network. The irregular topology may cause overestimated Euclidean distance between nodes as the communication path is bent and accordingly introduces severe errors in 3-D WSN localization. As an effort towards the issue, this paper develops a distributed algorithm to achieve accurate 3-D WSN localization. Our proposal is composed of two steps, segmentation and joint localization. In specific, the entire network is first divided into several subnetworks by applying the approximate convex partitioning. A spatial convex node recognition mechanism is developed to assist the network segmentation, which relies on the connectivity information only. After that, each subnetwork is accurately localized by using the multidimensional scaling-based algorithm. The proposed localization algorithm also applies a new 3-D coordinate transformation algorithm, which helps reduce the errors introduced by coordinate integration between subnetworks and improve the localization accuracy. Using extensive simulations, we show that our proposal can effectively segment a complex 3-D sensor network and significantly improve the localization rate in comparison with existing solutions.</description><subject>3D wireless sensor networks</subject><subject>Convex partition</subject><subject>localization</subject><subject>Network topology</subject><subject>Partitioning algorithms</subject><subject>Three-dimensional displays</subject><subject>Wireless sensor networks</subject><issn>1530-437X</issn><issn>1558-1748</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMtOwzAQRS0EEqXwAYiNfyDFzsSxza605aWqIBUEu8h2bDCUuLLD8-tJ1IrNzEj3nlkchI4pGVFK5OnNcrYY5YTyUc5LoIztoEE3RUZ5IXb7G0hWAH_aRwcpvRJCJWd8gPzUp3kwZ3iMJ6H5tN_4TsXWtz40vnnG5yrZGo_X6xiUecEuRNwBbfT6o-0CyKa4o9XK_6oewb7Bjz7alU0JL22Tuv7Ctl8hvqVDtOfUKtmj7R6ih4vZ_eQqm99eXk_G88wUVLQZBWlE7VxuFJOM19ookI4pB8CkNoVzRGtClNbSlbmkwIxktiygBqcdBRgiuvlrYkgpWleto39X8aeipOpdVb2rqndVbV11zMmG8dba_74gpaBCwh8pS2dG</recordid><startdate>20171215</startdate><enddate>20171215</enddate><creator>Jin Fan</creator><creator>Yidan Hu</creator><creator>Luan, Tom H.</creator><creator>Mianxiong Dong</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-9443-8411</orcidid><orcidid>https://orcid.org/0000-0002-2788-3451</orcidid></search><sort><creationdate>20171215</creationdate><title>DisLoc: A Convex Partitioning Based Approach for Distributed 3-D Localization in Wireless Sensor Networks</title><author>Jin Fan ; Yidan Hu ; Luan, Tom H. ; Mianxiong Dong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c418t-139c8dff2ca5957dbca39f5af3359bc4ff0bb00abb9f629135c95e643d3fbf133</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>3D wireless sensor networks</topic><topic>Convex partition</topic><topic>localization</topic><topic>Network topology</topic><topic>Partitioning algorithms</topic><topic>Three-dimensional displays</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jin Fan</creatorcontrib><creatorcontrib>Yidan Hu</creatorcontrib><creatorcontrib>Luan, Tom H.</creatorcontrib><creatorcontrib>Mianxiong Dong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><jtitle>IEEE sensors journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jin Fan</au><au>Yidan Hu</au><au>Luan, Tom H.</au><au>Mianxiong Dong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>DisLoc: A Convex Partitioning Based Approach for Distributed 3-D Localization in Wireless Sensor Networks</atitle><jtitle>IEEE sensors journal</jtitle><stitle>JSEN</stitle><date>2017-12-15</date><risdate>2017</risdate><volume>17</volume><issue>24</issue><spage>8412</spage><epage>8423</epage><pages>8412-8423</pages><issn>1530-437X</issn><eissn>1558-1748</eissn><coden>ISJEAZ</coden><abstract>Accurate localization in wireless sensor networks (WSNs) is fundamental to many applications, such as geographic routing and position-aware data processing. This, however, is challenging in large scale 3-D WSNs due to the irregular topology, such as holes in the path, of the network. The irregular topology may cause overestimated Euclidean distance between nodes as the communication path is bent and accordingly introduces severe errors in 3-D WSN localization. As an effort towards the issue, this paper develops a distributed algorithm to achieve accurate 3-D WSN localization. Our proposal is composed of two steps, segmentation and joint localization. In specific, the entire network is first divided into several subnetworks by applying the approximate convex partitioning. A spatial convex node recognition mechanism is developed to assist the network segmentation, which relies on the connectivity information only. After that, each subnetwork is accurately localized by using the multidimensional scaling-based algorithm. The proposed localization algorithm also applies a new 3-D coordinate transformation algorithm, which helps reduce the errors introduced by coordinate integration between subnetworks and improve the localization accuracy. Using extensive simulations, we show that our proposal can effectively segment a complex 3-D sensor network and significantly improve the localization rate in comparison with existing solutions.</abstract><pub>IEEE</pub><doi>10.1109/JSEN.2017.2763155</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0002-9443-8411</orcidid><orcidid>https://orcid.org/0000-0002-2788-3451</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1530-437X |
ispartof | IEEE sensors journal, 2017-12, Vol.17 (24), p.8412-8423 |
issn | 1530-437X 1558-1748 |
language | eng |
recordid | cdi_crossref_primary_10_1109_JSEN_2017_2763155 |
source | IEEE Electronic Library (IEL) |
subjects | 3D wireless sensor networks Convex partition localization Network topology Partitioning algorithms Three-dimensional displays Wireless sensor networks |
title | DisLoc: A Convex Partitioning Based Approach for Distributed 3-D Localization in Wireless Sensor Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T00%3A05%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=DisLoc:%20A%20Convex%20Partitioning%20Based%20Approach%20for%20Distributed%203-D%20Localization%20in%20Wireless%20Sensor%20Networks&rft.jtitle=IEEE%20sensors%20journal&rft.au=Jin%20Fan&rft.date=2017-12-15&rft.volume=17&rft.issue=24&rft.spage=8412&rft.epage=8423&rft.pages=8412-8423&rft.issn=1530-437X&rft.eissn=1558-1748&rft.coden=ISJEAZ&rft_id=info:doi/10.1109/JSEN.2017.2763155&rft_dat=%3Ccrossref_RIE%3E10_1109_JSEN_2017_2763155%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8068189&rfr_iscdi=true |