EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
A Probabilistic Room Location Service for Wireless Networked Environments
UbiComp '01 Proceedings of the 3rd international conference on Ubiquitous Computing
Secure verification of location claims
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Rushing attacks and defense in wireless ad hoc network routing protocols
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Defending against Sybil Attacks in Sensor Networks
ICDCSW '05 Proceedings of the Second International Workshop on Security in Distributed Computing Systems (SDCS) (ICDCSW'05) - Volume 02
SeRLoc: Robust localization for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
LITEWORP: A Lightweight Countermeasure for the Wormhole Attack in Multihop Wireless Networks
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
DICAS: Detection, Diagnosis and Isolation of Control Attacks in Sensor Networks
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
SLAM: Sleep-Wake Aware Local Monitoring in Sensor Networks
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Secure neighbor discovery in wireless networks: formal investigation of possibility
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Secure sensor network routing: a clean-slate approach
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Towards provable secure neighbor discovery in wireless networks
Proceedings of the 6th ACM workshop on Formal methods in security engineering
A practical secure neighbor verification protocol for wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
ISC '09 Proceedings of the 12th International Conference on Information Security
An asymmetric security mechanism for navigation signals
IH'04 Proceedings of the 6th international conference on Information Hiding
Secure neighborhood discovery: a fundamental element for mobile ad hoc networking
IEEE Communications Magazine
| Hi-index | 0.00 |
In a wireless network, mutual secure neighbor verification (MSN) is defined as the capability of a node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. This problem has received great attention because it has numerous practical applications. Current state-of-the-art approaches to solve this problem, such as the use of time of flight, signal strength, and angle of arrival, suffer from impracticality in terms of application and computation cost. In this work, we propose two algorithms to mitigate the MSN problem during the incremental deployment phase of static senor networks. Each node should announce its location and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. The simulation results show that we can achieve high detection (90%) of nodes that forge their location information using either high power transmission or by colluding with other malicious nodes. Copyright © 2011 John Wiley & Sons, Ltd.