A novel traffic-analysis back tracing attack for locating source nodes in wireless sensor networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In habitat monitoring applications, when a sensor node detects an endangered animal, e.g., a panda, it reports the animal's presence and activities to the sink. However, the adversaries can eavesdrop on the network transmissions and make use of the traffic information to locate pandas to hunt them. In this paper, we first define hotspot phenomenon that causes an obvious inconsistency in the network traffic pattern due to the large volume of packets originated from a small spot. Second, we develop a realistic adversary model assuming that the adversary can monitor the network traffic in multiple areas rather than the entire network or only one area. We then introduce a novel attack called Hotspot-Locating where the adversary uses traffic analysis techniques to locate hotspots. Simulation and analytical results demonstrate that Hotspot-Locating attack is a severe threat to the source nodes' location privacy and the existing routing-based privacy preserving schemes are vulnerable to this attack because they leak traffic analysis information that can be used to locate the source nodes. For stronger privacy preservation, the traffic analysis information such as packet correlation and the nodes' packet sending rates should be concealed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it