메뉴 건너뛰기




Volumn 9, Issue 7, 2009, Pages 909-919

Fault-tolerant deployment with k-connectivity and partial k-connectivity in sensor networks

Author keywords

Approximation ratio; Deployment; K connectivity; Sensor networks

Indexed keywords

APPROXIMATION RATIO; APPROXIMATION RATIOS; COMPLETE GRAPHS; DEPLOYMENT; EFFICIENT STRATEGY; FAULT-TOLERANT; K-CONNECTED; K-CONNECTIVITY; NODE-DISJOINT PATHS; REDUNDANT SENSOR NODES; REPAIR ALGORITHMS; SUBGRAPH;

EID: 67749137698     PISSN: 15308669     EISSN: None     Source Type: Journal    
DOI: 10.1002/wcm.638     Document Type: Article
Times cited : (19)

References (29)
  • 8
    • 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 Journal on Computing 2003; 32(4): 1050-1055.
    • (2003) SIAM Journal on Computing , vol.32 , Issue.4 , pp. 1050-1055
    • Cheriyan, J.1    Vempala, S.2    Vetta, A.3
  • 15
    • 33645164430 scopus 로고    scopus 로고
    • Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks
    • Bahramgiri M, Hajiaghayi M, Mirrokni V. Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. Wireless Networks 2006; 12(2): 179-188.
    • (2006) Wireless Networks , vol.12 , Issue.2 , pp. 179-188
    • Bahramgiri, M.1    Hajiaghayi, M.2    Mirrokni, V.3
  • 18
    • 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. Information Processing Letters 1999; 69(2): 53-57.
    • (1999) Information Processing Letters , vol.69 , Issue.2 , pp. 53-57
    • Lin, G.1    Xue, G.2
  • 19
    • 84944073631 scopus 로고    scopus 로고
    • The euclidean bottleneck steiner tree and steiner tree with minimum number of steiner points
    • 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 2001; 2108: 509-518.
    • (2001) Lecture Notes in Computer Science , vol.2108 , pp. 509-518
    • Du, D.1    Wang, L.2    Xu, B.3
  • 21
    • 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 Journal on Computing 2003; 32(4): 1050-1055.
    • (2003) SIAM Journal on Computing , vol.32 , Issue.4 , pp. 1050-1055
    • Cheriyan, J.1    Vempala, S.2    Vetta, A.3
  • 22
    • 34247555864 scopus 로고    scopus 로고
    • A distributed and efficient flooding scheme using 1-hop information in mobile ad hoc networks
    • Liu H, Jia X, Wan P, Liu X, Yao F. A distributed and efficient flooding scheme using 1-hop information in mobile ad hoc networks. IEEE Transactions on Parallel and Distributed Systems 2007; 18(5): 658-671.
    • (2007) IEEE Transactions on Parallel and Distributed Systems , vol.18 , Issue.5 , pp. 658-671
    • Liu, H.1    Jia, X.2    Wan, P.3    Liu, X.4    Yao, F.5
  • 29
    • 33646854080 scopus 로고    scopus 로고
    • Research on the fault tolerance deployment in sensor networks
    • Proceedings of the 4th International Conference on Grid and Cooperative Computing
    • Pu J, Xiong Z. Research on the fault tolerance deployment in sensor networks. In Proceedings of the 4th International Conference on Grid and Cooperative Computing (LNCS, Vol. 3795). 2005; pp. 1179-1184.
    • (2005) LNCS , vol.3795 , pp. 1179-1184
    • Pu, J.1    Xiong, Z.2


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