Minimal networks for sensor counting problem using discrete Euler calculus
Combinatorics
2019-03-22 v2
Abstract
This paper proposes a method to reduce noise in acyclic sensor networks enumerating targets using the integral theory with respect to Euler characteristic. For an acyclic network (a partially ordered set) equipped with sensors detecting targets, we find reducible points for enumerating targets, as a generalization of weak beat points (homotopically reducible points). This theory is useful for improving the reliability and optimization of acyclic sensor networks.
Keywords
Cite
@article{arxiv.1605.06754,
title = {Minimal networks for sensor counting problem using discrete Euler calculus},
author = {Kohei Tanaka},
journal= {arXiv preprint arXiv:1605.06754},
year = {2019}
}
Comments
Title is changed