Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where to locate these sensors to best predict the phenomenon at the unsensed locations. However, given the power constraints, w...
Uloženo v:
| Vydáno v: | 2009 International Conference on Information Processing in Sensor Networks s. 181 - 192 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
Washington, DC, USA
IEEE Computer Society
13.04.2009
IEEE |
| Edice: | ACM Conferences |
| Témata: |
Theory of computation
> Design and analysis of algorithms
> Approximation algorithms analysis
> Scheduling algorithms
Theory of computation
> Design and analysis of algorithms
> Online algorithms
> Online learning algorithms
> Scheduling algorithms
|
| ISBN: | 1424451086, 9781424451081 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where to locate these sensors to best predict the phenomenon at the unsensed locations. However, given the power constraints, we also need to determine when to selectively activate these sensors in order to maximize the performance while satisfying lifetime requirements. Traditionally, these two problems of sensor placement and scheduling have been considered separately from each other; one first decides where to place the sensors, and then when to activate them. In this paper, we present an efficient algorithm, ESPASS, that simultaneously optimizes the placement and the schedule. We prove that ESPASS provides a constant-factor approximation to the optimal solution of this NP-hard optimization problem. A salient feature of our approach is that it obtains “balanced” schedules that perform uniformly well over time, rather than only on average. We then extend the algorithm to allow for a smooth power-accuracy tradeoff. Our algorithm applies to complex settings where the sensing quality of a set of sensors is measured, e.g., in the improvement of prediction accuracy (more formally, to situations where the sensing quality function is submodular). We present extensive empirical studies on several sensing tasks, and our results show that simultaneously placing and scheduling gives drastically improved performance compared to separate placement and scheduling (e.g., a 33% improvement in network lifetime on the traffic prediction task). |
|---|---|
| AbstractList | We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where to locate these sensors to best predict the phenomenon at the unsensed locations. However, given the power constraints, we also need to determine when to selectively activate these sensors in order to maximize the performance while satisfying lifetime requirements. Traditionally, these two problems of sensor placement and scheduling have been considered separately from each other; one first decides where to place the sensors, and then when to activate them. In this paper, we present an efficient algorithm, ESPASS, that simultaneously optimizes the placement and the schedule. We prove that ESPASS provides a constant-factor approximation to the optimal solution of this NP-hard optimization problem. A salient feature of our approach is that it obtains ldquobalancedrdquo schedules that perform uniformly well over time, rather than only on average. We then extend the algorithm to allow for a smooth power-accuracy tradeoff. Our algorithm applies to complex settings where the sensing quality of a set of sensors is measured, e.g., in the improvement of prediction accuracy (more formally, to situations where the sensing quality function is submodular). We present extensive empirical studies on several sensing tasks, and our results show that simultaneously placing and scheduling gives drastically improved performance compared to separate placement and scheduling (e.g., a 33% improvement in network lifetime on the traffic prediction task). We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where to locate these sensors to best predict the phenomenon at the unsensed locations. However, given the power constraints, we also need to determine when to selectively activate these sensors in order to maximize the performance while satisfying lifetime requirements. Traditionally, these two problems of sensor placement and scheduling have been considered separately from each other; one first decides where to place the sensors, and then when to activate them. In this paper, we present an efficient algorithm, ESPASS, that simultaneously optimizes the placement and the schedule. We prove that ESPASS provides a constant-factor approximation to the optimal solution of this NP-hard optimization problem. A salient feature of our approach is that it obtains “balanced” schedules that perform uniformly well over time, rather than only on average. We then extend the algorithm to allow for a smooth power-accuracy tradeoff. Our algorithm applies to complex settings where the sensing quality of a set of sensors is measured, e.g., in the improvement of prediction accuracy (more formally, to situations where the sensing quality function is submodular). We present extensive empirical studies on several sensing tasks, and our results show that simultaneously placing and scheduling gives drastically improved performance compared to separate placement and scheduling (e.g., a 33% improvement in network lifetime on the traffic prediction task). |
| Author | Gupta, Anupam Krause, Andreas Rajagopal, Ram Guestrin, Carlos |
| Author_xml | – sequence: 1 givenname: Andreas surname: Krause fullname: Krause, Andreas organization: Caltech, USA – sequence: 2 givenname: Ram surname: Rajagopal fullname: Rajagopal, Ram organization: UC Berkeley, USA – sequence: 3 givenname: Anupam surname: Gupta fullname: Gupta, Anupam organization: Carnegie Mellon University, USA – sequence: 4 givenname: Carlos surname: Guestrin fullname: Guestrin, Carlos organization: Carnegie Mellon University, USA |
| BookMark | eNqNkD1PwzAYhI0ACVo6M7BkZGnw6--MqOJLqsQAzJbtvIZA4lRxOvDvCTQ_gFtOpzvd8CzISeoTEnIJtJSTbkBRBkqWf274EVlV2kxBSsM1qGOyAMGEkECNOiOrnD_pJCGZ1vSc0Jem27ejS9jvc7FrXcAO01i4VBc5fGC9b5v0XvSxyJhyP-QLchpdm3E1-5K83d-9bh7X2-eHp83tdu2Y0OM68Fo6LwxEE4T2AhAQowpMRuOB-wgqahajDqZCxqsYJTD0dQ2xYt4pviRXh98GEe1uaDo3fFvJACrOpvb60LrQWd_3X9kCtb887MzDzjymafnPqfVDg5H_APhXX6o |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.5555/1602165.1602183 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781605583716 1605583715 |
| EndPage | 192 |
| ExternalDocumentID | 5211932 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR AARBI ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IERZE OCL RIE RIL AAWTH LHSKQ |
| ID | FETCH-LOGICAL-a247t-c3d5ab481f8c47b41e1eef6c25f8b13bf16f72ff7c89e239ff512ebdd1f92ba63 |
| IEDL.DBID | RIE |
| ISBN | 1424451086 9781424451081 |
| ISICitedReferencesCount | 39 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000275711800016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:15:30 EDT 2025 Wed Jan 31 06:36:53 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a247t-c3d5ab481f8c47b41e1eef6c25f8b13bf16f72ff7c89e239ff512ebdd1f92ba63 |
| PageCount | 12 |
| ParticipantIDs | ieee_primary_5211932 acm_books_10_5555_1602165_1602183_brief acm_books_10_5555_1602165_1602183 |
| PublicationCentury | 2000 |
| PublicationDate | 20090413 2009-April |
| PublicationDateYYYYMMDD | 2009-04-13 2009-04-01 |
| PublicationDate_xml | – month: 04 year: 2009 text: 20090413 day: 13 |
| PublicationDecade | 2000 |
| PublicationPlace | Washington, DC, USA |
| PublicationPlace_xml | – name: Washington, DC, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | 2009 International Conference on Information Processing in Sensor Networks |
| PublicationTitleAbbrev | IPSN |
| PublicationYear | 2009 |
| Publisher | IEEE Computer Society IEEE |
| Publisher_xml | – name: IEEE Computer Society – name: IEEE |
| SSID | ssj0000452770 |
| Score | 1.5985003 |
| Snippet | We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question... |
| SourceID | ieee acm |
| SourceType | Publisher |
| StartPage | 181 |
| SubjectTerms | Accuracy Approximation algorithms Batteries Computer systems organization -- Dependable and fault-tolerant systems and networks General and reference -- Cross-computing tools and techniques -- Performance Mathematics of computing -- Mathematical analysis -- Functional analysis -- Approximation Mathematics of computing -- Mathematical analysis -- Mathematical optimization Monitoring Networks -- Network performance evaluation Networks -- Network services -- Network management Processor scheduling Road transportation Scheduling algorithm Sensor networks Sensor phenomena and characterization Telecommunication traffic Theory of computation -- Design and analysis of algorithms -- Approximation algorithms analysis Theory of computation -- Design and analysis of algorithms -- Approximation algorithms analysis -- Scheduling algorithms Theory of computation -- Design and analysis of algorithms -- Mathematical optimization Theory of computation -- Design and analysis of algorithms -- Online algorithms -- Online learning algorithms -- Scheduling algorithms Theory of computation -- Theory and algorithms for application domains -- Machine learning theory -- Reinforcement learning -- Sequential decision making Wireless sensor networks |
| Title | Simultaneous placement and scheduling of sensors |
| URI | https://ieeexplore.ieee.org/document/5211932 |
| WOSCitedRecordID | wos000275711800016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFL3M4YO--LGJ84sKgi92a5o0SZ_F4YOMgQp7K0l6A3uwlXXz95tk3VQQxL70gxLKofT0JPecC3DDpDKoUhanRGHMOJpYMkbjRFmVOT7VqQpdS57EZCJns3zagbutFwYRQ_EZDv1hWMsva7PyU2WjzMeRUffB3RGCr71a2_kUHw0uRLLxbmW-g9Am0qk9J-ton8xtI8IdufFsGPYhM1CZtx8dVgLBjA_-92iH0P9y6kXTLQcdQQerY9j_FjLYg-R57qsGVYVO5EehBsuPFamqjJy0dVTjHelRbaPGSdp60fThdfzwcv8Yt30SYgeyWMaGlpnSTBIrDROaESSIlps0s1ITqi3hVqTWCiNzTGlurWN51GVJbJ5qxekJdKu6wlOIKNeJcpKSMuqGEkrnOXN_OEYkSppS5gO4djgVXgA0hdMPHsuixbJosRzA7Z_3FHoxRzuAnkeyeF8HaxQtiGe_Xz6Hvc1STkIuoLtcrPASds3Hct4srsLb8Akyr6wU |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFL2MKagvfmzi_Kwg-GK3pkmb9FkcE-cYOGFvJUlvYA920m7-fpOumwqC2Jd-UEI5lJ6e5J5zAW6YkBplyPyQSPRZjNoXjFE_kEZGlk9VKKuuJUM-GonpNBk34G7jhUHEqvgMu-6wWsvP5nrppsp6kYsjo_aDuxUxFgYrt9ZmRsWFg3MerN1bkeshtA51qs_JKtwnsluPxJbe4qhb7avUQKnffvRYqSimv_-_hzuA9pdXzxtvWOgQGpgfwd63mMEWBC8zVzcoc7Qy36uqsNxYnswzz4pbSzbOk-7NjVdaUTsvyja89h8m9wO_7pTgW5j5wtc0i6RighihGVeMIEE0sQ4jIxShypDY8NAYrkWCIU2MsTyPKsuISUIlY3oMzXye4wl4NFaBtKKSMmqH4lIlCbP_OJoHUuhMJB24tjilTgKUqVUQDsu0xjKtsezA7Z_3pKqYoelAyyGZvq-iNdIaxNPfL1_BzmDyPEyHj6OnM9hdL-wE5Byai2KJF7CtPxazsris3oxPXXavWw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+International+Conference+on+Information+Processing+in+Sensor+Networks&rft.atitle=Simultaneous+placement+and+scheduling+of+sensors&rft.au=Krause%2C+A.&rft.au=Rajagopal%2C+R.&rft.au=Gupta%2C+A.&rft.au=Guestrin%2C+C.&rft.date=2009-04-01&rft.pub=IEEE&rft.isbn=9781424451081&rft.spage=181&rft.epage=192&rft_id=info:doi/10.5555%2F1602165.1602183&rft.externalDocID=5211932 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424451081/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424451081/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424451081/sc.gif&client=summon&freeimage=true |