Compressed sensing with corrupted participants

Compressed sensing (CS) theory promises one can recover real-valued sparse signal from a small number of linear measurements. Motivated by network monitoring with link failures, we for the first time consider the problem of recovering signals that contain both real-valued entries and corruptions, where the real entries represent transmission delays on normal links and the corruptions represent failed links. Unlike conventional CS, here a measurement is real-valued only if it does not include a failed link, and it is corrupted otherwise. We prove that O((d + 1)max(d, k) log n) nonadaptive measurements are enough to recover all n-dimensional signals that contain k nonzero real entries and d corruptions. We provide explicit constructions of measurements and recovery algorithms. We also analyze the performance of signal recovery when the measurements contain errors.

[1]  Yan Chen,et al.  Algebra-Based Scalable Overlay Network Monitoring: Algorithms, Evaluation, and Applications , 2007, IEEE/ACM Transactions on Networking.

[2]  Michael G. Rabbat,et al.  Compressed network monitoring for ip and all-optical networks , 2007, IMC '07.

[3]  Nick G. Duffield,et al.  Network Tomography of Binary Network Performance Characteristics , 2006, IEEE Transactions on Information Theory.

[4]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[5]  Donald F. Towsley,et al.  Network tomography on general topologies , 2002, SIGMETRICS '02.

[6]  Amin Karbasi,et al.  Graph-Constrained Group Testing , 2010, IEEE Transactions on Information Theory.

[7]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[8]  Yonggang Wen,et al.  Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Robert Nowak,et al.  Internet tomography , 2002, IEEE Signal Process. Mag..

[10]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[11]  Avi Wigderson,et al.  Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.

[12]  David L. Donoho,et al.  High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..

[13]  Pin-Han Ho,et al.  A Novel Approach for Failure Localization in All-Optical Mesh Networks , 2011, IEEE/ACM Transactions on Networking.

[14]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[15]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[16]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[17]  Enrique Mallada,et al.  Sparse recovery with graph constraints: Fundamental limits and measurement construction , 2011, 2012 Proceedings IEEE INFOCOM.

[18]  Pin-Han Ho,et al.  Adjacent Link Failure Localization With Monitoring Trails in All-Optical Mesh Networks , 2011, IEEE/ACM Transactions on Networking.

[19]  Enrique Mallada,et al.  Compressive sensing over graphs , 2010, 2011 Proceedings IEEE INFOCOM.

[20]  R. Nowak,et al.  Compressed Sensing for Networked Data , 2008, IEEE Signal Processing Magazine.

[21]  Ely Porat,et al.  Search Methodologies , 2022 .

[22]  Amin Karbasi,et al.  Group Testing With Probabilistic Tests: Theory, Design and Application , 2010, IEEE Transactions on Information Theory.

[23]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[24]  Abishek Gopalan,et al.  On Identifying Additive Link Metrics Using Linearly Independent Cycles and Paths , 2012, IEEE/ACM Transactions on Networking.

[25]  Patrick Thiran,et al.  Using End-to-End Data to Infer Lossy Links in Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[26]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[27]  Atri Rudra,et al.  Recovering simple signals , 2012, 2012 Information Theory and Applications Workshop.

[28]  A. Robert Calderbank,et al.  Choir codes: Coding for full duplex interference management , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).