Sensor Selection for Event Detection in Wireless Sensor Networks
We consider the problem of sensor selection for event detection in wireless sensor networks (WSNs). We want to choose a subset of p out of n sensors that yields the best detection performance. As the sensor selection optimality criteria, we propose the Kullback-Leibler and Chernoff distances between...
Uloženo v:
| Vydáno v: | IEEE transactions on signal processing Ročník 59; číslo 10; s. 4938 - 4953 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.10.2011
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1053-587X, 1941-0476 |
| 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 sensor selection for event detection in wireless sensor networks (WSNs). We want to choose a subset of p out of n sensors that yields the best detection performance. As the sensor selection optimality criteria, we propose the Kullback-Leibler and Chernoff distances between the distributions of the selected measurements under the two hypothesis. We formulate the maxmin robust sensor selection problem to cope with the uncertainties in distribution means. We prove that the sensor selection problem is NP hard, for both Kullback-Leibler and Chernoff criteria. To (sub)optimally solve the sensor selection problem, we propose an algorithm of affordable complexity. Extensive numerical simulations on moderate size problem instances (when the optimum by exhaustive search is feasible to compute) demonstrate the algorithm's near optimality in a very large portion of problem instances. For larger problems, extensive simulations demonstrate that our algorithm outperforms random searches, once an upper bound on computational time is set. We corroborate numerically the validity of the Kullback-Leibler and Chernoff sensor selection criteria, by showing that they lead to sensor selections nearly optimal both in the Neyman-Pearson and Bayes sense. |
|---|---|
| AbstractList | We consider the problem of sensor selection for event detection in wireless sensor networks (WSNs). We want to choose a subset of p out of n sensors that yields the best detection performance. As the sensor selection optimality criteria, we propose the Kullback-Leibler and Chernoff distances between the distributions of the selected measurements under the two hypothesis. We formulate the maxmin robust sensor selection problem to cope with the uncertainties in distribution means. We prove that the sensor selection problem is NP hard, for both Kullback-Leibler and Chernoff criteria. To (sub)optimally solve the sensor selection problem, we propose an algorithm of affordable complexity. Extensive numerical simulations on moderate size problem instances (when the optimum by exhaustive search is feasible to compute) demonstrate the algorithm's near optimality in a very large portion of problem instances. For larger problems, extensive simulations demonstrate that our algorithm outperforms random searches, once an upper bound on computational time is set. We corroborate numerically the validity of the Kullback-Leibler and Chernoff sensor selection criteria, by showing that they lead to sensor selections nearly optimal both in the Neyman-Pearson and Bayes sense. We consider the problem of Sensor Selection for Event Detection in Wireless Sensor Networks (WSNs). We want to choose a subset of [Formula Omitted] out of [Formula Omitted] sensors that yields the best detection performance. As the sensor selection optimality criteria, we propose the Kullback-Leibler and Chernoff distances between the distributions of the selected measurements under the two hypothesis. We formulate the maxmin robust sensor selection problem to cope with the uncertainties in distribution means. We prove that the sensor selection problem is NP hard, for both Kullback-Leibler and Chernoff criteria. To (sub)optimally solve the sensor selection problem, we propose an algorithm of affordable complexity. Extensive numerical simulations on moderate size problem instances (when the optimum by exhaustive search is feasible to compute) demonstrate the algorithm's near optimality in a very large portion of problem instances. For larger problems, extensive simulations demonstrate that our algorithm outperforms random searches, once an upper bound on computational time is set. We corroborate numerically the validity of the Kullback-Leibler and Chernoff sensor selection criteria, by showing that they lead to sensor selections nearly optimal both in the Neyman-Pearson and Bayes sense. |
| Author | Bajovic, D. Sinopoli, B. Xavier, J. |
| Author_xml | – sequence: 1 givenname: D. surname: Bajovic fullname: Bajovic, D. email: dbajovic@andrew.cmu.edu organization: Inst. for Syst. & Robot. (ISR), Tech. Univ. of Lisbon, Lisbon, Portugal – sequence: 2 givenname: B. surname: Sinopoli fullname: Sinopoli, B. email: brunos@ece.cmu.edu organization: Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA – sequence: 3 givenname: J. surname: Xavier fullname: Xavier, J. email: jxavier@isr.ist.utl.pt organization: Inst. for Syst. & Robot. (ISR), Tech. Univ. of Lisbon, Lisbon, Portugal |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24592318$$DView record in Pascal Francis |
| BookMark | eNp9kMtLxDAQh4MouD7ugpciiKeueTVNbsr6BFFhV_QWsukEojXVpKv435tlqwcPnjKZ-b5h-G2h9dAFQGiP4DEhWB3PpvdjigkZUyKwYHgNjYjipMS8Fuu5xhUrK1k_baKtlJ4xJpwrMUInUwipi8UUWrC970Lh8u_8A0JfnEE_9HwoHn3MSErFINxC_9nFl7SDNpxpE-wO7zZ6uDifTa7Km7vL68npTWlZRfuSN7IiSlHWzPGcUXBGWF4pqKCZ86ZWinDpnHQGBOUCq8YSy53Ac4mlsE3DttHRau9b7N4XkHr96pOFtjUBukXSigrGMCc0kwd_yOduEUM-TkupWM2JWEKHA2SSNa2LJlif9Fv0ryZ-aZpvo4zIzIkVZ2OXUgSnre_NMpQ-Gt9qgvUyfp3j18v49RB_FvEf8Wf3P8r-SvEA8ItXKo9qwb4BT7WQxA |
| CODEN | ITPRED |
| CitedBy_id | crossref_primary_10_1109_TSP_2012_2210885 crossref_primary_10_1016_j_comcom_2015_07_027 crossref_primary_10_1109_TSIPN_2023_3322783 crossref_primary_10_1109_TSP_2013_2269044 crossref_primary_10_1109_TSP_2015_2460224 crossref_primary_10_1109_TCOMM_2016_2620465 crossref_primary_10_1109_TIT_2019_2910730 crossref_primary_10_1109_TIT_2023_3324866 crossref_primary_10_1109_TCNS_2019_2896949 crossref_primary_10_1287_ijds_2023_0027 crossref_primary_10_1109_ACCESS_2024_3505601 crossref_primary_10_1109_TSMC_2016_2523914 crossref_primary_10_1145_2700270 crossref_primary_10_1109_LSP_2023_3264106 crossref_primary_10_1109_TSP_2015_2452218 crossref_primary_10_1155_2013_304631 crossref_primary_10_1109_TSP_2021_3057258 crossref_primary_10_1109_LSP_2023_3244748 crossref_primary_10_1109_TSP_2014_2379662 crossref_primary_10_1109_TSP_2015_2491890 crossref_primary_10_1109_TSP_2015_2425804 crossref_primary_10_1109_TSP_2019_2911262 crossref_primary_10_3390_s20030697 crossref_primary_10_1016_j_neucom_2023_126969 crossref_primary_10_1109_TSP_2017_2760279 crossref_primary_10_1016_j_jnca_2018_03_023 crossref_primary_10_1016_j_adhoc_2022_103036 crossref_primary_10_1109_TSP_2013_2242066 crossref_primary_10_1109_TSP_2018_2846220 crossref_primary_10_3390_jmse10020245 crossref_primary_10_1109_TSIPN_2020_3016471 crossref_primary_10_1016_j_sigpro_2016_09_012 crossref_primary_10_1109_TCYB_2017_2717974 crossref_primary_10_1109_TAC_2016_2609998 crossref_primary_10_1109_TVT_2023_3279833 crossref_primary_10_1109_TSP_2023_3314270 crossref_primary_10_1109_TSC_2019_2917447 |
| Cites_doi | 10.1109/JSTSP.2007.914882 10.1016/j.patcog.2008.01.016 10.1007/11766247_40 10.1145/1102351.1102385 10.1016/j.laa.2005.10.046 10.1023/A:1021798932766 10.1109/79.985685 10.1090/S0002-9939-1961-0122827-1 10.1109/SPAWC.2010.5670891 10.1287/opre.43.4.684 10.1109/ACC.2009.5160423 10.1177/10943420020160030901 10.1109/IPSN.2006.244032 10.1007/978-94-015-9113-3 10.1109/TSP.2008.2007095 10.1016/S0020-0255(01)00089-5 10.1287/opre.14.4.699 10.1109/TSP.2009.2039823 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2011 |
| Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2011 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TSP.2011.2160630 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1941-0476 |
| EndPage | 4953 |
| ExternalDocumentID | 2453088071 24592318 10_1109_TSP_2011_2160630 5930376 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 53G 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AJQPL AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 E.L EBS EJD F5P HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 AAYXX CITATION IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c352t-4d8519923db0b32efa6c459e5edb4d799148ff8fae624609dc1c4f60b8086cdd3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 60 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000297111500034&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1053-587X |
| IngestDate | Thu Oct 02 09:44:16 EDT 2025 Mon Jun 30 10:25:45 EDT 2025 Mon Jul 21 09:15:29 EDT 2025 Tue Nov 18 22:37:44 EST 2025 Sat Nov 29 04:10:21 EST 2025 Tue Aug 26 17:18:12 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Keywords | Performance evaluation Chernoff distance sensor selection Wireless telecommunication robust optimization Algorithm Optimization Remote sensing Event analysis Random search Selection problem Computation time Upper bound Kullback―Leibler distance event detection Algorithm complexity NP hard problem Signal processing Wireless network Numerical simulation Sensor array Signal detection |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c352t-4d8519923db0b32efa6c459e5edb4d799148ff8fae624609dc1c4f60b8086cdd3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 889374162 |
| PQPubID | 85478 |
| PageCount | 16 |
| ParticipantIDs | pascalfrancis_primary_24592318 proquest_miscellaneous_926330412 crossref_primary_10_1109_TSP_2011_2160630 ieee_primary_5930376 proquest_journals_889374162 crossref_citationtrail_10_1109_TSP_2011_2160630 |
| PublicationCentury | 2000 |
| PublicationDate | 2011-10-01 |
| PublicationDateYYYYMMDD | 2011-10-01 |
| PublicationDate_xml | – month: 10 year: 2011 text: 2011-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on signal processing |
| PublicationTitleAbbrev | TSP |
| PublicationYear | 2011 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref14 ref11 ref10 ref1 nesterov (ref23) 1995 ref17 ref16 ref19 cover (ref18) 2006 bajovi (ref3) 2009 ref24 ref26 ref20 ref22 scharf (ref2) 1991 ref21 fedorov (ref15) 1972 ref8 ref7 bickson (ref12) 0 ref9 garey (ref25) 1979 bajovi (ref4) 2009 ref6 ref5 |
| References_xml | – ident: ref17 doi: 10.1109/JSTSP.2007.914882 – ident: ref1 doi: 10.1016/j.patcog.2008.01.016 – year: 1991 ident: ref2 publication-title: Statistical Signal Processing Detection Estimation and Time Series Analysis – year: 0 ident: ref12 publication-title: Distributed sensor selection using a truncated Newton method – ident: ref19 doi: 10.1007/11766247_40 – ident: ref20 doi: 10.1145/1102351.1102385 – start-page: 363 year: 2009 ident: ref4 article-title: Robust linear dimensionality reduction for hypothesis testing with application to sensor selection publication-title: Proc 47th Annu Allerton Conf Commun Control Comput – start-page: 1659 year: 2009 ident: ref3 article-title: Sensor selection for hypothesis testing in wireless sensor networks: A Kullback-Leibler based approach publication-title: 40th IEEE Conf Decision and Control – ident: ref26 doi: 10.1016/j.laa.2005.10.046 – ident: ref22 doi: 10.1023/A:1021798932766 – ident: ref8 doi: 10.1109/79.985685 – year: 2006 ident: ref18 publication-title: Elements of Information Theory – ident: ref21 doi: 10.1090/S0002-9939-1961-0122827-1 – ident: ref13 doi: 10.1109/SPAWC.2010.5670891 – year: 1995 ident: ref23 publication-title: Interior-Point Polynomial Algorithms in Convex Programming – ident: ref5 doi: 10.1287/opre.43.4.684 – ident: ref14 doi: 10.1109/ACC.2009.5160423 – ident: ref9 doi: 10.1177/10943420020160030901 – ident: ref10 doi: 10.1109/IPSN.2006.244032 – year: 1972 ident: ref15 publication-title: Theory of Optimal Experiments – ident: ref24 doi: 10.1007/978-94-015-9113-3 – ident: ref11 doi: 10.1109/TSP.2008.2007095 – ident: ref7 doi: 10.1016/S0020-0255(01)00089-5 – ident: ref6 doi: 10.1287/opre.14.4.699 – year: 1979 ident: ref25 publication-title: Computers and Intractability A Guide to the Theory of NP-Completeness – ident: ref16 doi: 10.1109/TSP.2009.2039823 |
| SSID | ssj0014496 |
| Score | 2.3278673 |
| Snippet | We consider the problem of sensor selection for event detection in wireless sensor networks (WSNs). We want to choose a subset of p out of n sensors that... We consider the problem of Sensor Selection for Event Detection in Wireless Sensor Networks (WSNs). We want to choose a subset of [Formula Omitted] out of... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 4938 |
| SubjectTerms | Algorithms Applied sciences Chernoff distance Computer simulation Covariance matrix Criteria Detection, estimation, filtering, equalization, prediction Estimation Event detection Exact sciences and technology Heuristic Information, signal and communications theory Kullback-Leibler distance Networks Optimization Robot sensing systems robust optimization Robustness Searching sensor selection Sensors Signal and communications theory Signal, noise Studies Telecommunications and information theory Uncertainty Upper bounds |
| Title | Sensor Selection for Event Detection in Wireless Sensor Networks |
| URI | https://ieeexplore.ieee.org/document/5930376 https://www.proquest.com/docview/889374162 https://www.proquest.com/docview/926330412 |
| Volume | 59 |
| WOSCitedRecordID | wos000297111500034&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 | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1941-0476 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014496 issn: 1053-587X databaseCode: RIE dateStart: 19910101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Ra9swED7SsIftoe3Wjbrpgh76MpgXW5Fl-a2lS-hTCKSFvBlLOkGhOCVO-vt7kh3TsjHYm21Jln0nnb7Tne4ArjCVOreIsaYFIRbOiriqBN1qjrZKtePahWQT-WKh1utiOYCf_VkYRAzOZ_jLXwZbvt2Yvd8qm2QFCdxcHsFRnsv2rFZvMRAi5OIiuDCNM5WvDybJpJjcr5ZtrE6eSh9i6t0SFHKqeI_IqiGiuDabxR-COaw285P_-85TOO5QJbtph8FnGGD9BT69iTV4BtcrUlg3W7YKiW-IG4zgKpt5d0f2G3fds8eaeX_YJ5J_rGuwaB3Fm6_wMJ_d397FXfqE2BCq2sXCEpoqCMBZnegpR1dJI7ICM7Ra2JyAoVDOKVeh5EImhTWpEU4mWpGaY6ydfoNhvanxHBgqnaGXBaQvC00sJGCoiMpTmRt6bRbB5EDR0nSxxX2Ki6cy6BhJURIPSs-DsuNBBD_6Fs9tXI1_1D3zNO7rdeSNYPyOaX05p78k2KoiGB24WHYzsymVB2iEQnkErC-lKeXtJFWNm31TFlz6XZ6UX_y94xF85AdPwPQShrvtHr_DB_Oye2y24zAsXwH9C-Bm |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Ra9swED66btDuodvalbntOj3sZVAvtiLL8ttK19KxLhSSQd6EJZ2gUJwRJ_v9O8mOadko7M22JMu-k07f6U53AB8xl6Z0iKmhBSEV3om0rgXdGo6uzo3nxsdkE-Vkoubz6nYLzoazMIgYnc_wc7iMtny3sOuwVTYqKhK4pXwGzwsheNad1hpsBkLEbFwEGMZpocr5xiiZVaPZ9LaL1slzGYJMPVqEYlaV4BNZt0QW3-Wz-Es0x_Xm6tX_felr2OtxJTvvBsIb2MJmH14-iDZ4AF-mpLIulmwaU98QPxgBVnYZHB7ZV1z1z-4aFjxi70kCsr7BpHMVb9_Cz6vL2cV12idQSC3hqlUqHOGpiiCcM5kZc_S1tKKosEBnhCsJGgrlvfI1Si5kVjmbW-FlZhQpOta58SFsN4sG3wFDZQoM0oA0ZmGIiQQNFVF5LEtLry0SGG0oqm0fXTwkubjXUcvIKk080IEHuudBAp-GFr-6yBpP1D0INB7q9eRN4PQR04ZyTn9JwFUlcLzhou7nZqtVgGiEQ3kCbCilSRUsJXWDi3WrKy7DPk_Oj_7d8QfYuZ79uNE33ybfj2GXb_wC8xPYXi3X-B5e2N-ru3Z5GofoH9DK460 |
| 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%3Ajournal&rft.genre=article&rft.atitle=Sensor+Selection+for+Event+Detection+in+Wireless+Sensor+Networks&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=Bajovic%2C+Dragana&rft.au=Sinopoli%2C+Bruno&rft.au=Xavier%2C+Jo%C3%A3o&rft.date=2011-10-01&rft.issn=1053-587X&rft.eissn=1941-0476&rft.volume=59&rft.issue=10&rft.spage=4938&rft.epage=4953&rft_id=info:doi/10.1109%2FTSP.2011.2160630&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TSP_2011_2160630 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon |