The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Secure Link State Routing for Mobile Ad Hoc Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Group management for mobile Ad Hoc networks: design, implementation and experiment
Proceedings of the 6th international conference on Mobile data management
A practical evaluation of radio signal strength for ranging-based localization
ACM SIGMOBILE Mobile Computing and Communications Review
Non-interactive key establishment in mobile ad hoc networks
Ad Hoc Networks
Analysis of range-free anchor-free localization in a wsn under wormhole attack
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Secure neighbor discovery in wireless networks: formal investigation of possibility
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Combinatorial genericity and minimal rigidity
Proceedings of the twenty-fourth annual symposium on Computational geometry
Secure localization with phantom node detection
Ad Hoc Networks
Towards provable secure neighbor discovery in wireless networks
Proceedings of the 6th ACM workshop on Formal methods in security engineering
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
A practical secure neighbor verification protocol for wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
A Consistency-Based Secure Localization Scheme against Wormhole Attacks in WSNs
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Eigensolver methods for progressive multidimensional scaling of large data
GD'06 Proceedings of the 14th international conference on Graph drawing
Secure Neighbor Discovery in Mobile Ad Hoc Networks
MASS '11 Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
Statistical wormhole detection in sensor networks
ESAS'05 Proceedings of the Second European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Secure neighborhood discovery: a fundamental element for mobile ad hoc networking
IEEE Communications Magazine
IEEE Communications Magazine
Applied Multidimensional Scaling
Applied Multidimensional Scaling
| Hi-index | 0.00 |
Neighbor discovery is an important part of many protocols for wireless adhoc networks, including localization and routing. When neighbor discovery fails, communications and protocols performance deteriorate. In networks affected by relay attacks, also known as wormholes, the failure may be more subtle. The wormhole may selectively deny or degrade communications. In this article we present Mobile Secure Neighbor Discovery (MSND), which offers a measure of protection against wormholes by allowing participating mobile nodes to securely determine if they are neighbors, and a wormhole localization protocol, which allows nodes that detected the presence of a wormhole to determine wormhole's location. To the best of our knowledge, this work is the first to secure neighbor discovery in mobile adhoc networks and to localize a wormhole. MSND leverages concepts of graph rigidity for wormhole detection. We prove security properties of our protocols, and demonstrate their effectiveness through extensive simulations and a real system evaluation employing Epic motes and iRobot robots.