메뉴 건너뛰기




Volumn 7109 LNCS, Issue , 2011, Pages 513-527

Fault-tolerant aggregation: Fow-updating meets mass-distribution

Author keywords

Aggregate computation; Communication networks; Distributed computing; Radio networks

Indexed keywords

AGGREGATE FUNCTION; COMMUNICATION FAILURE; CONVERGENCE TIME; DISTRIBUTED COMPUTATIONS; FAULT-TOLERANT; GLOBAL INFORMATIONS; HIGH RATE; INPUT VALUES; LINEAR PREDICTION; LOW OVERHEAD; MESSAGE LOSS; NEW PROTOCOL; RADIO NETWORKS;

EID: 84055212599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25873-2_35     Document Type: Conference Paper
Times cited : (8)

References (35)
  • 5
    • 47249089046 scopus 로고    scopus 로고
    • Analysis of distributed random grouping for aggregate computation on wireless sensor networks with randomly changing graphs
    • Chen, J.-Y., Hu, J.: Analysis of distributed random grouping for aggregate computation on wireless sensor networks with randomly changing graphs. IEEE Trans. Parallel Distr. Syst. 19(8), 1136-1149 (2008)
    • (2008) IEEE Trans. Parallel Distr. Syst. , vol.19 , Issue.8 , pp. 1136-1149
    • Chen, J.-Y.1    Hu, J.2
  • 7
    • 33747610408 scopus 로고    scopus 로고
    • Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis
    • Chen, J.-Y., Pandurangan, G., Xu, D.: Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis. IEEE Trans. Parallel Distr. Syst. 17(9), 987-1000 (2006)
    • (2006) IEEE Trans. Parallel Distr. Syst. , vol.17 , Issue.9 , pp. 987-1000
    • Chen, J.-Y.1    Pandurangan, G.2    Xu, D.3
  • 12
    • 84055174640 scopus 로고    scopus 로고
    • Randomized gossiping in radio networks
    • Kao, M.-Y. (ed.) Springer, Heidelberg
    • Gasieniec, L.: Randomized gossiping in radio networks. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms. Springer, Heidelberg (2008)
    • (2008) Encyclopedia of Algorithms
    • Gasieniec, L.1
  • 13
    • 0035789181 scopus 로고    scopus 로고
    • Scalable fault-tolerant aggregation in large process groups
    • IEEE Computer Society
    • Gupta, I., van Renesse, R., Birman, K.P.: Scalable fault-tolerant aggregation in large process groups. In: DSN, pp. 433-442. IEEE Computer Society (2001)
    • (2001) DSN , pp. 433-442
    • Gupta, I.1    Van Renesse, R.2    Birman, K.P.3
  • 16
    • 0036375244 scopus 로고    scopus 로고
    • Impact of network density on data aggregation in wireless sensor networks
    • Intanagonwiwat, C., Estrin, D., Govindan, R., Heidemann, J.S.: Impact of network density on data aggregation in wireless sensor networks. In: ICDCS, pp. 457-458 (2002)
    • (2002) ICDCS , pp. 457-458
    • Intanagonwiwat, C.1    Estrin, D.2    Govindan, R.3    Heidemann, J.S.4
  • 19
    • 68749103682 scopus 로고    scopus 로고
    • Fault-Tolerant Aggregation by Flow Updating
    • Senivongse, T., Oliveira, R. (eds.) DAIS 2009. Springer, Heidelberg
    • Jesus, P., Baquero, C., Almeida, P.S.: Fault-Tolerant Aggregation by Flow Updating. In: Senivongse, T., Oliveira, R. (eds.) DAIS 2009. LNCS, vol. 5523, pp. 73-86. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5523 , pp. 73-86
    • Jesus, P.1    Baquero, C.2    Almeida, P.S.3
  • 22
    • 13844255683 scopus 로고    scopus 로고
    • Time complexity of radio broadcasting: Adaptiveness vs. obliviousness and randomization vs. determinism
    • Kowalski, D.R., Pelc, A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science 333, 355-371 (2005)
    • (2005) Theoretical Computer Science , vol.333 , pp. 355-371
    • Kowalski, D.R.1    Pelc, A.2
  • 23
    • 84994296501 scopus 로고    scopus 로고
    • The impact of data aggregation in wireless sensor networks
    • IEEE Computer Society
    • Krishnamachari, B., Estrin, D., Wicker, S.B.: The impact of data aggregation in wireless sensor networks. In: ICDCS Workshops, pp. 575-578. IEEE Computer Society (2002)
    • (2002) ICDCS Workshops , pp. 575-578
    • Krishnamachari, B.1    Estrin, D.2    Wicker, S.B.3
  • 27
    • 4644244041 scopus 로고    scopus 로고
    • Consensus problems in networks of agents with switching topology and time-delays
    • Olfati-Saber, R., Murray, R.M.: Consensus problems in networks of agents with switching topology and time-delays. Transactions on Automatic Control 49(9), 1520-1533 (2004)
    • (2004) Transactions on Automatic Control , vol.49 , Issue.9 , pp. 1520-1533
    • Olfati-Saber, R.1    Murray, R.M.2
  • 30
    • 0024699930 scopus 로고
    • Approximate counting, uniform generation and rapidly mixing markov chains
    • Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing markov chains. Information and Computation 82(1), 93-133 (1989)
    • (1989) Information and Computation , vol.82 , Issue.1 , pp. 93-133
    • Sinclair, A.1    Jerrum, M.2
  • 32
    • 3142770678 scopus 로고    scopus 로고
    • Fast linear iterations for distributed average
    • Xiao, L., Boyd, S.: Fast linear iterations for distributed average. Systems and Control Letters 53, 65-78 (2004)
    • (2004) Systems and Control Letters , vol.53 , pp. 65-78
    • Xiao, L.1    Boyd, S.2


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