메뉴 건너뛰기




Volumn , Issue , 2009, Pages 284-293

Memory efficient protocols for detecting node replication attacks in wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

BALANCED ENERGY CONSUMPTION; BLOOM FILTERS; CROSS FORWARDING; DETECTION PROBABILITIES; DETECTION PROTOCOLS; DISTRIBUTED SOLUTIONS; HIGH DETECTION PROBABILITY; INSIDER ATTACK; LOW MEMORY; MEMORY CONSUMPTION; MEMORY EFFICIENT; MEMORY OVERHEADS; MEMORY REDUCTION; NEW PROTOCOL; PSEUDO-RANDOM NUMBERS; SECURITY KEY;

EID: 71949128840     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2009.5339674     Document Type: Conference Paper
Times cited : (50)

References (22)
  • 2
    • 84872155956 scopus 로고    scopus 로고
    • "Sensor Node," http://en.wikipedia.org/wiki/Sensor-node.
    • Sensor Node
  • 3
    • 37849004592 scopus 로고    scopus 로고
    • A Randomized, Efficient, and Distributed Protocol for the Detection of Node Replication Attacks in Wireless Sensor Networks
    • September
    • M. Conti, R. D. Pietro, and L. V. Mancini, "A Randomized, Efficient, and Distributed Protocol for the Detection of Node Replication Attacks in Wireless Sensor Networks," In Proc. of ACM MobiHoc, September 2007.
    • (2007) Proc. of ACM MobiHoc
    • Conti, M.1    Pietro, R.D.2    Mancini, L.V.3
  • 7
    • 0034547115 scopus 로고    scopus 로고
    • GPSR: Greedy Perimeter Stateless Routing for Wireless Networks
    • August
    • B. Karp and H. T. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks," In Proc. of ACM MobiCom, August 2000.
    • (2000) Proc. of ACM MobiCom
    • Karp, B.1    Kung, H.T.2
  • 8
    • 0012970453 scopus 로고    scopus 로고
    • Identity-Based Encryption from the Weil Pairing
    • August
    • D. Boneh and M. Franklin, "Identity-Based Encryption from the Weil Pairing," In Proc. of CRYPTO, August 2001.
    • (2001) Proc. of CRYPTO
    • Boneh, D.1    Franklin, M.2
  • 9
    • 0842304788 scopus 로고    scopus 로고
    • Efficient Algorithms for Pairing-Based Cryptosystems
    • August
    • P. Barreto, H. Kim, B. Bynn, and M. Scott, "Efficient Algorithms for Pairing-Based Cryptosystems," In Proc. of CRYPTO, August 2002.
    • (2002) Proc. of CRYPTO
    • Barreto, P.1    Kim, H.2    Bynn, B.3    Scott, M.4
  • 11
    • 0001827537 scopus 로고
    • Identity-Based Cryptosystems and Signature Schemes
    • A. Shamir, "Identity-Based Cryptosystems and Signature Schemes," In Proc. of CRYPTO, 1985.
    • (1985) Proc. of CRYPTO
    • Shamir, A.1
  • 14
    • 0003508562 scopus 로고    scopus 로고
    • Digital Signature Standard
    • March
    • "Digital Signature Standard," FIPS PUB 186-3, March 2006.
    • (2006) FIPS PUB 186-3
  • 21
    • 0014814325 scopus 로고
    • Space/Time Trade-Offs in Hash Coding with Allowable Errors
    • July
    • B. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Communications of the ACM, vol. 13, no. 7, pp. 422-426, July 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1
  • 22
    • 33644905483 scopus 로고    scopus 로고
    • Network Applications of Bloom Filters: A Survey
    • June
    • A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: a Survey," Internet Mathematics, vol. 1, no. 4, pp. 636-646, June 2002.
    • (2002) Internet Mathematics , vol.1 , Issue.4 , pp. 636-646
    • Broder, A.1    Mitzenmacher, M.2


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