Name
Abstract | ||
|---|---|---|
Abstract—In sensor networks, an intruder (i.e., compromised node) identified and isolated in one place can be relocated and/or duplicated to other places to continue attacks; hence, detection and isolation of the same intruder or its clones may have to be conducted repeatedly, wasting scarce network resources. Therefore, once an intruder is identified, it should be known to all innocent nodes such that the intruder or its clones can be recognized when appearing elsewhere. However, secure, efficient and scalable sharing of intruder information remains a challenging and unsolved problem. To address this problem, we propose a three-tier framework, consisting of a verifiable intruder reporting (VIR) scheme, a quorum based caching (QBC) scheme for efficiently propagating intruder reports to the whole network, and a collaborative Bloom Filter (CBF) scheme for handling intruder information locally. Extensive analysis and evaluations are also conducted to verify the efficiency and scalability of the proposed framework. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.adhoc.2009.10.001 | Ad Hoc Networks |
Keywords | Field | DocType |
Intruder information sharing,Bloom Filter,Quorum | Bloom filter,Computer security,Computer science,Server,Information security,Computer network,Verifiable secret sharing,Wireless sensor network,Public-key cryptography,Information sharing,Distributed computing,Scalability | Journal |
Volume | Issue | ISSN |
8 | 3 | Ad Hoc Networks |
Citations | PageRank | References |
0 | 0.34 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Tong | 1 | 129 | 8.13 |
| Santosh Panchapakesan | 2 | 0 | 0.34 |
| Wensheng Zhang | 3 | 1415 | 80.30 |