The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Countermeasures Against Traffic Analysis Attacks in Wireless Sensor Networks
Abstract
Wireless sensor networks are highly vulnerable to the failure of base stations. An adversary can render a wireless sensor network useless by launching remote, softwarebased attacks or physical attacks on the base stations. This paper addresses the problem of defending a base station against physical attacks by concealing the geographic location of a base station. Typical packet traffic in a sensor network reveals pronounced patterns that allow an adversary analyzing packet traffic to deduce the location of a base station. The paper investigates several countermeasures against traffic analysis techniques aimed at disguising the location of a base station. First, a degree of randomness is introduced in the multi-hop path a packet takes from a sensor node to a base station. Second, random fake paths are introduced to confuse an adversary from tracking a packet as it moves towards a base station. Finally, multiple, random areas of high communication activity are created to deceive an adversary as to the true location of the base station. The paper evaluates these techniques analytically and via simulation using three evaluation criteria: total entropy of the network, total energy consumed, and the ability to guard against heuristic-based techniques to locate a base station.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586117 · Cited by 3,541
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00008-8 · Cited by 2,937
Random key predistribution schemes for sensor networks
Chan, H., Perrig, A., & Song, D. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199337 · Cited by 2,826
SPINS: security protocols for sensor networks
Perrig, A., Szewczyk, R., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
SPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
System architecture directions for networked sensors
Hill, J. L., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. S. J. (2000) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/378993.379006 · Cited by 1,756
Taming the underlying challenges of reliable multihop routing in sensor networks
Woo, A., Tong, T., & Culler, D. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958494 · Cited by 1,512
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security - CCS '02 · doi:10.1145/586115.586117 · Cited by 1,442
Establishing pairwise keys in distributed sensor networks
Liu, D., & Ning, P. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948119 · Cited by 1,354
A new method for solving hard satisfiability problems
Selman, B., Levesque, H. J., & Mitchell, D. G. M. (1992) · Cited by 1,156
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Zhu, S., Setia, S., & Jajodia, S. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948120 · Cited by 1,117
A pairwise key pre-distribution scheme for wireless sensor networks
Du, W., Deng, J., Han, Y. S., & Varshney, P. K. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948118 · Cited by 1,107
Self-citationSIA: secure information aggregation in sensor networks
Przydatek, B., Song, D., & Perrig, A. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958521 · Cited by 789
Lottery scheduling: flexible proportional-share resource management
Waldspurger, C. A., & Weihl, W. E. (1994) · doi:10.5555/1267638.1267639 · Cited by 637
Taming the underlying challenges of reliable multihop routing in sensor networks
Woo, A., Tong, T., & Culler, D. (2003) · doi:10.1145/958492.958494 · Cited by 636
Zhu, S., Setia, S., Jajodia, S., & Ning, P. (2004) · IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004 · doi:10.1109/secpri.2004.1301328 · Cited by 556
Using Directional Antennas to Prevent Wormhole Attacks.
Hu, L., & Evans, D. (2004) · Cited by 532
Zhu, S., Setia, S. K., & Jajodia, S. (2003) · doi:10.1145/948117.948120 · Cited by 480
Onion Routing for Anonymous and Private Internet Connections
Goldschlag, D. M., Reed, M., & Syverson, P. F. (1999) · Cited by 413
Source-location privacy in energy-constrained sensor network routing
Ozturk, C., Zhang, Y., & Trappe, W. (2004) · Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/1029102.1029117 · Cited by 390
A protocol for anonymous communication over the Internet
Shields, C., & Levine, B. N. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352607 · Cited by 218
Intrusion tolerance and anti-traffic analysis strategies for wireless sensor networks
Deng, J., Han, R., & Mishra, S. (2004) · International Conference on Dependable Systems and Networks, 2004 · doi:10.1109/dsn.2004.1311934 · Cited by 199
Self-citationNetworks Without User Observability — Design Options
Pfitzmann, A., & Waidner, M. (2007) · Springer eBooks · doi:10.1007/3-540-39805-8_29 · Cited by 126
k-anonymous message transmission
von Ahn, L., Bortz, A., & Hopper, N. (2003) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/948109.948128 · Cited by 125
Cited by
Securing wireless sensor networks: a survey
Zhou, Y., Fang, Y., & Zhang, Y. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2008.4625802 · Cited by 424
Preserving privacy in gps traces via uncertainty-aware path cloaking
Hoh, B., Gruteser, M., Xiong, H., & Alrabady, A. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315266 · Cited by 345
Privacy preservation in wireless sensor networks: A state-of-the-art survey
Li, N., Zhang, N., Das, S. K., & Thuraisingham, B. (2009) · Ad Hoc Networks · doi:10.1016/j.adhoc.2009.04.009 · Cited by 308
A Survey on Intelligent Internet of Things: Applications, Security, Privacy, and Future Directions
Aouedi, O., Vu, T.-H., Sacco, A., Nguyen, D. C., Piamrat, K., Marchetto, G., & Pham, Q.-V. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3430368 · Cited by 277
Wireless Communication and Security Issues for Cyber–Physical Systems and the Internet-of-Things
Burg, A., Chattopadhyay, A., & Lam, K.-Y. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2780172 · Cited by 257
Metadata
- Authors
- Deng, J., Han, R., & Mishra, S.
- Venue
- First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05)
- Publisher
- IEEE
- Published
- 2006-03-22
- Pages
- 113-126
- OpenAlex
- W2125428225
- Cited by
- 252
- References
- 26
- FWCI
- 12.36
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.