Name
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 Z2 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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISIT.2012.6284295 | Information Theory Proceedings |
Keywords | Field | DocType |
codes,wireless sensor networks,Euclidean distance,code identification,neighbourhood monitoring,object locating,sensor network | Computer science,Euclidean distance,Theoretical computer science,Neighbourhood (mathematics),Wireless sensor network | Conference |
ISSN | ISBN | Citations |
2157-8095 E-ISBN : 978-1-4673-2578-3 | 978-1-4673-2578-3 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ville Junnila | 1 | 0 | 0.68 |
| Tero Laihonen | 2 | 0 | 0.68 |
| Aline Parreau | 3 | 123 | 16.89 |