Secure Position Verification for Wireless Sensor Networks in Noisy Channels

Position verification in wireless sensor networks (WSNs) is quite tricky in presence of attackers (malicious sensor nodes), who try to break the verification protocol by reporting their incorrect positions (locations) during the verification stage. In the literature of WSNs, most of the existing methods of position verification have used trusted verifiers, which are in fact vulnerable to attacks by malicious nodes. They also depend on some distance estimation techniques, which are not accurate in noisy channels (mediums). In this article, we propose a secure position verification scheme for WSNs in noisy channels without relying on any trusted entities. Our verification scheme detects and filters out all malicious nodes from the network with very high probability.

💡 Research Summary

The paper addresses the problem of position verification in wireless sensor networks (WSNs) when malicious nodes attempt to deceive the network by reporting false locations. Existing approaches largely rely on trusted verifiers (the TS model) or on distance‑estimation techniques such as RSS, ToF, or TDoA that assume ideal channel conditions and often require specialized hardware. Both assumptions are problematic: trusted verifiers may be compromised, and noisy wireless channels cause significant errors in distance estimates.

To overcome these limitations, the authors adopt a No‑Trusted‑Sensor (NTS) model and propose a fully distributed, probabilistic verification protocol called SecureNeighborDiscovery that works in noisy environments without any trusted entities. The core idea is to use the received signal strength (RSS) as a distance estimator while explicitly modeling channel noise. Starting from the Friis transmission equation, they augment it with an additive Gaussian noise term ε ∼ N(0,σ²):

 S_r = S_s·α/d² + ε,

where S_s is the common transmission power, α = λ⁴π, d is the true Euclidean distance, and S_r is the measured RSS. Because ε is unobservable, each receiver computes an estimated distance

 \hat d = α·√(S_s / S_r).

Simultaneously, the sender includes its claimed coordinates; the receiver computes the geometric distance

 \tilde d = ‖x_sender – x_receiver‖.

A node is considered genuine if \hat d falls within a statistically derived acceptance interval