Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 160

The DOI matches its Crossref record.

Wormhole-Based Antijamming Techniques in Sensor Networks

Open access
Cagalj, Mario, Capkun, Srdjan, Hubaux, Jean-pierre·2007·IEEE Transactions on Mobile Computing

Abstract

Due to their very nature, wireless sensor networks are probably the category of wireless networks most vulnerable to "radio channel jamming"-based denial-of-service (DoS) attacks. An adversary can easily mask the events that the sensor network should detect by stealthily jamming an appropriate subset of the nodes; in this way, he prevents them from reporting what they are sensing to the network operator. Therefore, even if an event is sensed by one or several nodes (and the sensor network is otherwise fully connected), the network operator cannot be informed on time. We show how the sensor nodes can exploit channel diversity in order to create wormholes that lead out of the jammed region, through which an alarm can be transmitted to the network operator. We propose three solutions. The first is based on wired pairs of sensors, the second relies on frequency hopping, and the third is based on a novel concept called uncoordinated channel hopping. We develop appropriate mathematical models to study the proposed solutions

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tmc.2007.250674

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 160

Metadata

Authors
Cagalj, M., Capkun, S., & Hubaux, J.-P.
Venue
IEEE Transactions on Mobile Computing
Published
2007-01
Volume
6
Issue
1
Pages
100-114
ISSN
  • 1536-1233 (ISSN-L)
  • 1558-0660
  • 2161-9875
OpenAlex
W2807591683
Cited by
160
References
0
FWCI
11.96
Type
journal article
Language
en
Open access
green

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: Wormhole-Based Antijamming Techniques in Sensor Networks. https://app.cochat.ai/papers/10.1109/tmc.2007.250674
The paper
Cagalj, M., Capkun, S., & Hubaux, J.-P. (2007). Wormhole-Based Antijamming Techniques in Sensor Networks. IEEE Transactions on Mobile Computing. https://doi.org/10.1109/tmc.2007.250674

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.