Argus: A Light-Weighted Secure Localization Scheme for Sensor Networks

Authors:
Wen Tao Zhu;Yang Xiang
Affiliations:
State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, China 100049;School of Management and Information Systems, Central Queensland University, Queensland, Australia 4702
Venue:
ATC '09 Proceedings of the 6th International Conference on Autonomic and Trusted Computing
Year:
2009

Citing 10
Cited 0

SPINS: security protocols for sensor networks

Wireless Networks
Location-based pairwise key establishments for static sensor networks

Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
iTPS: an improved location discovery scheme for sensor networks with long-range beacons

Journal of Parallel and Distributed Computing
Improving key predistribution with deployment knowledge in static sensor networks

ACM Transactions on Sensor Networks (TOSN)
Range-free localization and its impact on large scale sensor networks

ACM Transactions on Embedded Computing Systems (TECS)
Attack-resistant location estimation in sensor networks

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Organizing a global coordinate system from local information on an ad hoc sensor network

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Localization systems for wireless sensor networks

IEEE Wireless Communications
A survey on sensor networks

IEEE Communications Magazine
Secure localization algorithms for wireless sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rapid technological advances have enabled the development of wireless sensor networks for various monitoring tasks. Usually the involved applications are dependant on the location knowledge of the low-cost sensor nodes, the majority of which are non-beacon nodes whose positions are yet to be discovered. We present Argus, a light-weighted position estimation scheme for sensor networks, to address the problem of localizing non-beacon nodes, with the location references obtained from a few beacon nodes whose positions are known apriori. We first determine certain geometric reference points and evaluate them with a voting procedure. Then the position of a non-beacon node of concern is estimated with the geometric centroid of the identified most valuable reference points. Simulation results show that even when a few of the available beacon nodes are malfunctioning, our scheme can tolerate those misleading location references, and still provide a dependable localization service.