Identification in Z2 Z 2 using Euclidean balls ?
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These codes find their application, for example, in sensor networks. The network is modelled by a graph. In this paper, the goal is to find good identifying codes in a natural setting, that is, in a graph Er=(V,E) E r = ( V , E ) where V=Z2 V = Z 2 is the set of vertices and each vertex (sensor) can check its neighbours within Euclidean distance r r . We also consider a graph closely connected to a well-studied king grid, which provides optimal identifying codes for E 5 and E 13 .
identifying code sensor network euclidean distance optimal code fault diagnosis