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.
[1]
A. Perrig,et al.
The Sybil attack in sensor networks: analysis & defenses
,
2004,
Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.
[2]
Mark de Berg,et al.
Computational geometry: algorithms and applications
,
1997
.
[3]
John R. Douceur,et al.
The Sybil Attack
,
2002,
IPTPS.
[4]
Marcos K. Aguilera,et al.
Distributed Computing and Networking
,
2011,
Lecture Notes in Computer Science.
[5]
Indranil Saha,et al.
Location Verification Based Defense Against Sybil Attack in Sensor Networks
,
2006,
ICDCN.
[6]
Peter Druschel,et al.
Peer-to-peer systems
,
2010,
Commun. ACM.