Robust sensor placements at informative and communication-efficient locations

When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this article, we present a data-driven approach that addresses the thre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on sensor networks 2011-02, Vol.7 (4), p.1-33
Hauptverfasser: Krause, Andreas, Guestrin, Carlos, Gupta, Anupam, Kleinberg, Jon
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 33
container_issue 4
container_start_page 1
container_title ACM transactions on sensor networks
container_volume 7
creator Krause, Andreas
Guestrin, Carlos
Gupta, Anupam
Kleinberg, Jon
description When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this article, we present a data-driven approach that addresses the three central aspects of this problem: measuring the predictive quality of a set of sensor locations (regardless of whether sensors were ever placed at these locations), predicting the communication cost involved with these placements, and designing an algorithm with provable quality guarantees that optimizes the NP-hard trade-off. Specifically, we use data from a pilot deployment to build nonparametric probabilistic models called Gaussian Processes (GPs) both for the spatial phenomena of interest and for the spatial variability of link qualities, which allows us to estimate predictive power and communication cost of unsensed locations. Surprisingly, uncertainty in the representation of link qualities plays an important role in estimating communication costs. Using these models, we present a novel, polynomial-time, data-driven algorithm, PSPIEL, which selects Sensor Placements at Informative and communication-Efficient Locations. Our approach exploits two important properties of this problem: submodularity , formalizing the intuition that adding a node to a small deployment can help more than adding a node to a large deployment; and locality , under which nodes that are far from each other provide almost independent information. Exploiting these properties, we prove strong approximation guarantees for our PSPIEL approach. In addition, we show how our placements can be made robust against changes in the environment, and how PSPIEL can be used to plan informative paths for information gathering using mobile robots. We also provide extensive experimental validation of this practical approach on several real-world placement problems, and built a complete system implementation on 46 Tmote Sky motes, demonstrating significant advantages over existing methods.
doi_str_mv 10.1145/1921621.1921625
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_1921621_1921625</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_1921621_1921625</sourcerecordid><originalsourceid>FETCH-LOGICAL-c282t-59289a91050195a5ba97a113bc72171e1c52af6ff9ba541115e7d2f6e0ed51473</originalsourceid><addsrcrecordid>eNo9kE1LxDAURYMoOI6u3eYPdCYv6WuapQx-wYggui6vaQKRthmSjuC_d6RlVudyudzFYewexAagxC0YCZWEzUy8YCtAFEVZV_rynNFcs5ucv4VQqlRixd4-YnvME89uzDHxQ0_WDW6cMqeJh9HHNNAUfhynseM2DsNxDPbUxLFw3gcbTlvex7nKt-zKU5_d3cI1-3p6_Ny9FPv359fdw76wspZTgUbWhgwIFGCQsCWjCUC1VkvQ4MCiJF95b1rCEgDQ6U76ygnXIZRardl2_rUp5pycbw4pDJR-GxDNv41msbEQ1R-G0FK2</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Robust sensor placements at informative and communication-efficient locations</title><source>ACM Digital Library Complete</source><creator>Krause, Andreas ; Guestrin, Carlos ; Gupta, Anupam ; Kleinberg, Jon</creator><creatorcontrib>Krause, Andreas ; Guestrin, Carlos ; Gupta, Anupam ; Kleinberg, Jon</creatorcontrib><description>When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this article, we present a data-driven approach that addresses the three central aspects of this problem: measuring the predictive quality of a set of sensor locations (regardless of whether sensors were ever placed at these locations), predicting the communication cost involved with these placements, and designing an algorithm with provable quality guarantees that optimizes the NP-hard trade-off. Specifically, we use data from a pilot deployment to build nonparametric probabilistic models called Gaussian Processes (GPs) both for the spatial phenomena of interest and for the spatial variability of link qualities, which allows us to estimate predictive power and communication cost of unsensed locations. Surprisingly, uncertainty in the representation of link qualities plays an important role in estimating communication costs. Using these models, we present a novel, polynomial-time, data-driven algorithm, PSPIEL, which selects Sensor Placements at Informative and communication-Efficient Locations. Our approach exploits two important properties of this problem: submodularity , formalizing the intuition that adding a node to a small deployment can help more than adding a node to a large deployment; and locality , under which nodes that are far from each other provide almost independent information. Exploiting these properties, we prove strong approximation guarantees for our PSPIEL approach. In addition, we show how our placements can be made robust against changes in the environment, and how PSPIEL can be used to plan informative paths for information gathering using mobile robots. We also provide extensive experimental validation of this practical approach on several real-world placement problems, and built a complete system implementation on 46 Tmote Sky motes, demonstrating significant advantages over existing methods.</description><identifier>ISSN: 1550-4859</identifier><identifier>EISSN: 1550-4867</identifier><identifier>DOI: 10.1145/1921621.1921625</identifier><language>eng</language><ispartof>ACM transactions on sensor networks, 2011-02, Vol.7 (4), p.1-33</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c282t-59289a91050195a5ba97a113bc72171e1c52af6ff9ba541115e7d2f6e0ed51473</citedby><cites>FETCH-LOGICAL-c282t-59289a91050195a5ba97a113bc72171e1c52af6ff9ba541115e7d2f6e0ed51473</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,778,782,27907,27908</link.rule.ids></links><search><creatorcontrib>Krause, Andreas</creatorcontrib><creatorcontrib>Guestrin, Carlos</creatorcontrib><creatorcontrib>Gupta, Anupam</creatorcontrib><creatorcontrib>Kleinberg, Jon</creatorcontrib><title>Robust sensor placements at informative and communication-efficient locations</title><title>ACM transactions on sensor networks</title><description>When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this article, we present a data-driven approach that addresses the three central aspects of this problem: measuring the predictive quality of a set of sensor locations (regardless of whether sensors were ever placed at these locations), predicting the communication cost involved with these placements, and designing an algorithm with provable quality guarantees that optimizes the NP-hard trade-off. Specifically, we use data from a pilot deployment to build nonparametric probabilistic models called Gaussian Processes (GPs) both for the spatial phenomena of interest and for the spatial variability of link qualities, which allows us to estimate predictive power and communication cost of unsensed locations. Surprisingly, uncertainty in the representation of link qualities plays an important role in estimating communication costs. Using these models, we present a novel, polynomial-time, data-driven algorithm, PSPIEL, which selects Sensor Placements at Informative and communication-Efficient Locations. Our approach exploits two important properties of this problem: submodularity , formalizing the intuition that adding a node to a small deployment can help more than adding a node to a large deployment; and locality , under which nodes that are far from each other provide almost independent information. Exploiting these properties, we prove strong approximation guarantees for our PSPIEL approach. In addition, we show how our placements can be made robust against changes in the environment, and how PSPIEL can be used to plan informative paths for information gathering using mobile robots. We also provide extensive experimental validation of this practical approach on several real-world placement problems, and built a complete system implementation on 46 Tmote Sky motes, demonstrating significant advantages over existing methods.</description><issn>1550-4859</issn><issn>1550-4867</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNo9kE1LxDAURYMoOI6u3eYPdCYv6WuapQx-wYggui6vaQKRthmSjuC_d6RlVudyudzFYewexAagxC0YCZWEzUy8YCtAFEVZV_rynNFcs5ucv4VQqlRixd4-YnvME89uzDHxQ0_WDW6cMqeJh9HHNNAUfhynseM2DsNxDPbUxLFw3gcbTlvex7nKt-zKU5_d3cI1-3p6_Ny9FPv359fdw76wspZTgUbWhgwIFGCQsCWjCUC1VkvQ4MCiJF95b1rCEgDQ6U76ygnXIZRardl2_rUp5pycbw4pDJR-GxDNv41msbEQ1R-G0FK2</recordid><startdate>201102</startdate><enddate>201102</enddate><creator>Krause, Andreas</creator><creator>Guestrin, Carlos</creator><creator>Gupta, Anupam</creator><creator>Kleinberg, Jon</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>201102</creationdate><title>Robust sensor placements at informative and communication-efficient locations</title><author>Krause, Andreas ; Guestrin, Carlos ; Gupta, Anupam ; Kleinberg, Jon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c282t-59289a91050195a5ba97a113bc72171e1c52af6ff9ba541115e7d2f6e0ed51473</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Krause, Andreas</creatorcontrib><creatorcontrib>Guestrin, Carlos</creatorcontrib><creatorcontrib>Gupta, Anupam</creatorcontrib><creatorcontrib>Kleinberg, Jon</creatorcontrib><collection>CrossRef</collection><jtitle>ACM transactions on sensor networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Krause, Andreas</au><au>Guestrin, Carlos</au><au>Gupta, Anupam</au><au>Kleinberg, Jon</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robust sensor placements at informative and communication-efficient locations</atitle><jtitle>ACM transactions on sensor networks</jtitle><date>2011-02</date><risdate>2011</risdate><volume>7</volume><issue>4</issue><spage>1</spage><epage>33</epage><pages>1-33</pages><issn>1550-4859</issn><eissn>1550-4867</eissn><abstract>When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this article, we present a data-driven approach that addresses the three central aspects of this problem: measuring the predictive quality of a set of sensor locations (regardless of whether sensors were ever placed at these locations), predicting the communication cost involved with these placements, and designing an algorithm with provable quality guarantees that optimizes the NP-hard trade-off. Specifically, we use data from a pilot deployment to build nonparametric probabilistic models called Gaussian Processes (GPs) both for the spatial phenomena of interest and for the spatial variability of link qualities, which allows us to estimate predictive power and communication cost of unsensed locations. Surprisingly, uncertainty in the representation of link qualities plays an important role in estimating communication costs. Using these models, we present a novel, polynomial-time, data-driven algorithm, PSPIEL, which selects Sensor Placements at Informative and communication-Efficient Locations. Our approach exploits two important properties of this problem: submodularity , formalizing the intuition that adding a node to a small deployment can help more than adding a node to a large deployment; and locality , under which nodes that are far from each other provide almost independent information. Exploiting these properties, we prove strong approximation guarantees for our PSPIEL approach. In addition, we show how our placements can be made robust against changes in the environment, and how PSPIEL can be used to plan informative paths for information gathering using mobile robots. We also provide extensive experimental validation of this practical approach on several real-world placement problems, and built a complete system implementation on 46 Tmote Sky motes, demonstrating significant advantages over existing methods.</abstract><doi>10.1145/1921621.1921625</doi><tpages>33</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1550-4859
ispartof ACM transactions on sensor networks, 2011-02, Vol.7 (4), p.1-33
issn 1550-4859
1550-4867
language eng
recordid cdi_crossref_primary_10_1145_1921621_1921625
source ACM Digital Library Complete
title Robust sensor placements at informative and communication-efficient locations
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T00%3A02%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Robust%20sensor%20placements%20at%20informative%20and%20communication-efficient%20locations&rft.jtitle=ACM%20transactions%20on%20sensor%20networks&rft.au=Krause,%20Andreas&rft.date=2011-02&rft.volume=7&rft.issue=4&rft.spage=1&rft.epage=33&rft.pages=1-33&rft.issn=1550-4859&rft.eissn=1550-4867&rft_id=info:doi/10.1145/1921621.1921625&rft_dat=%3Ccrossref%3E10_1145_1921621_1921625%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true