Name
Abstract | ||
|---|---|---|
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 E"r=(V,E) where V=Z^2 is the set of vertices and each vertex (sensor) can check its neighbours within Euclidean distance r. We also consider a graph closely connected to a well-studied king grid, which provides optimal identifying codes for E"5 and E"1"3. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.dam.2010.12.008 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
Fault diagnosis,Euclidean distance,Euclidean ball,well-studied king grid,Identifying code,Sensor network,natural setting,sensor network,Optimal code,graph E | Journal | 159 |
Issue | ISSN | Citations |
5 | Discrete Applied Mathematics | 4 |
PageRank | References | Authors |
0.55 | 17 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ville Junnila | 1 | 43 | 10.51 |
| Tero Laihonen | 2 | 363 | 39.39 |