Mixed Convex/Non-Convex Distributed Localization Algorithm for the Deployment of Indoor Positioning Services

In this paper a fully decentralized algorithm for indoor wireless localization is presented. The algorithm combines the use of convex and non-convex optimization procedures, nested to achieve better converge towards the best positioning of a multitude of blind wireless nodes. The algorithm proceeds...

Full description

Saved in:
Bibliographic Details
Main Authors: Abramo, A., Blanchini, F., Geretti, L., Savorgnan, C.
Format: Conference Proceeding
Language:English
Subjects:
Access protocols
Cities and towns
Context awareness
Convergence
Impedance
Network topology
Peer to peer computing
Position measurement
Wireless application protocol
Wireless networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 3972
container_issue
container_start_page 3967
container_title
container_volume
creator Abramo, A.
Blanchini, F.
Geretti, L.
Savorgnan, C.
description In this paper a fully decentralized algorithm for indoor wireless localization is presented. The algorithm combines the use of convex and non-convex optimization procedures, nested to achieve better converge towards the best positioning of a multitude of blind wireless nodes. The algorithm proceeds locally on each node, based on the sole knowledge of the measured distances from, and estimated positions of, the connected nodes only. Repeated asynchronous application on each node of the local procedure guarantees hierarchical convergence of the algorithm to the positioning of the whole network, even in presence of a limited number of peripheral anchors. No global information is required for the proper functioning of the algorithm. From the theoretical standpoint, the paper introduces the geometrical definition of regular and irregular nodes, which is shown to be a useful concept, given a network topology, for the characterization of the convergence properties of the localization problem.
doi_str_mv 10.1109/ACC.2007.4282529
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4282529</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4282529</ieee_id><sourcerecordid>4282529</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-a79efdaf4dbbedd73ad0495933c6a3f88f99ecff8e3dab264d291124e53992ef3</originalsourceid><addsrcrecordid>eNo1kMluwjAURd1JKlD2lbrxDwQ8JfFbotABiQ5S2SMnfgZXIUaJi6BfXyro6l7pHN3FJeSesxHnDMaTohgJxvKRElqkAi5InyuhFAMN2SXpCZnrJNUZvyJDyPU_0-qa9FiuZMIzDrek33VfjHGAjPVI_er3aGkRmh3ux2-hSU6VTn0XW19-xyOdh8rU_sdEHxo6qVeh9XG9oS60NK6RTnFbh8MGm0iDo7PGhiP4CJ3_832zop_Y7nyF3R25cabucHjOAVk8PS6Kl2T-_jwrJvPEA4uJyQGdNU7ZskRrc2ksU5CClFVmpNPaAWDlnEZpTSkyZQVwLhSmEkCgkwPycJr1iLjctn5j2sPyfJr8BUCCXug</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Mixed Convex/Non-Convex Distributed Localization Algorithm for the Deployment of Indoor Positioning Services</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Abramo, A. ; Blanchini, F. ; Geretti, L. ; Savorgnan, C.</creator><creatorcontrib>Abramo, A. ; Blanchini, F. ; Geretti, L. ; Savorgnan, C.</creatorcontrib><description>In this paper a fully decentralized algorithm for indoor wireless localization is presented. The algorithm combines the use of convex and non-convex optimization procedures, nested to achieve better converge towards the best positioning of a multitude of blind wireless nodes. The algorithm proceeds locally on each node, based on the sole knowledge of the measured distances from, and estimated positions of, the connected nodes only. Repeated asynchronous application on each node of the local procedure guarantees hierarchical convergence of the algorithm to the positioning of the whole network, even in presence of a limited number of peripheral anchors. No global information is required for the proper functioning of the algorithm. From the theoretical standpoint, the paper introduces the geometrical definition of regular and irregular nodes, which is shown to be a useful concept, given a network topology, for the characterization of the convergence properties of the localization problem.</description><identifier>ISSN: 0743-1619</identifier><identifier>ISBN: 9781424409884</identifier><identifier>ISBN: 1424409888</identifier><identifier>EISSN: 2378-5861</identifier><identifier>EISBN: 1424409896</identifier><identifier>EISBN: 9781424409891</identifier><identifier>DOI: 10.1109/ACC.2007.4282529</identifier><language>eng</language><publisher>IEEE</publisher><subject>Access protocols ; Cities and towns ; Context awareness ; Convergence ; Impedance ; Network topology ; Peer to peer computing ; Position measurement ; Wireless application protocol ; Wireless networks</subject><ispartof>2007 American Control Conference, 2007, p.3967-3972</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4282529$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4282529$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Abramo, A.</creatorcontrib><creatorcontrib>Blanchini, F.</creatorcontrib><creatorcontrib>Geretti, L.</creatorcontrib><creatorcontrib>Savorgnan, C.</creatorcontrib><title>Mixed Convex/Non-Convex Distributed Localization Algorithm for the Deployment of Indoor Positioning Services</title><title>2007 American Control Conference</title><addtitle>ACC</addtitle><description>In this paper a fully decentralized algorithm for indoor wireless localization is presented. The algorithm combines the use of convex and non-convex optimization procedures, nested to achieve better converge towards the best positioning of a multitude of blind wireless nodes. The algorithm proceeds locally on each node, based on the sole knowledge of the measured distances from, and estimated positions of, the connected nodes only. Repeated asynchronous application on each node of the local procedure guarantees hierarchical convergence of the algorithm to the positioning of the whole network, even in presence of a limited number of peripheral anchors. No global information is required for the proper functioning of the algorithm. From the theoretical standpoint, the paper introduces the geometrical definition of regular and irregular nodes, which is shown to be a useful concept, given a network topology, for the characterization of the convergence properties of the localization problem.</description><subject>Access protocols</subject><subject>Cities and towns</subject><subject>Context awareness</subject><subject>Convergence</subject><subject>Impedance</subject><subject>Network topology</subject><subject>Peer to peer computing</subject><subject>Position measurement</subject><subject>Wireless application protocol</subject><subject>Wireless networks</subject><issn>0743-1619</issn><issn>2378-5861</issn><isbn>9781424409884</isbn><isbn>1424409888</isbn><isbn>1424409896</isbn><isbn>9781424409891</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1kMluwjAURd1JKlD2lbrxDwQ8JfFbotABiQ5S2SMnfgZXIUaJi6BfXyro6l7pHN3FJeSesxHnDMaTohgJxvKRElqkAi5InyuhFAMN2SXpCZnrJNUZvyJDyPU_0-qa9FiuZMIzDrek33VfjHGAjPVI_er3aGkRmh3ux2-hSU6VTn0XW19-xyOdh8rU_sdEHxo6qVeh9XG9oS60NK6RTnFbh8MGm0iDo7PGhiP4CJ3_832zop_Y7nyF3R25cabucHjOAVk8PS6Kl2T-_jwrJvPEA4uJyQGdNU7ZskRrc2ksU5CClFVmpNPaAWDlnEZpTSkyZQVwLhSmEkCgkwPycJr1iLjctn5j2sPyfJr8BUCCXug</recordid><startdate>200707</startdate><enddate>200707</enddate><creator>Abramo, A.</creator><creator>Blanchini, F.</creator><creator>Geretti, L.</creator><creator>Savorgnan, C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200707</creationdate><title>Mixed Convex/Non-Convex Distributed Localization Algorithm for the Deployment of Indoor Positioning Services</title><author>Abramo, A. ; Blanchini, F. ; Geretti, L. ; Savorgnan, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-a79efdaf4dbbedd73ad0495933c6a3f88f99ecff8e3dab264d291124e53992ef3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Access protocols</topic><topic>Cities and towns</topic><topic>Context awareness</topic><topic>Convergence</topic><topic>Impedance</topic><topic>Network topology</topic><topic>Peer to peer computing</topic><topic>Position measurement</topic><topic>Wireless application protocol</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Abramo, A.</creatorcontrib><creatorcontrib>Blanchini, F.</creatorcontrib><creatorcontrib>Geretti, L.</creatorcontrib><creatorcontrib>Savorgnan, C.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEL</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Abramo, A.</au><au>Blanchini, F.</au><au>Geretti, L.</au><au>Savorgnan, C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Mixed Convex/Non-Convex Distributed Localization Algorithm for the Deployment of Indoor Positioning Services</atitle><btitle>2007 American Control Conference</btitle><stitle>ACC</stitle><date>2007-07</date><risdate>2007</risdate><spage>3967</spage><epage>3972</epage><pages>3967-3972</pages><issn>0743-1619</issn><eissn>2378-5861</eissn><isbn>9781424409884</isbn><isbn>1424409888</isbn><eisbn>1424409896</eisbn><eisbn>9781424409891</eisbn><abstract>In this paper a fully decentralized algorithm for indoor wireless localization is presented. The algorithm combines the use of convex and non-convex optimization procedures, nested to achieve better converge towards the best positioning of a multitude of blind wireless nodes. The algorithm proceeds locally on each node, based on the sole knowledge of the measured distances from, and estimated positions of, the connected nodes only. Repeated asynchronous application on each node of the local procedure guarantees hierarchical convergence of the algorithm to the positioning of the whole network, even in presence of a limited number of peripheral anchors. No global information is required for the proper functioning of the algorithm. From the theoretical standpoint, the paper introduces the geometrical definition of regular and irregular nodes, which is shown to be a useful concept, given a network topology, for the characterization of the convergence properties of the localization problem.</abstract><pub>IEEE</pub><doi>10.1109/ACC.2007.4282529</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0743-1619
ispartof 2007 American Control Conference, 2007, p.3967-3972
issn 0743-1619
2378-5861
language eng
recordid cdi_ieee_primary_4282529
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Access protocols
Cities and towns
Context awareness
Convergence
Impedance
Network topology
Peer to peer computing
Position measurement
Wireless application protocol
Wireless networks
title Mixed Convex/Non-Convex Distributed Localization Algorithm for the Deployment of Indoor Positioning Services
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T15%3A57%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Mixed%20Convex/Non-Convex%20Distributed%20Localization%20Algorithm%20for%20the%20Deployment%20of%20Indoor%20Positioning%20Services&rft.btitle=2007%20American%20Control%20Conference&rft.au=Abramo,%20A.&rft.date=2007-07&rft.spage=3967&rft.epage=3972&rft.pages=3967-3972&rft.issn=0743-1619&rft.eissn=2378-5861&rft.isbn=9781424409884&rft.isbn_list=1424409888&rft_id=info:doi/10.1109/ACC.2007.4282529&rft.eisbn=1424409896&rft.eisbn_list=9781424409891&rft_dat=%3Cieee_6IE%3E4282529%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-a79efdaf4dbbedd73ad0495933c6a3f88f99ecff8e3dab264d291124e53992ef3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4282529&rfr_iscdi=true