arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1109.1913cs.ITcs.DMmath.COmath.IT
收藏

欧氏球的容差辨识

Tolerant identification with Euclidean balls

Ville Junnila, Tero Laihonen, Aline Parreau

摘要:

识别码的概念是由Karpovsky,Chakrabarty和Levitin在1998年提出的。识别码可以应用于例如传感器网络。在本文中,我们将集合Z^2视为传感器,其中一个传感器可以在欧几里得距离r内检查其邻居。我们构建宽容的识别码在这个网络中,对每个传感器监测的邻居的一些变化是强大的。我们给出了一个宽容的识别代码的一般值的r和Delta的最小密度的界限。我们还提供了无限的家庭的价值观(r,德尔塔)与最佳的这样的代码和研究的情况下,小值的r。

英文摘要:

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 paper, we consider as sensors the set Z^2 where one sensor can check its neighbours within Euclidean distance r. We construct tolerant identifying codes in this network that are robust against some changes in the neighbourhood monitored by each sensor. We give bounds for the smallest density of a tolerant identifying code for general values of r and Delta. We also provide infinite families of values (r,Delta) with optimal such codes and study the case of small values of r.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑