메뉴 건너뛰기




Volumn , Issue , 2002, Pages 553-558

Partitioning avoidance in mobile ad hoc networks using network survivability concepts

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC WIRELESS NETWORKS; CRITICAL LINKS; MOBILITY PATTERN; NETWORK SIMULATOR NS-2; NETWORK SURVIVABILITY; TWO WAYS;

EID: 84883856631     PISSN: 15301346     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISCC.2002.1021729     Document Type: Article
Times cited : (56)

References (14)
  • 2
    • 0033892676 scopus 로고    scopus 로고
    • Performance comparison of two on-demand routing protocols for ad hoc networks
    • Tel-Aviv, Israel, March
    • S. R. Das, C. E. Perkins, and E. M. Royer. Performance comparison of two on-demand routing protocols for ad hoc networks. In Proceedings of INFOCOM 2000 Conference, Tel-Aviv, Israel, March 2000
    • (2000) Proceedings of INFOCOM 2000 Conference
    • Das, S.R.1    Perkins, C.E.2    Royer, E.M.3
  • 3
  • 4
    • 0003802960 scopus 로고
    • December
    • K. Fall and K. Varadhan. The ns Manual. http://www. isi. edu/nsnam/ns/doc/ns-documentation. html, December 1978
    • (1978) The Ns Manual
    • Fall, K.1    Varadhan, K.2
  • 11
    • 0004260999 scopus 로고
    • Design of survivable networks
    • Springer Verlag
    • M. Stoer. Design of Survivable Networks. Lecture Notes in Mathematics, 1531, Springer Verlag, 1991
    • (1991) Lecture Notes in Mathematics , vol.1531
    • Stoer, M.1
  • 13
    • 0001790593 scopus 로고
    • Depth first search and linear graph algorithms
    • R. Tarjan. Depth first search and linear graph algorithms. SIAM J. Comput., 1(2):146-160, 1972
    • (1972) SIAM J. Comput , vol.1 , Issue.2 , pp. 146-160
    • Tarjan, R.1


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