2015
DOI: 10.1109/lcomm.2014.2360386
|View full text |Cite
|
Sign up to set email alerts
|

Peer-to-Peer Compressive Sensing for Network Monitoring

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…is the 1 norm of X. A collaborative and distributed framework according to which nodes cooperate with each other in order to monitor the status of the entire network (i.e., efficiently recover any k-sparse networked data vector) is presented in [43]. Every node, apart from its own measurements utilizes measurements generated by the rest nodes, with the goal of reducing the number of overall required measurements.…”
Section: Compressed Sensing Enabled Network Tomographymentioning
confidence: 99%
See 1 more Smart Citation
“…is the 1 norm of X. A collaborative and distributed framework according to which nodes cooperate with each other in order to monitor the status of the entire network (i.e., efficiently recover any k-sparse networked data vector) is presented in [43]. Every node, apart from its own measurements utilizes measurements generated by the rest nodes, with the goal of reducing the number of overall required measurements.…”
Section: Compressed Sensing Enabled Network Tomographymentioning
confidence: 99%
“…Fragouli et al [27] binary trees Sattari et al [28] m-ary trees, M-by-N DAGs Jithin et al [30] M-by-N DAGs, asynchronous sources Yao et al [31] RLNC, NRSC, passive tomography Mohammad et al [33] RLNC, congested link location Gui et al [34] mesh DAG topologies Gui et al [35] mesh DAG topologies, minimum probe size Shah-Mansouri et al [36] WSN, RLNC, subspace property, virtual sources Sattari et al [37] trees and general topologies Sattari et al [38] trees with multiple sources Fan et al [52] weighted 1 minimization, expander graphs Chen et al [53] link congestion probabilities, greedy iterative algorithm Takemoto et al [54] measurement paths construction, low-quality link detection Morita et al [56] wireless multihop networks, GFT, spatially dependent channels Bandara et al [57] scalable, adaptive fault localization Firooz et al [41] k-identifiability, expander graphs Fattaholmanan et al [43] collaborative distributed framework, individual matrix for every node Wang et al [44] expander graphs, 1 minimization Fan et al [45] synchronization errors, constrained 1 − 2 optimization Nakanishi et al [46] no clock synchronization, reflective NT Nakanishi et al [47] synchronization errors, differential routing matrix Kinsho et al [48] mobile networks, GFT & passive measurements Wei et al [49] dynamic networks, line graph model Table 2. Overview of key points, advantages, and performance of selected tomographic methods.…”
Section: Network Compressed Loss Delay Topology Comments Coding Sensingmentioning
confidence: 99%
“…This itself generates a lot of overhead in the network. A model is proposed in which nodes pick up information from measurements generated by other nodes, an upper bound is derived for the number of measurements that each node must generate, such that the expected number of measurements observed by each node is sufficient to provide a global view of the entire networked data (27).…”
Section: Compressed Network Monitoringmentioning
confidence: 99%