A1 Refereed original research article in a scientific journal
Tolerant location detection in sensor networks
Authors: Junnila Ville, Laihonen Tero
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Publication year: 2020
Journal: Advances in Applied Mathematics
Journal name in source: ADVANCES IN APPLIED MATHEMATICS
Journal acronym: ADV APPL MATH
Article number: UNSP 101938
Volume: 112
Number of pages: 19
ISSN: 0196-8858
eISSN: 1090-2074
DOI: https://doi.org/10.1016/j.aam.2019.101938
Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/43788085
Abstract
Location detection in sensor networks can be handled with so called identifying codes. For an identifying code to work properly, it is required that no sensors are malfunctioning. Previously, malfunctioning sensors have been typically coped with robust identifying codes. However, they are rather large and, hence, imply high signal interference and energy consumption. To overcome these issues, collections of disjoint identifying codes have been proposed for coping with malfunctioning sensors. However, these collections have some problems regarding detection of malfunctioning sensors and, moreover, it seems unnecessary to restrict oneself to disjoint codes. In this paper, we discuss a certain type of identifying codes, for which the detection of malfunctioning sensors is easy, and based on these codes we design a collection of codes tolerant against malfunctions. We present some results on general graphs as well as optimal constructions in rook's graphs and binary Hamming spaces. (C) 2019 Elsevier Inc. All rights reserved.
Location detection in sensor networks can be handled with so called identifying codes. For an identifying code to work properly, it is required that no sensors are malfunctioning. Previously, malfunctioning sensors have been typically coped with robust identifying codes. However, they are rather large and, hence, imply high signal interference and energy consumption. To overcome these issues, collections of disjoint identifying codes have been proposed for coping with malfunctioning sensors. However, these collections have some problems regarding detection of malfunctioning sensors and, moreover, it seems unnecessary to restrict oneself to disjoint codes. In this paper, we discuss a certain type of identifying codes, for which the detection of malfunctioning sensors is easy, and based on these codes we design a collection of codes tolerant against malfunctions. We present some results on general graphs as well as optimal constructions in rook's graphs and binary Hamming spaces. (C) 2019 Elsevier Inc. All rights reserved.
Downloadable publication This is an electronic reprint of the original article. |  |
UTU Research Portal