메뉴 건너뛰기




Volumn 60, Issue 3, 2011, Pages 386-399

Complexity of data collection, aggregation, and selection for wireless sensor networks

Author keywords

complexity analysis; data collection; data selection; Wireless sensor networks

Indexed keywords

AGGREGATED VALUES; COMPLEXITY ANALYSIS; DATA AGGREGATION; DATA COLLECTION; DATA SELECTION; DISTRIBUTED ALGORITHM; ENERGY COST; LOWER BOUNDS; MESSAGE COMPLEXITY; MULTIHOP WIRELESS; OPTIMAL METHODS; TIME COMPLEXITY; TOTAL ENERGY; UPPER BOUND;

EID: 79551553052     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2010.50     Document Type: Article
Times cited : (65)

References (27)
  • 4
    • 33644969565 scopus 로고    scopus 로고
    • Fast distributed algorithm for convergecast in ad hoc geometric radio networks
    • A. Kesselman and D.R. Kowalski, "Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks," J. Parallel and Distributed Computing, vol. 66, no. 4, pp. 578-585, 2006.
    • (2006) J. Parallel and Distributed Computing , vol.66 , Issue.4 , pp. 578-585
    • Kesselman, A.1    Kowalski, D.R.2
  • 8
    • 0242527347 scopus 로고    scopus 로고
    • Message-Optimal connected dominating sets in mobile ad hoc networks
    • K. Alzoubi, P.J. Wan, and O. Frieder, "Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks," Proc. ACM MobiHoc, 2002.
    • (2002) Proc. ACM MobiHoc
    • Alzoubi, K.1    Wan, P.J.2    Frieder, O.3
  • 10
    • 33746340457 scopus 로고    scopus 로고
    • An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks
    • C. Ambuhl, "An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks," Proc. Int'l Colloquium Automata, Languages and Programming, 2005.
    • (2005) Proc. Int'l Colloquium Automata, Languages and Programming
    • Ambuhl, C.1
  • 12
    • 52449148031 scopus 로고
    • An improved algorithm for finding the median distributively
    • F. Chin and H.F. Ting, "An Improved Algorithm for Finding the Median Distributively," Algorithmica, vol. 2, no. 1, pp. 235-249, 1987.
    • (1987) Algorithmica , vol.2 , Issue.1 , pp. 235-249
    • Chin, F.1    Ting, H.F.2
  • 13
    • 49049133870 scopus 로고
    • Finding the median distributively
    • M. Rodeh, "Finding the Median Distributively," J. Computer and System Sciences, vol. 24, no. 2, pp. 162-166, 1982.
    • (1982) J. Computer and System Sciences , vol.24 , Issue.2 , pp. 162-166
    • Rodeh, M.1
  • 16
    • 0002187292 scopus 로고
    • An almost optimal algorithm for unbounded searching
    • J. Bentley and A. Yao, "An Almost Optimal Algorithm for Unbounded Searching," Information Processing Letters, vol. 5, no. 3, pp. 82-87, 1976.
    • (1976) Information Processing Letters , vol.5 , Issue.3 , pp. 82-87
    • Bentley, J.1    Yao, A.2
  • 25
    • 29844448642 scopus 로고    scopus 로고
    • Tributaries and deltas: Efficient and robust aggregation in sensor network streams
    • A. Manjhi, S. Nath, and P.B. Gibbons, "Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams," Proc. ACM SIGMOD, 2005.
    • (2005) Proc. ACM SIGMOD
    • Manjhi, A.1    Nath, S.2    Gibbons, P.B.3
  • 26
    • 78649821231 scopus 로고    scopus 로고
    • A delay efficient algorithm for data aggregation in multi-hop wireless sensor networks
    • Jan.
    • X. Xu, X.-Y. Li, X. Mao, S. Tang, and S. Wang, "A Delay Efficient Algorithm for Data Aggregation in Multi-Hop Wireless Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 1, pp. 163-175, Jan. 2011.
    • (2011) IEEE Trans. Parallel and Distributed Systems , vol.22 , Issue.1 , pp. 163-175
    • Xu, X.1    Li, X.-Y.2    Mao, X.3    Tang, S.4    Wang, S.5


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