메뉴 건너뛰기




Volumn , Issue , 2008, Pages

A combinatorial algorithm for the maximum lifetime data gathering and aggregation problem in sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL ALGORITHMS; DATA GATHERING; IN-NETWORK AGGREGATION; INTERNATIONAL SYMPOSIUM; ITERATIVE ALGORITHMS; MAXIMUM LIFETIME; MULTIMEDIA NETWORKS; SYSTEM LIFE-TIME;

EID: 52049083033     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WOWMOM.2008.4594858     Document Type: Conference Paper
Times cited : (6)

References (15)
  • 2
    • 13644283480 scopus 로고    scopus 로고
    • Local ratio: A unified framework for approximation algorithms
    • R. Bar-Yehuda, K. Bendel, A. Freund, and D. Rawitz. Local ratio: A unified framework for approximation algorithms. ACM Computing Surveys, 36(4):422-463, 2004.
    • (2004) ACM Computing Surveys , vol.36 , Issue.4 , pp. 422-463
    • Bar-Yehuda, R.1    Bendel, K.2    Freund, A.3    Rawitz, D.4
  • 4
    • 84947812652 scopus 로고    scopus 로고
    • Fast approximate algorithm for maximum lifetime routing in wireless ad-hoc networks
    • J. H. Chang and L. Tassiulas. Fast approximate algorithm for maximum lifetime routing in wireless ad-hoc networks. In Networking 2000, volume LNCS 1815, pages 702-713, 2000.
    • (2000) Networking 2000 , vol.LNCS 1815 , pp. 702-713
    • Chang, J.H.1    Tassiulas, L.2
  • 6
    • 0032317818 scopus 로고    scopus 로고
    • Faster and simpler algorithms for multicommodity flow and other fractional packing problems
    • N. Garg and J. Konemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In IEEE Symposium on Foundations of Computer Science, pages 300-309, 1998.
    • (1998) IEEE Symposium on Foundations of Computer Science , pp. 300-309
    • Garg, N.1    Konemann, J.2
  • 8
    • 0038148549 scopus 로고    scopus 로고
    • Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
    • K. Kalpakis, K. Dasgupta, and P. Namjoshi. Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Computer Networks, 42(6):697-716, 2003.
    • (2003) Computer Networks , vol.42 , Issue.6 , pp. 697-716
    • Kalpakis, K.1    Dasgupta, K.2    Namjoshi, P.3
  • 12
    • 8344254370 scopus 로고    scopus 로고
    • Maximizing data extraction in energy-limited sensor networks
    • N. Sadagopan and B. Krishnamachari. Maximizing data extraction in energy-limited sensor networks. In Proc. of INFOCOM, 2004.
    • (2004) Proc. of INFOCOM
    • Sadagopan, N.1    Krishnamachari, B.2
  • 14
    • 0017465744 scopus 로고
    • Finding optimum branchings
    • R. Tarjan. Finding optimum branchings. Networks, 7(1):25-35, 1977.
    • (1977) Networks , vol.7 , Issue.1 , pp. 25-35
    • Tarjan, R.1
  • 15
    • 29844437079 scopus 로고    scopus 로고
    • Maximizing lifetime for data aggregation in wireless sensor networks
    • Y. Xue, Y. Cui, and K. Nahrstedt. Maximizing lifetime for data aggregation in wireless sensor networks. Mobile Networks and Applications, 10(6):853-864, 2005.
    • (2005) Mobile Networks and Applications , vol.10 , Issue.6 , pp. 853-864
    • Xue, Y.1    Cui, Y.2    Nahrstedt, K.3


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