Minimal networks for sensor counting problem using discrete Euler calculus
From MaRDI portal
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.
Recommendations
- Target Enumeration via Euler Characteristic Integrals
- Discrete Euler integration over functions on finite categories
- Target counting with Presburger constraints and its application in sensor networks
- Distributed computation of coverage in sensor networks by homological methods
- Homological sensor networks
Cites work
- scientific article; zbMATH DE number 4123876 (Why is no real title available?)
- Algebraic topology of finite topological spaces and applications
- Combinatorial algebraic topology
- Discrete Euler integration over functions on finite categories
- Finite Topological Spaces
- Higher algebraic K-theory: I
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Simple homotopy types and finite spaces
- Singular homology groups and homotopy groups of finite topological spaces
- Target Enumeration via Euler Characteristic Integrals
- The Euler characteristic of a category
- Čech complexes for covers of small categories
Cited in
(2)
This page was built for publication: Minimal networks for sensor counting problem using discrete Euler calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364357)
