Decentralized Computation of Homology in Wireless Sensor Networks Using Spanning Trees
Authors:
Open Access
- 24 August 2017
- book chapter
- Published by Springer Nature
- p. 25-40
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Review on data mining techniques in wireless sensor networks2015
- Homology-Based Distributed Coverage Hole Detection in Wireless Sensor NetworksIEEE/ACM Transactions on Networking, 2014
- Coordinate-Free Coverage in Sensor Networks via Homology2014
- On Topological Data Mining2014
- Distributed computation of coverage in sensor networks by homological methodsApplicable Algebra in Engineering, Communication and Computing, 2012
- Mayer–Vietoris sequences and coverage problems in sensor networksJapan Journal of Industrial and Applied Mathematics, 2011
- A fast distributed approximation algorithm for minimum spanning treesDistributed Computing, 2007
- Coverage in sensor networks via persistent homologyAlgebraic & Geometric Topology, 2007
- Localized algorithms for coverage boundary detection in wireless sensor networksWireless Networks, 2007
- On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams2005