The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Source-location privacy in energy-constrained sensor network routing
Abstract
As sensor-driven applications become increasingly integrated into our lives, issues related to sensor privacy will become increasingly important. Although many privacy-related issues can be addressed by security mechanisms, one sensor network privacy issue that cannot be adequately addressed by network security is confidentiality of the source sensor's location. In this paper, we focus on protecting the source's location by introducing suitable modifications to sensor routing protocols to make it difficult for an adversary to backtrack to the origin of the sensor communication. In particular, we focus on the class of flooding protocols. While developing and evaluating our privacy-aware routing protocols, we jointly consider issues of location-privacy as well as the amount of energy consumed by the sensor network. Motivated by the observations, we propose a flexible routing strategy, known as phantom routing, which protects the source's location. Phantom routing is a two-stage routing scheme that first consists of a directed walk along a random direction, followed by routing from the phantom source to the sink. Our investigations have shown that phantom routing is a powerful technique for protecting the location of the source during sensor transmissions.
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
RADAR: an in-building RF-based user location and tracking system
Bahl, P., & Padmanabhan, V. N. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832252 · Cited by 8,380
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345920 · Cited by 5,393
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Savvides, A., Han, C.-C., & Strivastava, M. B. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381693 · Cited by 2,694
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Gruteser, M., & Grunwald, D. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1189037 · Cited by 2,275
Ad hoc positioning system (APS)
Niculescu, D., & Nath, B. (2002) · GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270) · doi:10.1109/glocom.2001.965964 · Cited by 1,801
Rumor routing algorthim for sensor networks
Braginsky, D., & Estrin, D. L. (2002) · doi:10.1145/570738.570742 · Cited by 1,295
Anonymous connections and onion routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668972 · Cited by 1,063
Lightweight probabilistic broadcast
Eugster, P. T., Guerraoui, R., Handurukande, S. B., Kouznetsov, P., & Kermarrec, A.-M. (2003) · ACM Transactions on Computer Systems · doi:10.1145/945506.945507 · Cited by 394
Trajectory based forwarding and its applications
Niculescu, D., & Nath, B. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.939012 · Cited by 358
Cited by
A Comprehensive Study of Security of Internet-of-Things
Mosenia, A., & Jha, N. K. (2017) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2016.2606384 · Cited by 806
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
Self-citationWireless Sensor Network Security: A Survey
Walters, J. P., Liang, Z., Shi, W., & Chaudhary, V. (2007) · Security in Distributed, Grid, Mobile, and Pervasive Computing · doi:10.1201/9780849379253-20 · Cited by 389
A Survey on Wireless Sensor Network Security
Sen, J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.1529 · Cited by 273
Abdelzaher, T., Anokwa, Y., Boda, P., Burke, J., Estrin, D., Guibas, L., Kansal, A., Madden, S., & Reich, J. (2007) · IEEE Pervasive Computing · doi:10.1109/mprv.2007.38 · Cited by 258
Metadata
- Authors
- Ozturk, C., Zhang, Y., & Trappe, W.
- Venue
- Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
- Publisher
- ACM
- Published
- 2004-10-25
- Pages
- 88-93
- OpenAlex
- W2088069667
- Cited by
- 390
- References
- 11
- FWCI
- 5.08
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Source-location privacy in energy-constrained sensor network routing. https://app.cochat.ai/papers/10.1145/1029102.1029117
- The paper
- Ozturk, C., Zhang, Y., & Trappe, W. (2004). Source-location privacy in energy-constrained sensor network routing. Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks. https://doi.org/10.1145/1029102.1029117
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.