메뉴 건너뛰기




Volumn 21, Issue 4, 2008, Pages 618-628

Improved algorithm for minimum data aggregation time problem in wireless sensor networks

Author keywords

Approximation algorithm; Data aggregation; Wireless sensor network

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY;

EID: 55649092664     PISSN: 10096124     EISSN: 15597067     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (27)

References (9)
  • 1
    • 0034292277 scopus 로고    scopus 로고
    • DataSpace: Querying and monitoring deeply networked collections in physical space
    • 5
    • T. Imielinski S. Goel 2000 DataSpace: querying and monitoring deeply networked collections in physical space IEEE Personal Communication 7 5 4 9
    • (2000) IEEE Personal Communication , vol.7 , pp. 4-9
    • Imielinski, T.1    Goel, S.2
  • 5
    • 33646854367 scopus 로고    scopus 로고
    • Minimum data aggregation time problem in wireless sensor networks
    • X. Chen X. Hu J. Zhu 2005 Minimum data aggregation time problem in wireless sensor networks Lecture Notes in Computer Sciences 3794 133 142
    • (2005) Lecture Notes in Computer Sciences , vol.3794 , pp. 133-142
    • Chen, X.1    Hu, X.2    Zhu, J.3
  • 6
    • 0003488186 scopus 로고    scopus 로고
    • GPS-less low cost outdoor localization for very small devices
    • Computer Science Department, University of Sourthern California, April
    • N. Bulusu, J. Heidemann, and D. Estrin, GPS-less low cost outdoor localization for very small devices, Technical Report 00-729, Computer Science Department, University of Sourthern California, April, 2000.
    • (2000) Technical Report 00-729
    • Bulusu, N.1    Heidemann, J.2    Estrin, D.3


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