메뉴 건너뛰기




Volumn , Issue , 2010, Pages 167-176

A distributed technique for dynamic operator placement in wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

1-MEDIAN; COMMUNICATION COST; DISTRIBUTED ALGORITHM; DISTRIBUTED TECHNIQUES; DYNAMIC OPERATORS; VARIABLE SPEED;

EID: 77955183500     PISSN: 15516245     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MDM.2010.16     Document Type: Conference Paper
Times cited : (11)

References (21)
  • 6
    • 51349108839 scopus 로고    scopus 로고
    • Distributed operator placement and data caching in large-scale sensor networks
    • IEEE
    • L. Ying, Z. Liu, D. F. Towsley, and C. H. Xia, "Distributed operator placement and data caching in large-scale sensor networks," in INFOCOM. IEEE, 2008, pp. 977-985.
    • (2008) INFOCOM , pp. 977-985
    • Ying, L.1    Liu, Z.2    Towsley, D.F.3    Xia, C.H.4
  • 9
    • 3543145987 scopus 로고    scopus 로고
    • Adaptive and decentralized operator placement for in-network query processing
    • B. J. Bonfils and P. Bonnet, "Adaptive and decentralized operator placement for in-network query processing," Telecommunication Systems, vol.26, no.2-4, pp. 389-409, 2004.
    • (2004) Telecommunication Systems , vol.26 , Issue.2-4 , pp. 389-409
    • Bonfils, B.J.1    Bonnet, P.2
  • 13
    • 0000281286 scopus 로고
    • Sur le point pour lequel la somme des distances de n points donnes est minimum
    • E. Weiszfeld, "Sur le point pour lequel la somme des distances de n points donnes est minimum," in Tohoku Mathematics Journal, vol.43, 1937, p. 355386.
    • (1937) Tohoku Mathematics Journal , vol.43 , pp. 355386
    • Weiszfeld, E.1
  • 15
    • 77955196058 scopus 로고    scopus 로고
    • Model-based querying in sensor networks
    • L. Liu and M. T. Özsu, Eds. Springer US
    • A. Deshpande, C. Guestrin, and S. Madden, "Model-based querying in sensor networks," in Encyclopedia of Database Systems, L. Liu and M. T. Özsu, Eds. Springer US, 2009, pp. 1764-1768.
    • (2009) Encyclopedia of Database Systems , pp. 1764-1768
    • Deshpande, A.1    Guestrin, C.2    Madden, S.3
  • 16
    • 70350443583 scopus 로고    scopus 로고
    • Prdb: Managing large-scale correlated probabilistic databases (abstract)
    • Lecture Notes in Computer Science, L. Godo and A. Pugliese, Eds. Springer
    • A. Deshpande, "Prdb: Managing large-scale correlated probabilistic databases (abstract)," in SUM, ser. Lecture Notes in Computer Science, L. Godo and A. Pugliese, Eds., vol.5785. Springer, 2009, p. 1.
    • (2009) SUM , vol.5785 , pp. 1
    • Deshpande, A.1
  • 19
    • 2442494003 scopus 로고    scopus 로고
    • Spatio-temporal aggregation using sketches
    • IEEE Computer Society
    • Y. Tao, G. Kollios, J. Considine, F. Li, and D. Papadias, "Spatio-temporal aggregation using sketches," in ICDE. IEEE Computer Society, 2004, pp. 214-226.
    • (2004) ICDE , pp. 214-226
    • Tao, Y.1    Kollios, G.2    Considine, J.3    Li, F.4    Papadias, D.5
  • 20
    • 0014814325 scopus 로고
    • Space/time tradeoffs in hash coding with allowable errors
    • July
    • B. H. Bloom, "Space/time tradeoffs in hash coding with allowable errors," Comm. of the ACM, vol.13, no.7, p. 422, July 1970.
    • (1970) Comm. of the ACM , vol.13 , Issue.7 , pp. 422
    • Bloom, B.H.1


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