메뉴 건너뛰기




Volumn 3795 LNCS, Issue , 2005, Pages 1179-1184

Research on the fault tolerance deployment in sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; SENSORS;

EID: 33646854080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590354_141     Document Type: Conference Paper
Times cited : (3)

References (10)
  • 4
    • 0141534108 scopus 로고    scopus 로고
    • An approximation algorithm for the minimum-cost k-vertex connected subgraph
    • Cheriyan J., Vempala S., Vetta A.: An Approximation Algorithm for the Minimum-cost k-vertex Connected Subgraph. SIAM J. Comput. (2003) 1050-1055.
    • (2003) SIAM J. Comput. , pp. 1050-1055
    • Cheriyan, J.1    Vempala, S.2    Vetta, A.3
  • 7
    • 0035009294 scopus 로고    scopus 로고
    • Distributed topology control for power efficientoperation in multihop wireless ad hoc networks
    • Computer and Communications Societies
    • Wattenhofer R., Li L., Bahl V., Wang Y.: Distributed topology control for power efficientoperation in multihop wireless ad hoc networks. Proceedings of twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (2001) 1388-1397.
    • (2001) Proceedings of Twentieth Annual Joint Conference of the IEEE , pp. 1388-1397
    • Wattenhofer, R.1    Li, L.2    Bahl, V.3    Wang, Y.4
  • 9
    • 0032755118 scopus 로고    scopus 로고
    • Steiner tree problem with minimum number of Steiner points and bounded edge-length
    • Lin G., Xue G.: Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inform. Process. Lett. (1999) 53-57.
    • (1999) Inform. Process. Lett. , pp. 53-57
    • Lin, G.1    Xue, G.2
  • 10
    • 84944073631 scopus 로고    scopus 로고
    • The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points
    • Springer-Verlag, Berlin Heidelberg New York
    • Du D., Wang L., Xu B.: The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points. Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg New York (2001) 509-518.
    • (2001) Lecture Notes in Computer Science , pp. 509-518
    • Du, D.1    Wang, L.2    Xu, B.3


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