메뉴 건너뛰기




Volumn 7111 LNCS, Issue , 2012, Pages 72-85

LiMoSense - Live monitoring in dynamic sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATION ALGORITHMS; DYNAMIC NETWORK TOPOLOGY; DYNAMIC SENSOR NETWORKS; FAULT-TOLERANT; MESSAGE LOSS; MONITORING ALGORITHMS; NETWORK TOPOLOGY; NODE FAILURE;

EID: 84857334825     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28209-6_7     Document Type: Conference Paper
Times cited : (11)

References (14)
  • 1
    • 84055212599 scopus 로고    scopus 로고
    • Fault- Tolerant Aggregation: Flow-Updating Meets Mass-Distribution
    • Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. Springer, Heidelberg
    • Almeida, P.S., Baquero, C., Farach-Colton, M., Jesus, P., Mosteiro, M.A.: Fault- Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 513-527. Springer, Heidelberg (2011)
    • (2011) LNCS , vol.7109 , pp. 513-527
    • Almeida, P.S.1    Baquero, C.2    Farach-Colton, M.3    Jesus, P.4    Mosteiro, M.A.5
  • 3
    • 33845199848 scopus 로고    scopus 로고
    • Efficient Dynamic Aggregation
    • Dolev, S. (ed.) DISC 2006. Springer, Heidelberg
    • Birk, Y., Keidar, I., Liss, L., Schuster, A.: Efficient Dynamic Aggregation. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 90-104. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4167 , pp. 90-104
    • Birk, Y.1    Keidar, I.2    Liss, L.3    Schuster, A.4
  • 4
    • 25844517631 scopus 로고    scopus 로고
    • Gossip algorithms: Design, analysis and applications
    • Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: INFOCOM (2005)
    • (2005) INFOCOM
    • Boyd, S.P.1    Ghosh, A.2    Prabhakar, B.3    Shah, D.4
  • 6
    • 0020828424 scopus 로고
    • Probabilistic counting algorithms for data base applications
    • Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2) (1985)
    • (1985) J. Comput. Syst. Sci. , vol.31 , Issue.2
    • Flajolet, P.1    Martin, G.N.2
  • 9
    • 78650534948 scopus 로고    scopus 로고
    • Fault-tolerant aggregation for dynamic networks
    • Jesus, P., Baquero, C., Almeida, P.: Fault-tolerant aggregation for dynamic networks. In: SRDS (2010)
    • (2010) SRDS
    • Jesus, P.1    Baquero, C.2    Almeida, P.3
  • 10
    • 0344118858 scopus 로고    scopus 로고
    • Gossip-based computation of aggregate information
    • Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: FOCS (2003)
    • (2003) FOCS
    • Kempe, D.1    Dobra, A.2    Gehrke, J.3
  • 11
  • 12
    • 33748699331 scopus 로고    scopus 로고
    • Computing separable functions via gossip
    • Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: PODC (2006)
    • (2006) PODC
    • Mosk-Aoyama, D.1    Shah, D.2
  • 13
    • 27644449262 scopus 로고    scopus 로고
    • Synopsis diffusion for robust aggregation in sensor networks
    • Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.R.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys (2004)
    • (2004) SenSys
    • Nath, S.1    Gibbons, P.B.2    Seshan, S.3    Anderson, Z.R.4
  • 14
    • 0035121216 scopus 로고    scopus 로고
    • Smart dust: Communicating with a cubic-millimeter computer
    • Warneke, B., Last, M., Liebowitz, B., Pister, K.: Smart dust: communicating with a cubic-millimeter computer. Computer 34(1) (2001)
    • (2001) Computer , vol.34 , Issue.1
    • Warneke, B.1    Last, M.2    Liebowitz, B.3    Pister, K.4


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