https://scholars.lib.ntu.edu.tw/handle/123456789/607296
標題: | Asymptotic Optimality in Byzantine Distributed Quickest Change Detection | 作者: | Huang Y.-C Huang Y.-J Lin S.-C. SHIH-CHUN LIN |
關鍵字: | Byzantine;game;sequential change detection;Bandwidth;Energy efficiency;Signal processing;Asymptotic optimality;Asymptotic performance;Asymptotically optimal;Bandwidth constraint;Bandwidth efficient;Binary hypothesis;Distributed sensor;Quickest change detections;Alarm systems | 公開日期: | 2021 | 卷: | 67 | 期: | 9 | 起(迄)頁: | 5942-5962 | 來源出版物: | IEEE Transactions on Information Theory | 摘要: | The Byzantine distributed quickest change detection (BDQCD) is studied, where a fusion center monitors the occurrence of an abrupt event through a bunch of distributed sensors that may be compromised. We first consider the binary hypothesis case where there is only one post-change hypothesis and prove a novel converse to the first-order asymptotic detection delay in the large mean time to a false alarm regime. This converse is tight in that it coincides with the currently best achievability shown by Fellouris et al.; hence, the optimal asymptotic performance of binary BDQCD is characterized. An important implication of this result is that, even with compromised sensors, a 1-bit link between each sensor and the fusion center suffices to achieve asymptotic optimality. To accommodate multiple post-change hypotheses, we then formulate the multi-hypothesis BDQCD problem and again investigate the optimal first-order performance under different bandwidth constraints. A converse is first obtained by extending our converse from binary to multi-hypothesis BDQCD. Two families of stopping rules, namely the simultaneous d -th alarm and the multi-shot d -th alarm, are then proposed. Under sufficient link bandwidth, the simultaneous d -th alarm, with d being set to the number of honest sensors, can achieve the asymptotic performance that coincides with the derived converse bound; hence, the asymptotically optimal performance of multi-hypothesis BDQCD is again characterized. Moreover, although being shown to be asymptotically optimal only for some special cases, the multi-shot d -th alarm is much more bandwidth-efficient and energy-efficient than the simultaneous d -th alarm. Built upon the above success in characterizing the asymptotic optimality of the BDQCD, a corresponding leader-follower Stackelberg game is formulated and its solution is found. ? 1963-2012 IEEE. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85112615775&doi=10.1109%2fTIT.2021.3100423&partnerID=40&md5=ba2774fd5102f8f5a9e768bdb643fb88 https://scholars.lib.ntu.edu.tw/handle/123456789/607296 |
ISSN: | 00189448 | DOI: | 10.1109/TIT.2021.3100423 |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。