Quickest Change Detection In Anonymous Heterogeneous Sensor Networks
The problem of quickest change detection (QCD) in anonymous heterogeneous sensor networks is studied. There are n heterogeneous sensors and a fusion center. The sensors are clustered into K groups, and different groups follow different data generating distributions. At some unknown time, an event oc...
Uloženo v:
| Vydáno v: | Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) s. 5925 - 5929 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.05.2020
|
| Témata: | |
| ISSN: | 2379-190X |
| 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 | The problem of quickest change detection (QCD) in anonymous heterogeneous sensor networks is studied. There are n heterogeneous sensors and a fusion center. The sensors are clustered into K groups, and different groups follow different data generating distributions. At some unknown time, an event occurs in the network and changes the data generating distribution of the sensors. The goal is to detect the change as quickly as possible, subject to false alarm constraints. The anonymous setting is studied in this paper, where at each time step, the fusion center receives n unordered samples. The fusion center does not know which sensor each sample comes from, and thus does not know its exact distribution. In this paper, a simple optimality proof is derived for the Mixture Likelihood Ratio Test (MLRT), which was constructed and proved to be optimal for the non-sequential anonymous setting in [1]. For the QCD problem, a mixture CuSum algorithm is constructed in this paper, and is further shown to be optimal under Lorden's criterion [2]. |
|---|---|
| AbstractList | The problem of quickest change detection (QCD) in anonymous heterogeneous sensor networks is studied. There are n heterogeneous sensors and a fusion center. The sensors are clustered into K groups, and different groups follow different data generating distributions. At some unknown time, an event occurs in the network and changes the data generating distribution of the sensors. The goal is to detect the change as quickly as possible, subject to false alarm constraints. The anonymous setting is studied in this paper, where at each time step, the fusion center receives n unordered samples. The fusion center does not know which sensor each sample comes from, and thus does not know its exact distribution. In this paper, a simple optimality proof is derived for the Mixture Likelihood Ratio Test (MLRT), which was constructed and proved to be optimal for the non-sequential anonymous setting in [1]. For the QCD problem, a mixture CuSum algorithm is constructed in this paper, and is further shown to be optimal under Lorden's criterion [2]. |
| Author | Li, Qunwei Sun, Zhongchang Zou, Shaofeng |
| Author_xml | – sequence: 1 givenname: Zhongchang surname: Sun fullname: Sun, Zhongchang organization: University at Buffalo, the State University of New York – sequence: 2 givenname: Shaofeng surname: Zou fullname: Zou, Shaofeng organization: University at Buffalo, the State University of New York – sequence: 3 givenname: Qunwei surname: Li fullname: Li, Qunwei organization: Ant Financial,China |
| BookMark | eNotj8tOAjEYhavRRECewE1fYPBvO522SzKokBAvGRbuSNv5iyPSMdMhhrd3jKxOvrM4lzG5im1EQiiDGWNg7lflvKpec1CqmHHgMDMgBzIXZGqUZhIMFIVg8pKMuFAmYwbeb8g4pU8A0CrXI7J4OzZ-j6mn5YeNO6QL7NH3TRvpKtL5UHg6tMdEl4PdtTuM-EcVxtR29Bn7n7bbp1tyHexXwulZJ2Tz-LApl9n65WnYuM4aDqLPOLdCG6Y9mMCDNipH6Zz0OuTaBqVBWuV1rtErdFo4dMHUrgh1zYR1UkzI3X9sg4jb76452O60PX8WvwMWT3A |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/ICASSP40776.2020.9054079 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 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 | 9781509066315 1509066314 |
| EISSN | 2379-190X |
| EndPage | 5929 |
| ExternalDocumentID | 9054079 |
| Genre | orig-research |
| GroupedDBID | 23M 29P 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ABLEC ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP IPLJI M43 OCL RIE RIL RIO RNS |
| ID | FETCH-LOGICAL-i203t-22a38918c09f2f8974e5bb5c8f48af7805a7c848ec7eb83bebf9db6fdd13ab53 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000615970406037&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:46:52 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i203t-22a38918c09f2f8974e5bb5c8f48af7805a7c848ec7eb83bebf9db6fdd13ab53 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_9054079 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-May |
| PublicationDateYYYYMMDD | 2020-05-01 |
| PublicationDate_xml | – month: 05 year: 2020 text: 2020-May |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) |
| PublicationTitleAbbrev | ICASSP |
| PublicationYear | 2020 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0008748 |
| Score | 2.1475518 |
| Snippet | The problem of quickest change detection (QCD) in anonymous heterogeneous sensor networks is studied. There are n heterogeneous sensors and a fusion center.... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 5925 |
| SubjectTerms | Anonymous Change detection algorithms Computational efficiency Conferences heterogeneous hypothesis testing mixture CuSum sequential change detection Signal processing Signal processing algorithms Speech processing Testing |
| Title | Quickest Change Detection In Anonymous Heterogeneous Sensor Networks |
| URI | https://ieeexplore.ieee.org/document/9054079 |
| WOSCitedRecordID | wos000615970406037&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/eLvHCXMwlV1LawIxEB5UemgvfWjpmxx67Op2N7uZHItWFIpYlOJNkuwEvGhx1_7-Jrt220IvvSWBEJi85ku-bwbgnqexMNKmQSKtCrhOKZCknCNHNsVIuTVTRvt8exGTCS4WctqAh1oLQ0Ql-Yy6vlj-5Wcbs_NPZT3p_Qshm9AUIq20WvWpi4LjF1MnlL1x_2k2m3IfrMaBwCjs7vv-SqJS3iHD4_-NfgKdbzEem9bXzCk0aH0GRz_iCLZh8Lpbud2YF6wSC7ABFSXFas3Ga1YjfDby3JeNWzLkazOHYDdbNqmI4HkH5sPneX8U7NMjBKsojIsgipT_ZEQTShtZdMCAEq0Tg5ajsj5XgRIGOZIRpDHWpK30orsse4yVTuJzaLnx6QJYkkmMyGEbgYbrEN2Z5x0_maFMFU-yS2h7cyzfqwAYy70lrv5uvoZDb_GKFXgDrWK7o1s4MB_FKt_elbP2CV1KmZw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4gmqgXH2B824NHF9bd7u70aFACEQkGYriRtjtNuICBxd9vu7uumnjx1jZpmkxf87XfNwNwy-Mw0cLEXiSM9LiKyRMkrSNHJsZA2jWTR_t8GyTDIU6nYlSDu0oLQ0Q5-Yxarpj_5adLvXFPZW3h_ItEbMG2y5xVqrWqcxcTjl9cHV-0-52H8XjEXbgaCwMDv1X2_pVGJb9Fugf_G_8Qmt9yPDaqLpojqNHiGPZ_RBJswOPrZm734zpjhVyAPVKWk6wWrL9gFcZnPcd-WdpFQ642thh2uWLDggq-bsKk-zTp9LwyQYI3D_ww84JAum9G1L4wgUELDShSKtJoOErjshXIRCNH0gkpDBUpI5zsLk3vQ6mi8ATqdnw6BRalAgOy6CZBzZWP9tRzrp9IUcSSR-kZNJw5Zu9FCIxZaYnzv5tvYLc3eRnMBv3h8wXsOesXHMFLqGerDV3Bjv7I5uvVdT6Dn437nOU |
| 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=Proceedings+of+the+...+IEEE+International+Conference+on+Acoustics%2C+Speech+and+Signal+Processing+%281998%29&rft.atitle=Quickest+Change+Detection+In+Anonymous+Heterogeneous+Sensor+Networks&rft.au=Sun%2C+Zhongchang&rft.au=Zou%2C+Shaofeng&rft.au=Li%2C+Qunwei&rft.date=2020-05-01&rft.pub=IEEE&rft.eissn=2379-190X&rft.spage=5925&rft.epage=5929&rft_id=info:doi/10.1109%2FICASSP40776.2020.9054079&rft.externalDocID=9054079 |