A1 Refereed original research article in a scientific journal
Tolerant identification with Euclidean balls
Authors: Junnila V, Laihonen T, Parreau A
Publisher: WILEY-BLACKWELL
Publication year: 2013
Journal: Networks
Journal name in source: NETWORKS
Journal acronym: NETWORKS
Number in series: 3
Volume: 61
Issue: 3
First page : 212
Last page: 225
Number of pages: 14
ISSN: 0028-3045
DOI: https://doi.org/10.1002/net.21472
Abstract
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. The identifying codes can be applied, for example, to sensor networks. In this article, we consider as sensors the set Z(2) where one sensor can check its neighbors within Euclidean distance r. We construct tolerant identifying codes in this network that are robust against some changes in the neighborhood monitored by each sensor. We give bounds for the smallest density of a tolerant identifying code for general values of r. We also provide infinite families of values r with optimal such codes and study the case of small values of r. (C) 2012 Wiley Periodicals, Inc. NETWORKS, Vol. 61(3), 212-225 2013
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. The identifying codes can be applied, for example, to sensor networks. In this article, we consider as sensors the set Z(2) where one sensor can check its neighbors within Euclidean distance r. We construct tolerant identifying codes in this network that are robust against some changes in the neighborhood monitored by each sensor. We give bounds for the smallest density of a tolerant identifying code for general values of r. We also provide infinite families of values r with optimal such codes and study the case of small values of r. (C) 2012 Wiley Periodicals, Inc. NETWORKS, Vol. 61(3), 212-225 2013
UTU Research Portal