A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Identification in Z(2) using Euclidean balls
Tekijät: Junnila V, Laihonen T
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2011
Journal: Discrete Applied Mathematics
Tietokannassa oleva lehden nimi: DISCRETE APPLIED MATHEMATICS
Lehden akronyymi: DISCRETE APPL MATH
Numero sarjassa: 5
Vuosikerta: 159
Numero: 5
Aloitussivu: 335
Lopetussivu: 343
Sivujen määrä: 9
ISSN: 0166-218X
DOI: https://doi.org/10.1016/j.dam.2010.12.008
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/Publication/2324036
Tiivistelmä
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.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
Turun yliopiston Tutkimustietojärjestelmän portaali