Tolerant location detection in sensor networks
DOI10.1016/j.aam.2019.101938zbMath1471.94039OpenAlexW2977187343MaRDI QIDQ2280052
Publication date: 17 December 2019
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2019.101938
covering designHamming spacesensor networkidentifying codeRook's graphlocation detectionmalfunctioning sensor
Combinatorial aspects of block designs (05B05) Fault detection; testing in circuits and networks (94C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of packing and covering (05B40)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More results on the complexity of identifying problems in graphs
- On a new class of identifying codes in graphs
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Identifying codes of Cartesian product of two cliques of the same size
- On identifying codes that are robust against edge changes
- On robust and dynamic identifying codes
- On a new class of codes for identifying vertices in graphs
- Connected Identifying Codes
This page was built for publication: Tolerant location detection in sensor networks