Adaptive Discrete Vector Field in Sensor Networks
Homology groups are a prime tool for measuring the connectivity of a network, and their computation in a distributed and adaptive way is mandatory for their use in sensor networks. In this paper, we propose a solution based on the construction of an adaptive discrete vector field from where, thanks...
Main Authors: | Mengyi Zhang, Alban Goupil |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-08-01
|
Series: | Sensors |
Subjects: | |
Online Access: | http://www.mdpi.com/1424-8220/18/8/2642 |
Similar Items
-
On Independence, Matching, and Homomorphism Complexes
by: Hough, Wesley K.
Published: (2017) -
Genetic Algorithm versus Discrete Particle Swarm Optimization Algorithm for Energy-Efficient Moving Object Coverage Using Mobile Sensors
by: Chen, H.-W, et al.
Published: (2022) -
Elimination the redundancy in coverage of a topological object with rectangles
by: A. A. Butov
Published: (2019-06-01) -
Optimisation de la couverture de communication et de mesure dans les réseaux de capteurs
by: Zhang, Mengyi
Published: (2015) -
A Topology Preserving Gridding Method for Vector Features in Discrete Global Grid Systems
by: Liangchen Zhou, et al.
Published: (2020-03-01)