메뉴 건너뛰기




Volumn , Issue , 2007, Pages 85-89

Efficiency of the gossip algorithm for wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL RESULTS; COMPUTATIONAL BURDEN; CONNECTED NETWORKS; CONVERGENCE TIME; DISTRIBUTED COMPUTING; GOSSIP ALGORITHMS; NUMERICAL SIMULATION; OPTIMIZATION TECHNIQUES;

EID: 67649978995     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SOFTCOM.2007.4446065     Document Type: Conference Paper
Times cited : (18)

References (8)
  • 4
    • 25844517631 scopus 로고    scopus 로고
    • Gossip algorithms: Design, analysis and applications
    • Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
    • S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip algorithms: Design, analysis, and applications", in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, vol.3, pp. 1653-1664. (Pubitemid 41390681)
    • (2005) Proceedings - IEEE INFOCOM , vol.3 , pp. 1653-1664
    • Boyd, S.1    Ghosh, A.2    Prabhakar, B.3    Shah, D.4
  • 8
    • 67649913550 scopus 로고    scopus 로고
    • Analysis and Optimization of the Gossip Algorithm for Wireless Sensor Networks
    • M. Baldi, F. Chiaraluce, and E. Zanaj, "Analysis and Optimization of the Gossip Algorithm for Wireless Sensor Networks", in preparation.
    • In Preparation
    • Baldi, M.1    Chiaraluce, F.2    Zanaj, E.3


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