메뉴 건너뛰기




Volumn , Issue , 2004, Pages 373-378

Connected K-coverage problem in sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

GREEDY ALGORITHMS; NEAR-OPTIMAL SOLUTIONS; NETWORK TOPOLOGY; SENSOR NETWORKS;

EID: 17444386366     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (254)

References (12)
  • 7
    • 0033894011 scopus 로고    scopus 로고
    • On the construction of energy-efficient broadcast and multicast trees in wireless networks
    • J. E. Wieselther, G. D. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proceedings of the IEEE INFOCOM, 2000.
    • (2000) Proceedings of the IEEE INFOCOM
    • Wieselther, J.E.1    Nguyen, G.D.2    Ephremides, A.3
  • 12
    • 0042473977 scopus 로고    scopus 로고
    • Broadcasting in ad hoc networks based on self-pruning
    • J. Wu and F. Dai, "Broadcasting in ad hoc networks based on self-pruning," in Proceedings of the IEEE INFOCOM, 2003.
    • (2003) Proceedings of the IEEE INFOCOM
    • Wu, J.1    Dai, F.2


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