A4 Refereed article in a conference publication
Codes for Locating Objects in Sensor Networks
Authors: Junnila V, Laihonen T, Parreau A
Publication year: 2012
Journal: IEEE International Symposium on Information Theory
Journal name in source: 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)
Journal acronym: IEEE INT SYMP INFO
First page : 671
Last page: 675
Number of pages: 5
Abstract
Karpovsky, Chakrabarty and Levitin introduced identifying codes, which can be applied, for example, to locating objects in sensor networks. In this paper, the underlying structure is Z(2) where one sensor can check its neighbours within Euclidean distance r. We construct 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 such an 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.
Karpovsky, Chakrabarty and Levitin introduced identifying codes, which can be applied, for example, to locating objects in sensor networks. In this paper, the underlying structure is Z(2) where one sensor can check its neighbours within Euclidean distance r. We construct 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 such an 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.
UTU Research Portal