A Theory of Network Localization
In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigi...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on mobile computing 2006-12, Vol.5 (12), p.1663-1678 |
|---|---|
| Hauptverfasser: | , , , , , , , |
| Format: | Magazinearticle |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1678 |
|---|---|
| container_issue | 12 |
| container_start_page | 1663 |
| container_title | IEEE transactions on mobile computing |
| container_volume | 5 |
| creator | Aspnes, J. Eren, T. Goldenberg, D.K. Morse, A.S. Whiteley, W. Yang, Y.R. Anderson, B.D.O. Belhumeur, P.N. |
| description | In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly |
| doi_str_mv | 10.1109/TMC.2006.174 |
| format | Magazinearticle |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_18291469</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1717436</ieee_id><sourcerecordid>896204648</sourcerecordid><originalsourceid>FETCH-LOGICAL-c382t-5acbbef2d68ee2284bda46e581822d3723b892945cd0acd3782310632e45c4ca3</originalsourceid><addsrcrecordid>eNpdkM1LAzEQxRdRsFZv3rwsgnhxazLJZpNjKX5B1Us9h2x2FrduNzXZIvWvN0sLBU8zvPnNY-YlySUlE0qJul-8ziZAiJjQgh8lI5rnMiNCkOOhZyKjwNhpchbCkhAqlSpGSTpNF5_o_DZ1dfqG_Y_zX-ncWdM2v6ZvXHeenNSmDXixr-Pk4_FhMXvO5u9PL7PpPLNMQp_lxpYl1lAJiQggeVkZLjCXVAJUrABWSgWK57YixkZBAqNEMMAocWvYOLnd-a69-95g6PWqCRbb1nToNkFLJYBwwWUkr_-RS7fxXTxOSyGKHKSkEbrbQda7EDzWeu2blfFbTYkewtIxLD2EpWNYEb_Ze5oQf6-96WwTDjsSFOVCRe5qxzWIeBgXg4dgf6Mrbxs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>magazinearticle</recordtype><pqid>866752881</pqid></control><display><type>magazinearticle</type><title>A Theory of Network Localization</title><source>IEEE Electronic Library (IEL)</source><creator>Aspnes, J. ; Eren, T. ; Goldenberg, D.K. ; Morse, A.S. ; Whiteley, W. ; Yang, Y.R. ; Anderson, B.D.O. ; Belhumeur, P.N.</creator><creatorcontrib>Aspnes, J. ; Eren, T. ; Goldenberg, D.K. ; Morse, A.S. ; Whiteley, W. ; Yang, Y.R. ; Anderson, B.D.O. ; Belhumeur, P.N.</creatorcontrib><description>In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly</description><identifier>ISSN: 1536-1233</identifier><identifier>EISSN: 1558-0660</identifier><identifier>DOI: 10.1109/TMC.2006.174</identifier><identifier>CODEN: ITMCCJ</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; algorithm/protocol design and analysis ; analysis of algorithms and problem complexity ; Applied sciences ; architectures ; communication/networking and IT ; Computation ; Computational complexity ; computer applications ; Computer networks ; Computer systems organization ; Computer vision ; Construction ; discrete mathematics ; Exact sciences and technology ; Foundations ; geometrical problems and computation ; Global Positioning System ; graph theory ; Graphs ; Large-scale systems ; Localization ; location-dependent and sensitive ; Mathematics ; mathematics of computing ; Miscellaneous ; mobile applications ; Mobile computing ; network problems ; Networks ; nonnumerical algorithms and problems ; Operation, maintenance, reliability ; Pervasive computing ; Position (location) ; Printers ; Sensors ; Services and terminals of telecommunications ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Telemetry. Remote supervision. Telewarning. Remote control ; Teleprocessing networks. Isdn ; theory of computation ; wireless sensor networks</subject><ispartof>IEEE transactions on mobile computing, 2006-12, Vol.5 (12), p.1663-1678</ispartof><rights>2006 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c382t-5acbbef2d68ee2284bda46e581822d3723b892945cd0acd3782310632e45c4ca3</citedby><cites>FETCH-LOGICAL-c382t-5acbbef2d68ee2284bda46e581822d3723b892945cd0acd3782310632e45c4ca3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1717436$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>777,781,793,27906,54739</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1717436$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18291469$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Aspnes, J.</creatorcontrib><creatorcontrib>Eren, T.</creatorcontrib><creatorcontrib>Goldenberg, D.K.</creatorcontrib><creatorcontrib>Morse, A.S.</creatorcontrib><creatorcontrib>Whiteley, W.</creatorcontrib><creatorcontrib>Yang, Y.R.</creatorcontrib><creatorcontrib>Anderson, B.D.O.</creatorcontrib><creatorcontrib>Belhumeur, P.N.</creatorcontrib><title>A Theory of Network Localization</title><title>IEEE transactions on mobile computing</title><addtitle>TMC</addtitle><description>In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly</description><subject>Algorithm design and analysis</subject><subject>algorithm/protocol design and analysis</subject><subject>analysis of algorithms and problem complexity</subject><subject>Applied sciences</subject><subject>architectures</subject><subject>communication/networking and IT</subject><subject>Computation</subject><subject>Computational complexity</subject><subject>computer applications</subject><subject>Computer networks</subject><subject>Computer systems organization</subject><subject>Computer vision</subject><subject>Construction</subject><subject>discrete mathematics</subject><subject>Exact sciences and technology</subject><subject>Foundations</subject><subject>geometrical problems and computation</subject><subject>Global Positioning System</subject><subject>graph theory</subject><subject>Graphs</subject><subject>Large-scale systems</subject><subject>Localization</subject><subject>location-dependent and sensitive</subject><subject>Mathematics</subject><subject>mathematics of computing</subject><subject>Miscellaneous</subject><subject>mobile applications</subject><subject>Mobile computing</subject><subject>network problems</subject><subject>Networks</subject><subject>nonnumerical algorithms and problems</subject><subject>Operation, maintenance, reliability</subject><subject>Pervasive computing</subject><subject>Position (location)</subject><subject>Printers</subject><subject>Sensors</subject><subject>Services and terminals of telecommunications</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Telemetry. Remote supervision. Telewarning. Remote control</subject><subject>Teleprocessing networks. Isdn</subject><subject>theory of computation</subject><subject>wireless sensor networks</subject><issn>1536-1233</issn><issn>1558-0660</issn><fulltext>true</fulltext><rsrctype>magazinearticle</rsrctype><creationdate>2006</creationdate><recordtype>magazinearticle</recordtype><sourceid>RIE</sourceid><recordid>eNpdkM1LAzEQxRdRsFZv3rwsgnhxazLJZpNjKX5B1Us9h2x2FrduNzXZIvWvN0sLBU8zvPnNY-YlySUlE0qJul-8ziZAiJjQgh8lI5rnMiNCkOOhZyKjwNhpchbCkhAqlSpGSTpNF5_o_DZ1dfqG_Y_zX-ncWdM2v6ZvXHeenNSmDXixr-Pk4_FhMXvO5u9PL7PpPLNMQp_lxpYl1lAJiQggeVkZLjCXVAJUrABWSgWK57YixkZBAqNEMMAocWvYOLnd-a69-95g6PWqCRbb1nToNkFLJYBwwWUkr_-RS7fxXTxOSyGKHKSkEbrbQda7EDzWeu2blfFbTYkewtIxLD2EpWNYEb_Ze5oQf6-96WwTDjsSFOVCRe5qxzWIeBgXg4dgf6Mrbxs</recordid><startdate>20061201</startdate><enddate>20061201</enddate><creator>Aspnes, J.</creator><creator>Eren, T.</creator><creator>Goldenberg, D.K.</creator><creator>Morse, A.S.</creator><creator>Whiteley, W.</creator><creator>Yang, Y.R.</creator><creator>Anderson, B.D.O.</creator><creator>Belhumeur, P.N.</creator><general>IEEE</general><general>IEEE Computer Society</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</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>20061201</creationdate><title>A Theory of Network Localization</title><author>Aspnes, J. ; Eren, T. ; Goldenberg, D.K. ; Morse, A.S. ; Whiteley, W. ; Yang, Y.R. ; Anderson, B.D.O. ; Belhumeur, P.N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c382t-5acbbef2d68ee2284bda46e581822d3723b892945cd0acd3782310632e45c4ca3</frbrgroupid><rsrctype>magazinearticle</rsrctype><prefilter>magazinearticle</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithm design and analysis</topic><topic>algorithm/protocol design and analysis</topic><topic>analysis of algorithms and problem complexity</topic><topic>Applied sciences</topic><topic>architectures</topic><topic>communication/networking and IT</topic><topic>Computation</topic><topic>Computational complexity</topic><topic>computer applications</topic><topic>Computer networks</topic><topic>Computer systems organization</topic><topic>Computer vision</topic><topic>Construction</topic><topic>discrete mathematics</topic><topic>Exact sciences and technology</topic><topic>Foundations</topic><topic>geometrical problems and computation</topic><topic>Global Positioning System</topic><topic>graph theory</topic><topic>Graphs</topic><topic>Large-scale systems</topic><topic>Localization</topic><topic>location-dependent and sensitive</topic><topic>Mathematics</topic><topic>mathematics of computing</topic><topic>Miscellaneous</topic><topic>mobile applications</topic><topic>Mobile computing</topic><topic>network problems</topic><topic>Networks</topic><topic>nonnumerical algorithms and problems</topic><topic>Operation, maintenance, reliability</topic><topic>Pervasive computing</topic><topic>Position (location)</topic><topic>Printers</topic><topic>Sensors</topic><topic>Services and terminals of telecommunications</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Telemetry. Remote supervision. Telewarning. Remote control</topic><topic>Teleprocessing networks. Isdn</topic><topic>theory of computation</topic><topic>wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Aspnes, J.</creatorcontrib><creatorcontrib>Eren, T.</creatorcontrib><creatorcontrib>Goldenberg, D.K.</creatorcontrib><creatorcontrib>Morse, A.S.</creatorcontrib><creatorcontrib>Whiteley, W.</creatorcontrib><creatorcontrib>Yang, Y.R.</creatorcontrib><creatorcontrib>Anderson, B.D.O.</creatorcontrib><creatorcontrib>Belhumeur, P.N.</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>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & 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 & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on mobile computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Aspnes, J.</au><au>Eren, T.</au><au>Goldenberg, D.K.</au><au>Morse, A.S.</au><au>Whiteley, W.</au><au>Yang, Y.R.</au><au>Anderson, B.D.O.</au><au>Belhumeur, P.N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Theory of Network Localization</atitle><jtitle>IEEE transactions on mobile computing</jtitle><stitle>TMC</stitle><date>2006-12-01</date><risdate>2006</risdate><volume>5</volume><issue>12</issue><spage>1663</spage><epage>1678</epage><pages>1663-1678</pages><issn>1536-1233</issn><eissn>1558-0660</eissn><coden>ITMCCJ</coden><abstract>In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TMC.2006.174</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1536-1233 |
| ispartof | IEEE transactions on mobile computing, 2006-12, Vol.5 (12), p.1663-1678 |
| issn | 1536-1233 1558-0660 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_18291469 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithm design and analysis algorithm/protocol design and analysis analysis of algorithms and problem complexity Applied sciences architectures communication/networking and IT Computation Computational complexity computer applications Computer networks Computer systems organization Computer vision Construction discrete mathematics Exact sciences and technology Foundations geometrical problems and computation Global Positioning System graph theory Graphs Large-scale systems Localization location-dependent and sensitive Mathematics mathematics of computing Miscellaneous mobile applications Mobile computing network problems Networks nonnumerical algorithms and problems Operation, maintenance, reliability Pervasive computing Position (location) Printers Sensors Services and terminals of telecommunications Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Telemetry. Remote supervision. Telewarning. Remote control Teleprocessing networks. Isdn theory of computation wireless sensor networks |
| title | A Theory of Network Localization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T07%3A03%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Theory%20of%20Network%20Localization&rft.jtitle=IEEE%20transactions%20on%20mobile%20computing&rft.au=Aspnes,%20J.&rft.date=2006-12-01&rft.volume=5&rft.issue=12&rft.spage=1663&rft.epage=1678&rft.pages=1663-1678&rft.issn=1536-1233&rft.eissn=1558-0660&rft.coden=ITMCCJ&rft_id=info:doi/10.1109/TMC.2006.174&rft_dat=%3Cproquest_RIE%3E896204648%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=866752881&rft_id=info:pmid/&rft_ieee_id=1717436&rfr_iscdi=true |