메뉴 건너뛰기




Volumn 4239 LNCS, Issue , 2006, Pages 454-466

Minimum dominating sets for solving the coverage problem in wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL POSITIONING SYSTEM; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING; SENSORS;

EID: 33750710700     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11890348_34     Document Type: Conference Paper
Times cited : (11)

References (11)
  • 6
    • 15344346469 scopus 로고    scopus 로고
    • Low Power 0/1 Coverage and Scheduling Techniques in Sensor Networks
    • January
    • S. Meguerdichian, M. Potkonjak. Low Power 0/1 Coverage and Scheduling Techniques in Sensor Networks. UCLA Technical Report 030001, January 2003.
    • (2003) UCLA Technical Report 030001
    • Meguerdichian, S.1    Potkonjak, M.2
  • 9
    • 33746067318 scopus 로고    scopus 로고
    • Integrated coverage and connectivity configuration for energy conservation in sensor networks
    • In Press
    • G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, C. Gill. Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Trans. Sensor Networks, In Press.
    • ACM Trans. Sensor Networks
    • Xing, G.1    Wang, X.2    Zhang, Y.3    Lu, C.4    Pless, R.5    Gill, C.6
  • 11
    • 84969452462 scopus 로고    scopus 로고
    • Determining active sensor nodes for complete coverage without location information
    • T-T. Wu, K-F. Ssu. Determining active sensor nodes for complete coverage without location information. Intl. J. Ad Hoc and Ubiquitous Computing, vol. 1, no. 1/2, pp. 38-46, 2005.
    • (2005) Intl. J. Ad Hoc and Ubiquitous Computing , vol.1 , Issue.1-2 , pp. 38-46
    • Wu, T.-T.1    Ssu, K.-F.2


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