메뉴 건너뛰기




Volumn , Issue , 2004, Pages 1-7

Quantile models for the threshold range for k-connectivity

Author keywords

Ad hoc networks; Boolean model; Connectivity; Empirical models; Geometric random graphs; Sensor networks

Indexed keywords

BOOLEAN ALGEBRA; REGRESSION ANALYSIS; SENSORS;

EID: 27644537257     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1023663.1023666     Document Type: Conference Paper
Times cited : (3)

References (9)
  • 3
    • 3543145986 scopus 로고    scopus 로고
    • A simulation-based method for predicting connectivity in wireless multihop networks
    • June
    • H. Koskinen. A simulation-based method for predicting connectivity in wireless multihop networks. Telecommunication Systems, 26(2-4):321-338, June 2004.
    • (2004) Telecommunication Systems , vol.26 , Issue.2-4 , pp. 321-338
    • Koskinen, H.1
  • 4
    • 0031287494 scopus 로고    scopus 로고
    • The longest edge of the random minimal spanning tree
    • M. D. Penrose. The longest edge of the random minimal spanning tree. Annals of Applied Probability, 7(2):340-361, 1997.
    • (1997) Annals of Applied Probability , vol.7 , Issue.2 , pp. 340-361
    • Penrose, M.D.1
  • 5
    • 0000033024 scopus 로고    scopus 로고
    • Extremes for the minimal spanning tree on normally distributed points
    • M. D. Penrose. Extremes for the minimal spanning tree on normally distributed points. Advances in Applied Probability, 30(3):628-639, 1998.
    • (1998) Advances in Applied Probability , vol.30 , Issue.3 , pp. 628-639
    • Penrose, M.D.1
  • 6
    • 0033471867 scopus 로고    scopus 로고
    • On k-connectivity for a geometric random graph
    • M. D. Penrose. On k-connectivity for a geometric random graph. Random Structures and Algorithms, 15(2):145-164, 1999.
    • (1999) Random Structures and Algorithms , vol.15 , Issue.2 , pp. 145-164
    • Penrose, M.D.1


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