Location-Based Pairwise Key Establishment and Data Authentication for Wireless Sensor Networks
Bibliographic record
Abstract
Sensor networks are often deployed in unattended environment, thus leaving those networks vulnerable to false data injection attacks. Attackers often inject false data into the network in order to deceive the base station or deplete the resource and the energy of the relaying nodes. The existing authentication mechanisms cannot prevent this kind of attack after an amount of sensor nodes have been compromised. Pairwise key establishment is a fundamental security in wireless sensor networks, which makes it possible that sensor nodes can communicate securely one another using cryptographic techniques. However, the limited resource and energy of sensor nodes are not feasible to use such traditional key management techniques as public/private cryptography and key distribution center (KDC). In this paper, we present a novel key management and data authentication technique that pass sensing data securely and filter false data out on its way to base station. The framework of our design is to divide sensing area into a number of location cells and a group of local cells consist of a logical cell, where, pairwise key between two sensor nodes is established according to the grid-based bivariate polynomials. The established pairwise key is included in the message authentication code (MAC) and is forwarded several hops down to the base station for data authentication. Our result shows that this location scheme and data authentication method decreases communication overhead, avoids t-tolerance, and filters bogus report in wireless sensor networks
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".