Local access to sparse and large global information in P2P networks: A case for compressive sensing

2010 IEEE 10th International Conference on Peer-to-Peer Computing, P2P 2010 - Proceedings

Volumn , Issue , 2010, Pages

  Gaeta, Rossano ^a   Grangetto, Marco ^a   Sereno, Matteo ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL MODEL; COMMUNICATION LINKS; COMPRESSIVE SENSING; DISTRIBUTED APPROACHES; FOLLOWING PROBLEM; GLOBAL INFORMATIONS; INFORMATION DYNAMICS; INFORMATION RECOVERY; MATRIX; MODEL PREDICTION; NETWORK LEVEL; P2P NETWORK; PACKET PAYLOADS; PEER-TO-PEER OVERLAY NETWORKS; PLANETLAB; RANDOM COMBINATION; RANDOM WALK; REALISTIC ENVIRONMENTS;

DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; OVERLAY NETWORKS; SIGNAL RECONSTRUCTION;

PEER TO PEER NETWORKS;

EID: 78349286741     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2010.5569971     Document Type: Conference Paper

References (17)

1. M. Jelasity, A. Montresor, and O. Babaoglu, "Gossip-based aggregation in large dynamic networks," ACM Transactions on Computer Systems, vol. 23, no. 3, pp. 219-252, Aug. 2005.
2. E. Candès and T. Tao, "Near-optimal signal recovery from random projections: universal encoding strategies?" IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
3. D. Donoho, "Compressed sensing," IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
4. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections," IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 4036-4048, Sep. 2006.
5. T. T Bu, J. Cao, A. Chen, and P. Lee, "A fast and compact method for unveiling significant patterns in high speed networks," in IEEE INFOCOM 2006, Apr. 2006.
6. Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani, "Counter braids: a novel counter architecture for per-flow measurement," in ACM SIGMETRICS 2008, Jun. 2008.
7. Y. Zhang, M. Roughan, W. Willinger, and L. Qiu, "Spatio-temporal compressive sensing and internet traffic matrices," in ACM SIGCOMM 2009, Aug. 2009.
8. W. Bajwa, J. Haupt, A. Sayeed, and N. R., "Compressive wireless sensing," in IPSN, Apr. 2006.
9. J. Meng, H. Li, and Z. Han, "Sparse event detection in wireless sensor networks using compressive sensing," in 43rd Annual Conference on Information Sciences and Systems (CISS), 2009, pp. 182-185.
10. M. Rabbat, J. Haupt, A. Singh, and R. Nowak, "Decentralized compression and predistribution via randomized gossiping," in IPSN, Apr. 2006.
11. J. Haupt, W. Bajwa, M. Rabbat, and R. Nowak, "Compressed sensing for networked data," IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 92-101, Mar. 2008.
12. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and S. M.J., "Combining geometry and combinatorics: A unified approach to sparse signal recovery," preprint, 2008.
13. R. Berinde, P. Indyk, and M. Ruzic, "Practical near-optimal sparse recovery in the l1 norm," in Allerton Conference on Communication, Control and Computing, 2008.
14. S. Jafarpour, X. W., B. Hassibi, and R. Calderbank, "Efficient and robust compressed sensing using optimized expander graphs," IEEE Transactions on Information Theory, vol. 55, no. 9, pp. 4299-4308, Sep. 2009.
15. J. Tropp and D. Needell, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol. 26, pp. 301-321, 2008.
16. A. Kermarrec, L. Massoulié, and A. Ganesh, "Probabilistic reliable dissemination in large-scale systems," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 248-258, Mar. 2003.
17. L. Alvisi and et al, "How robust are gossip-based communication protocols?" Operating Systems Review, vol. 41, no. 5, pp. 14-18, Oct. 2007.