메뉴 건너뛰기




Volumn 17, Issue 2, 2011, Pages 319-335

Aggregation convergecast scheduling in wireless sensor networks

Author keywords

Convergecast; Data aggregation; Network lifetime; Sensor networks; TDMA scheduling

Indexed keywords

BIPARTITE GRAPHS; CONVERGECAST; DATA AGGREGATION; INTERFERENCE CONSTRAINTS; LOWER BOUNDS; MATCHINGS; NETWORK LIFETIME; PRIORITY SCHEMES; SCHEDULE LENGTH; TDMA SCHEDULING; TREE CONSTRUCTION; TWO PHASE;

EID: 79951517873     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-010-0282-y     Document Type: Article
Times cited : (96)

References (16)
  • 1
    • 79951508118 scopus 로고    scopus 로고
    • Intel lab data. http://db.csail.mit.edu/labdata/labdata.html.
  • 4
    • 33646449320 scopus 로고    scopus 로고
    • Semi-matchings for bipartite graphs and load balancing
    • 1100.68079 10.1016/j.jalgor.2005.01.003 2206900
    • N. J. A. Harvey R. E. Ladner L. Lovász T. Tamir 2006 Semi-matchings for bipartite graphs and load balancing Journal of Algorithms 59 1 53 78 1100.68079 10.1016/j.jalgor.2005.01.003 2206900
    • (2006) Journal of Algorithms , vol.59 , Issue.1 , pp. 53-78
    • Harvey, N.J.A.1    Ladner, R.E.2    Lovász, L.3    Tamir, T.4
  • 6
    • 34548324833 scopus 로고    scopus 로고
    • Nearly constant approximation for data aggregation scheduling in wireless sensor networks
    • DOI 10.1109/INFCOM.2007.50, 4215632, Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
    • Huang, S. C.-H.; Wan, P.-J.; Vu, C. T.; Li, Y.; Yao, F. (2007). Nearly constant approximation for data aggregation scheduling in wireless sensor networks. Proceedings of the 26th Conference on Computer Communications (INFOCOM'07), pp. 366-372. (Pubitemid 47334250)
    • (2007) Proceedings - IEEE INFOCOM , pp. 366-372
    • Huang, S.C.-H.1    Wan, P.-J.2    Vu, C.T.3    Li, Y.4    Yao, F.5
  • 7
    • 33644969565 scopus 로고    scopus 로고
    • Fast distributed algorithm for convergecast in ad hoc geometric radio networks
    • 1096.68781 10.1016/j.jpdc.2005.11.004
    • A. Kesselman D. R. Kowalski 2006 Fast distributed algorithm for convergecast in ad hoc geometric radio networks Journal of Parallel and Distributed Computing 66 4 578 585 1096.68781 10.1016/j.jpdc.2005.11.004
    • (2006) Journal of Parallel and Distributed Computing , vol.66 , Issue.4 , pp. 578-585
    • Kesselman, A.1    Kowalski, D.R.2
  • 11
    • 1642408650 scopus 로고    scopus 로고
    • Distributed construction of connected dominating set in wireless ad hoc networks
    • 10.1023/B:MONE.0000013625.87793.13
    • P.-J. Wan K. M. Alzoubi O. Frieder 2004 Distributed construction of connected dominating set in wireless ad hoc networks Mobile Networks and Applications 9 2 141 149 10.1023/B:MONE.0000013625.87793.13
    • (2004) Mobile Networks and Applications , vol.9 , Issue.2 , pp. 141-149
    • Wan, P.-J.1    Alzoubi, K.M.2    Frieder, O.3
  • 16
    • 55649092664 scopus 로고    scopus 로고
    • Improved algorithm for minimum data aggregation time problem in wireless sensor networks
    • 1176.90095 10.1007/s11424-008-9139-1 2460827
    • J. Zhu X. Hu 2008 Improved algorithm for minimum data aggregation time problem in wireless sensor networks Jour. of Systems Science and Complexity 21 4 626 636 1176.90095 10.1007/s11424-008-9139-1 2460827
    • (2008) Jour. of Systems Science and Complexity , vol.21 , Issue.4 , pp. 626-636
    • Zhu, J.1    Hu, X.2


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