Secure Localization of Nodes in Wireless Sensor Networks with Limited Number of Truth Tellers

Authors:
J. G. Alfaro;M. Barbeau;E. Kranakis
Affiliations:
-;-;-
Venue:
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Year:
2009

Citing 8
Cited 1

Dynamic fine-grained localization in Ad-Hoc networks of sensors

Proceedings of the 7th annual international conference on Mobile computing and networking
The Sybil Attack

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Range-free localization schemes for large scale sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
The sybil attack in sensor networks: analysis & defenses

Proceedings of the 3rd international symposium on Information processing in sensor networks
SeRLoc: Robust localization for wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
ROPE: robust position estimation in wireless sensor networks

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Secure localization with phantom node detection

Ad Hoc Networks
Routing techniques in wireless sensor networks: a survey

IEEE Wireless Communications

Multi-sector multi-range control for self-organizing wireless networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide in this paper three algorithms that enable the sensor nodes of a Wireless Sensor Network (WSN) to determine their location in presence of neighbor sensors that may lie about their position. Our algorithms minimize the number of trusted nodes required by regular nodes to complete their process of localization. The algorithms always work for a given number of neighbors provided that the number of liars is below a certain threshold value, which is also determined.