Reduction Algorithm for Simplicial Complexes

Abstract : In this paper, we aim at reducing power consumption in wireless sensor networks by turning off supernumerary sensors. Random simplicial complexes are tools from algebraic topology which provide an accurate and tractable representation of the topology of wireless sensor networks. Given a simplicial complex, we present an algorithm which reduces the number of its vertices, keeping its homology (i.e. connectivity, coverage) unchanged. We show that the algorithm reaches a Nash equilibrium, moreover we find both a lower and an upper bounds for the number of vertices removed, the complexity of the algorithm, and the maximal order of the resulting complex for the coverage problem. We also give some simulation results for classical cases, especially coverage complexes simulating wireless sensor networks.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00688919
Contributor : Anaïs Vergne <>
Submitted on : Monday, July 30, 2012 - 12:16:35 PM
Last modification on : Wednesday, March 13, 2019 - 5:24:35 PM
Long-term archiving on : Friday, December 16, 2016 - 4:04:04 AM

File

ReductionAlgorithmForSimplicia...
Files produced by the author(s)

Identifiers

Collections

Citation

Anais Vergne, Laurent Decreusefond, Philippe Martins. Reduction Algorithm for Simplicial Complexes. INFOCOM 2013, Apr 2013, Turin, Italy. ⟨10.1109/INFCOM.2013.6566818⟩. ⟨hal-00688919v2⟩

Share

Metrics

Record views

596

Files downloads

468