A1 Refereed original research article in a scientific journal

Identification in Z(2) using Euclidean balls




AuthorsJunnila V, Laihonen T

PublisherELSEVIER SCIENCE BV

Publication year2011

JournalDiscrete Applied Mathematics

Journal name in sourceDISCRETE APPLIED MATHEMATICS

Journal acronymDISCRETE APPL MATH

Number in series5

Volume159

Issue5

First page 335

Last page343

Number of pages9

ISSN0166-218X

DOIhttps://doi.org/10.1016/j.dam.2010.12.008

Self-archived copy’s web addresshttps://research.utu.fi/converis/portal/Publication/2324036


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.

Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.





Last updated on 2024-26-11 at 23:12