메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1566-1574

Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

DATA AGGREGATION TREE; DENSE NETWORK; DISTRIBUTED SOLUTIONS; ENERGY-CONSTRAINED; GENERAL VERSION; GET DATA; IN-NETWORK AGGREGATION; INITIAL ENERGY; LONG LIFETIME; MULTI-HOP PATH; NP COMPLETE; POLYNOMIAL-TIME; ROUTING STRUCTURES; SHORTEST PATH; SHORTEST PATH TREE; SIMULATION RESULT; SINGLE HOP; SPANNING TREE; TIME-CRITICAL APPLICATIONS;

EID: 79960856149     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934947     Document Type: Conference Paper
Times cited : (115)

References (17)
  • 6
    • 51349108846 scopus 로고    scopus 로고
    • On the construction of a maximumlifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm
    • Y. Wu, S. Fahmy, and N. B. Shroff, "On the construction of a maximumlifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm,"in INFOCOM, 2008.
    • (2008) INFOCOM
    • Wu, Y.1    Fahmy, S.2    Shroff, N.B.3
  • 8
    • 23944500468 scopus 로고    scopus 로고
    • Semi-matchings for bipartite graphs and load balancing
    • N. J. Harvey, R. E. Ladner, L. Lovasz and T. Tamir, "Semi-matchings for bipartite graphs and load balancing,"in WADS, 2003.
    • (2003) WADS
    • Harvey, N.J.1    Ladner, R.E.2    Lovasz, L.3    Tamir, T.4
  • 9
    • 1642576463 scopus 로고    scopus 로고
    • Maximum lifetime data gathering and aggregation in wireless sensor networks
    • K. Kalpakis, K. Dasgupta, and P. Namjoshi, "Maximum lifetime data gathering and aggregation in wireless sensor networks,"in ICN, 2002.
    • (2002) ICN
    • Kalpakis, K.1    Dasgupta, K.2    Namjoshi, P.3
  • 10
    • 33746924369 scopus 로고    scopus 로고
    • Maximum lifetime routing in wireless sensor networks
    • J. Park and S. Sahni, "Maximum lifetime routing in wireless sensor networks,"IEEE Transactions on Computers, 55: 1048-1056, 2006.
    • (2006) IEEE Transactions on Computers , vol.55 , pp. 1048-1056
    • Park, J.1    Sahni, S.2
  • 11
    • 51349146647 scopus 로고    scopus 로고
    • Theoretical results on base station movement problem for sensor network
    • Y. Shi and Y. T. Hou, "Theoretical results on base station movement problem for sensor network,"in INFOCOM, 2008.
    • (2008) INFOCOM
    • Shi, Y.1    Hou, Y.T.2
  • 12
    • 35348866748 scopus 로고    scopus 로고
    • A control theory approach to throughput optimization in multi-channel collection sensor networks
    • H. K. Le, D. Henriksson, and T. Abdelzaher, "A control theory approach to throughput optimization in multi-channel collection sensor networks,"in IPSN, 2007.
    • (2007) IPSN
    • Le, H.K.1    Henriksson, D.2    Abdelzaher, T.3
  • 14
    • 51349140933 scopus 로고    scopus 로고
    • Realistic and efficient multichannel communications in wireless sensor networks
    • Y. Wu, J. A. Stankovic, T. He, and S. Lin, "Realistic and efficient multichannel communications in wireless sensor networks,"in INFOCOM, 2008.
    • (2008) INFOCOM
    • Wu, Y.1    Stankovic, J.A.2    He, T.3    Lin, S.4
  • 15
    • 0000891810 scopus 로고
    • Algorithm for solution of a problem of maximum flow in networks with power estimation
    • E. A. Dinic, "Algorithm for solution of a problem of maximum flow in networks with power estimation,"Soviet Mathematics Doklady, 11: 1277-1280, 1970.
    • (1970) Soviet Mathematics Doklady , vol.11 , pp. 1277-1280
    • Dinic, E.A.1
  • 17
    • 0034539015 scopus 로고    scopus 로고
    • Directed diffusion: A scalable and robust communication paradigm for sensor networks
    • C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks,"in MOBICOM, 2000.
    • (2000) MOBICOM
    • Intanagonwiwat, C.1    Govindan, R.2    Estrin, D.3


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