Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
Location verification based defense against sybil attack in sensor networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
| Hi-index | 0.00 |
A new functional for planar triangulation called Inner Core has been proposed in [4] for a location verification based defense against Sybil attack for sensor network, and also has been shown that the legitimacy of a new node inside the Inner Core of a triangle obtained by the triangulation of the set of sensor nodes can be established. In [4] it has been conjectured that Inner Core of a triangulation of a set of planar points achieves its maximum for Delaunay triangulation. In this paper, we present a formal proof of the conjecture. In order for the protocol proposed in [4] to work, what is required is an empty triangle formed out of three existing sensor nodes in whose Inner Core new node claims its presence. We present here an algorithm to find out such an empty triangle, so that it can be used for checking the legitimacy of the new node.