메뉴 건너뛰기




Volumn 79, Issue 3, 2013, Pages 349-368

A novel distributed framework for optimizing query routing trees in wireless sensor networks via optimal operator placement

Author keywords

In network query processing over wireless sensor networks; Operator placement in wireless sensor networks; Query algorithms over wireless sensor networks; Query optimization in wireless sensor networks

Indexed keywords

FLOODS; FORESTRY; QUERY PROCESSING; SENSOR NODES;

EID: 84872361041     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2012.09.013     Document Type: Conference Paper
Times cited : (65)

References (35)
  • 4
    • 0014814325 scopus 로고
    • Space/time tradeoffs in hash coding with allowable errors
    • B.H. Bloom Space/time tradeoffs in hash coding with allowable errors Commun. ACM 13 7 July 1970 422
    • (1970) Commun. ACM , vol.13 , Issue.7 , pp. 422
    • Bloom, B.H.1
  • 5
    • 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 Telecommun. Syst. 26 2-4 2004 389 409
    • (2004) Telecommun. Syst. , vol.26 , Issue.24 , pp. 389-409
    • Bonfils, B.J.1    Bonnet, P.2
  • 8
    • 0028378089 scopus 로고
    • A graph theoretical approach to determine a join reducer sequence in distributed query processing
    • M.-S. Chen, and P.S. Yu A graph theoretical approach to determine a join reducer sequence in distributed query processing IEEE Trans. Knowledge Data Eng. 6 1 1994 152 165
    • (1994) IEEE Trans. Knowledge Data Eng. , vol.6 , Issue.1 , pp. 152-165
    • Chen, M.-S.1    Yu, P.S.2
  • 9
    • 84860375330 scopus 로고    scopus 로고
    • Intelligent algorithms for data-centric sensor networks
    • A. Cuzzocrea Intelligent algorithms for data-centric sensor networks J. Network Comput. Appl. 35 4 2012 1175 1176
    • (2012) J. Network Comput. Appl. , vol.35 , Issue.4 , pp. 1175-1176
    • Cuzzocrea, A.1
  • 10
    • 84860364043 scopus 로고    scopus 로고
    • Edge betweenness centrality: A novel algorithm for qos-based topology control over wireless sensor networks
    • A. Cuzzocrea, A. Papadimitriou, D. Katsaros, and Y. Manolopoulos Edge betweenness centrality: A novel algorithm for qos-based topology control over wireless sensor networks J. Network Comput. Appl. 35 4 2012 1210 1217
    • (2012) J. Network Comput. Appl. , vol.35 , Issue.4 , pp. 1210-1217
    • Cuzzocrea, A.1    Papadimitriou, A.2    Katsaros, D.3    Manolopoulos, Y.4
  • 11
    • 70350443583 scopus 로고    scopus 로고
    • Prdb: Managing large-scale correlated probabilistic databases (abstract)
    • L. Godo, A. Pugliese, Lecture Notes in Comput. Sci. Springer
    • A. Deshpande Prdb: Managing large-scale correlated probabilistic databases (abstract) L. Godo, A. Pugliese, SUM Lecture Notes in Comput. Sci. vol. 5785 2009 Springer 1
    • (2009) SUM , vol.5785 , pp. 1
    • Deshpande, A.1
  • 12
  • 26
    • 0345851235 scopus 로고    scopus 로고
    • Wireless integrated network sensors
    • G.J. Pottie, and W.J. Kaiser Wireless integrated network sensors Commun. ACM 43 5 2000 51 58
    • (2000) Commun. ACM , vol.43 , Issue.5 , pp. 51-58
    • Pottie, G.J.1    Kaiser, W.J.2
  • 27
    • 0034777089 scopus 로고    scopus 로고
    • Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks
    • E. Shih, S.-H. Cho, N. Ickes, R. Min, A. Sinha, A. Wang, A. Chandrakasan, Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks, in: MOBICOM, 2001, pp. 272-287.
    • (2001) MOBICOM , pp. 272-287
    • Shih, E.1    Cho, S.-H.2    Ickes, N.3    Min, R.4    Sinha, A.5    Wang, A.6    Chandrakasan, A.7
  • 29
    • 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 ICDE 2004 IEEE Computer Society 214 226
    • (2004) ICDE , pp. 214-226
    • Tao, Y.1    Kollios, G.2    Considine, J.3    Li, F.4    Papadias, D.5
  • 31
    • 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 Tohoku Math. J. 43 1937 355 386
    • (1937) Tohoku Math. J. , vol.43 , pp. 355-386
    • Weiszfeld, E.1
  • 32
    • 26444534431 scopus 로고    scopus 로고
    • Probability based dynamic load-balancing tree algorithm for wireless sensor networks
    • T. Yan, Y. Bi, L. Sun, H. Zhu, Probability based dynamic load-balancing tree algorithm for wireless sensor networks, in: Int. Conf. Networking and Mobile Computing, 2005.
    • (2005) Int. Conf. Networking and Mobile Computing
    • Yan, T.1    Bi, Y.2    Sun, L.3    Zhu, H.4
  • 34
    • 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 INFOCOM 2008 IEEE 977 985
    • (2008) INFOCOM , pp. 977-985
    • Ying, L.1    Liu, Z.2    Towsley, D.F.3    Xia, C.H.4
  • 35
    • 10944266504 scopus 로고    scopus 로고
    • Heed: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
    • O. Younis, and S. Fahmy Heed: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks IEEE Trans. Mob. Comput. 3 4 2004 366 379
    • (2004) IEEE Trans. Mob. Comput. , vol.3 , Issue.4 , pp. 366-379
    • Younis, O.1    Fahmy, S.2


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