A1 Refereed original research article in a scientific journal
Identification in Z(2) using Euclidean balls
Authors: Junnila V, Laihonen T
Publisher: ELSEVIER SCIENCE BV
Publication year: 2011
Journal: Discrete Applied Mathematics
Journal name in source: DISCRETE APPLIED MATHEMATICS
Journal acronym: DISCRETE APPL MATH
Number in series: 5
Volume: 159
Issue: 5
First page : 335
Last page: 343
Number of pages: 9
ISSN: 0166-218X
DOI: https://doi.org/10.1016/j.dam.2010.12.008(external)
Self-archived copy’s web address: https://research.utu.fi/converis/portal/Publication/2324036(external)
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 epsilon(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 epsilon(root 5) and epsilon(root 13). (C) 2010 Elsevier B.V. All rights reserved.
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 epsilon(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 epsilon(root 5) and epsilon(root 13). (C) 2010 Elsevier B.V. All rights reserved.
Downloadable publication This is an electronic reprint of the original article. |  |
UTU Research Portal