메뉴 건너뛰기




Volumn 8, Issue 2, 2009, Pages 736-745

Severity analysis and countermeasure for the wormhole attack in wireless ad hoc networks

Author keywords

Attack analysis; Countermeasures; Shortest path routing; Wireless ad hoc networks; Wormhole attack

Indexed keywords

AD HOC NETWORKS; ELECTRIC NETWORK TOPOLOGY; ROUTING PROTOCOLS; TELECOMMUNICATION NETWORKS; TIME MEASUREMENT; WIRELESS AD HOC NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 61349151189     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2009.070536     Document Type: Article
Times cited : (81)

References (14)
  • 1
    • 0041973497 scopus 로고    scopus 로고
    • Packet leashes: A defense against wormhole attacks in wireless ad hoc networks
    • Y. C. Hu, A. Penig, and D. B. Johnson, "Packet leashes: a defense against wormhole attacks in wireless ad hoc networks," in Proc. INFOCOM 2003.
    • Proc. INFOCOM 2003
    • Hu, Y.C.1    Penig, A.2    Johnson, D.B.3
  • 6
    • 24944466187 scopus 로고    scopus 로고
    • Preventing wormhole attacks on wireless ad hoc networks: A graph theoretic approach
    • L. Lazos, R. Poovendran, C. Meadows, P. Syverson, and L. W. Chang, "Preventing wormhole attacks on wireless ad hoc networks: a graph theoretic approach," in Proc. WCNC, 2005.
    • (2005) Proc. WCNC
    • Lazos, L.1    Poovendran, R.2    Meadows, C.3    Syverson, P.4    Chang, L.W.5
  • 7
    • 51349157157 scopus 로고    scopus 로고
    • Implications of radio fingerprinting on the security of sensor networks
    • K. Rasmussen and S. Capkun, "Implications of radio fingerprinting on the security of sensor networks," in Proc. IEEE Secure Comm, 2007.
    • (2007) Proc. IEEE Secure Comm
    • Rasmussen, K.1    Capkun, S.2
  • 8
    • 34548321774 scopus 로고    scopus 로고
    • Detecting wormhole attacks in wireless networks using connectivity information
    • R. Maheshwari, J. Gao, and S. R. Das, "Detecting wormhole attacks in wireless networks using connectivity information," in Proc. INFOCOM, 2007.
    • (2007) Proc. INFOCOM
    • Maheshwari, R.1    Gao, J.2    Das, S.R.3
  • 14
    • 0013173620 scopus 로고    scopus 로고
    • Unit disk graph recognition is NP-hard
    • H. Breu and D. Kirkpatrick, "Unit disk graph recognition is NP-hard," Computational Geometry, vol. 9, no. 1-2, pp. 3-24, 1998.
    • (1998) Computational Geometry , vol.9 , Issue.1-2 , pp. 3-24
    • Breu, H.1    Kirkpatrick, D.2


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