메뉴 건너뛰기




Volumn , Issue , 2010, Pages

On computing compression trees for data collection in wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST COMMUNICATION MODELS; CORRELATED DATA; DATA COLLECTION; DIRECTED TREES; LOWER BOUNDS; OPTIMAL COMPRESSION; OPTIMALITY; REAL-WORLD DATASETS; SENSOR NETWORK NODES; UNICAST COMMUNICATION; WEAKLY-CONNECTED DOMINATING SETS;

EID: 77953300741     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462035     Document Type: Conference Paper
Times cited : (29)

References (29)
  • 1
    • 0015648934 scopus 로고
    • Noiseless coding of correlated information sources
    • D. Slepian and J. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Info. Theory, vol. 19, no. 4, 1973.
    • (1973) IEEE Trans. Info. Theory , vol.19 , Issue.4
    • Slepian, D.1    Wolf, J.2
  • 2
    • 0016882596 scopus 로고
    • The rate-distortion function for source coding with side information at the decoder
    • A. D. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Info. Theory, 1976.
    • (1976) IEEE Trans. Info. Theory
    • Wyner, A.D.1    Ziv, J.2
  • 4
    • 34047223689 scopus 로고    scopus 로고
    • A combinatorial algorithmic approach to energy efficient information collection in wireless sensor networks
    • X. Su, "A combinatorial algorithmic approach to energy efficient information collection in wireless sensor networks," ACM Trans. Sen. Netw., vol. 3, no. 1, p. 6, 2007.
    • (2007) ACM Trans. Sen. Netw. , vol.3 , Issue.1 , pp. 6
    • Su, X.1
  • 5
    • 29144528107 scopus 로고    scopus 로고
    • Networked slepianwolf: Theory, algorithms, and scaling laws
    • R. Cristescu, B. Beferull-Lozano, and M. Vetterli, "Networked slepianwolf: Theory, algorithms, and scaling laws," IEEE Trans. Info. Theory, vol. 51(12), pp. 4057-4073, 2005.
    • (2005) IEEE Trans. Info. Theory , vol.51 , Issue.12 , pp. 4057-4073
    • Cristescu, R.1    Beferull-Lozano, B.2    Vetterli, M.3
  • 6
    • 0037356065 scopus 로고    scopus 로고
    • Distributed source coding using syndromes (DISCUS): Design and construction
    • S. Pradhan and K. Ramchandran, "Distributed source coding using syndromes (DISCUS): Design and construction," IEEE Trans. Information Theory, 2003.
    • (2003) IEEE Trans. Information Theory
    • Pradhan, S.1    Ramchandran, K.2
  • 7
    • 3042779882 scopus 로고    scopus 로고
    • The impact of spatial correlation on routing with compression in wireless sensor networks
    • S. Pattem, B. Krishnamachari, and R. Govindan, "The impact of spatial correlation on routing with compression in wireless sensor networks," in IPSN, 2004.
    • (2004) IPSN
    • Pattem, S.1    Krishnamachari, B.2    Govindan, R.3
  • 8
    • 33749644725 scopus 로고    scopus 로고
    • Approximate data collection in sensor networks using probabilistic models
    • D. Chu, A. Deshpande, J. Hellerstein, W. Hong, "Approximate data collection in sensor networks using probabilistic models," ICDE, 2006.
    • (2006) ICDE
    • Chu, D.1    Deshpande, A.2    Hellerstein, J.3    Hong, W.4
  • 10
    • 33751030853 scopus 로고    scopus 로고
    • On optimal communication cost for gathering correlated data through wireless sensor networks
    • J. Liu, M. Adler, D. Towsley, and C. Zhang, "On optimal communication cost for gathering correlated data through wireless sensor networks," in Proceedings of ACM Mobicom, 2006.
    • Proceedings of ACM Mobicom, 2006
    • Liu, J.1    Adler, M.2    Towsley, D.3    Zhang, C.4
  • 11
    • 70449129658 scopus 로고    scopus 로고
    • Predictive modeling-based data collection in wireless sensor networks
    • L. Wang and A. Deshpande, "Predictive modeling-based data collection in wireless sensor networks," in EWSN, 2008.
    • (2008) EWSN
    • Wang, L.1    Deshpande, A.2
  • 14
    • 0036949173 scopus 로고    scopus 로고
    • On the interdependence of routing and data compression in multi-hop sensor networks
    • A. Scaglione and S. Servetto, "On the interdependence of routing and data compression in multi-hop sensor networks," in Mobicom, 2002.
    • (2002) Mobicom
    • Scaglione, A.1    Servetto, S.2
  • 15
    • 0037739959 scopus 로고    scopus 로고
    • Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk
    • A. Goel and D. Estrin, "Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk," in SODA, 2003.
    • (2003) SODA
    • Goel, A.1    Estrin, D.2
  • 16
    • 28444434729 scopus 로고    scopus 로고
    • Snapshot queries: Towards data-centric sensor networks
    • Y. Kotidis, "Snapshot queries: Towards data-centric sensor networks," in ICDE, 2005.
    • (2005) ICDE
    • Kotidis, Y.1
  • 17
    • 29844446165 scopus 로고    scopus 로고
    • Efficient gathering of correlated data in sensor networks
    • H. Gupta, V. Navda, S. Das, and V. Chowdhary, "Efficient gathering of correlated data in sensor networks," in MobiHoc, 2005.
    • (2005) MobiHoc
    • Gupta, H.1    Navda, V.2    Das, S.3    Chowdhary, V.4
  • 18
    • 84933530882 scopus 로고
    • Approximating Discrete Probability Distributions with Dependence Trees
    • C. Chow and C. Liu, "Approximating Discrete Probability Distributions with Dependence Trees," IEEE Trans. on Information Theory, 1968.
    • (1968) IEEE Trans. on Information Theory
    • Chow, C.1    Liu, C.2
  • 19
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • S. Guha and S. Khuller, "Approximation algorithms for connected dominating sets," Algorithmica, vol. 20, no. 4, 1998.
    • (1998) Algorithmica , vol.20 , Issue.4
    • Guha, S.1    Khuller, S.2
  • 20
    • 0141639922 scopus 로고    scopus 로고
    • Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
    • Y. Chen and A. L. Liestman, "Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks," in Mobihoc, 2002, pp. 165-172.
    • (2002) Mobihoc , pp. 165-172
    • Chen, Y.1    Liestman, A.L.2
  • 21
    • 0032108328 scopus 로고    scopus 로고
    • A threshold of ln n for approximating set cover
    • U. Feige, "A threshold of ln n for approximating set cover." J. ACM, vol. 45, no. 4, pp. 634-652, 1998.
    • (1998) J. ACM , vol.45 , Issue.4 , pp. 634-652
    • Feige, U.1
  • 22
    • 0001490886 scopus 로고    scopus 로고
    • Approximation algorithm for directed Steiner problem
    • M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, and M. Li, "Approximation algorithm for directed Steiner problem," J. Algo., vol. 33, no. 1, pp. 73-91, 1999.
    • (1999) J. Algo. , vol.33 , Issue.1 , pp. 73-91
    • Charikar, M.1    Chekuri, C.2    Cheung, T.3    Dai, Z.4    Goel, A.5    Li, M.6
  • 25
    • 0034539015 scopus 로고    scopus 로고
    • Directed diffusion: A scalable and robust communication paradigm for sensor networks
    • C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks," in ACM Mobicom, 2000.
    • (2000) ACM Mobicom
    • Intanagonwiwat, C.1    Govindan, R.2    Estrin, D.3
  • 27
    • 0033877788 scopus 로고    scopus 로고
    • Energy-efficient communication protocol for wireless microsensor networks
    • W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in HICSS, 2000.
    • (2000) HICSS
    • Heinzelman, W.R.1    Chandrakasan, A.2    Balakrishnan, H.3
  • 29
    • 34250676986 scopus 로고    scopus 로고
    • Constraint-chaining: Energy-efficient continuous monitoring in sensor networks
    • A. Silberstein, R. Braynard, and J. Yang, "Constraint-chaining: Energy-efficient continuous monitoring in sensor networks," in SIGMOD, 2006.
    • (2006) SIGMOD
    • Silberstein, A.1    Braynard, R.2    Yang, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.