Algebraic topology for wireless sensor networks

Abstract : Simplicial complex representation gives a mathematical description of the topology of a wireless sensor network, i.e., its connectivity and coverage. In these networks, sensors are randomly deployed in bulk in order to ensure perfect connectivity and coverage. We propose an algorithm to discover which sensors are to be switched off, without modification of the topology, in order to reduce energy consumption. Our reduction algorithm can be applied to any type of simplicial complex and reaches an optimum solution. For random geometric simplicial complexes, we find boundaries for the number of removed vertices, as well as mathematical properties for the resulting simplicial complex. The complexity of our reduction algorithm boils down to the computation of the asymptotical behavior of the clique number of a random geometric graph. We provide almost sure asymptotical behavior for the clique number in all three percolation regimes of the geometric graph. In the second part, we apply the simplicial complex representation to cellular networks and improve our reduction algorithm to fit new purposes. First, we provide a frequency auto-planning algorithm for self-configuration of SON in future cellular networks. Then, we propose an energy conservation fot the self-optimization of wireless networks. Finally, we present a disaster recovery algorithm for any type of damaged wireless network. In this last chapter, we also introduce the simulation of determinantal point processes in wireless networks.Simplicial complex representation gives a mathematical description of the topology of a wireless sensor network, i.e., its connectivity and coverage. In these networks, sensors are randomly deployed in bulk in order to ensure perfect connectivity and coverage. We propose an algorithm to discover which sensors are to be switched off, without modification of the topology, in order to reduce energy consumption. Our reduction algorithm can be applied to any type of simplicial complex and reaches an optimum solution. For random geometric simplicial complexes, we find boundaries for the number of removed vertices, as well as mathematical properties for the resulting simplicial complex. The complexity of our reduction algorithm boils down to the computation of the asymptotical behavior of the clique number of a random geometric graph. We provide almost sure asymptotical behavior for the clique number in all three percolation regimes of the geometric graph. In the second part, we apply the simplicial complex representation to cellular networks and improve our reduction algorithm to fit new purposes. First, we provide a frequency auto-planning algorithm for self-configuration of SON in future cellular networks. Then, we propose an energy conservation fot the self-optimization of wireless networks. Finally, we present a disaster recovery algorithm for any type of damaged wireless network. In this last chapter, we also introduce the simulation of determinantal point processes in wireless networks.
Keywords : Sensor
Complete list of metadatas

Cited literature [91 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/tel-01232632
Contributor : Abes Star <>
Submitted on : Monday, November 23, 2015 - 7:15:07 PM
Last modification on : Friday, May 17, 2019 - 12:34:56 PM
Long-term archiving on : Wednesday, February 24, 2016 - 2:02:59 PM

File

theseVergneV2.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01232632, version 1

Citation

Anaïs Vergne. Algebraic topology for wireless sensor networks. Networking and Internet Architecture [cs.NI]. Télécom ParisTech, 2013. English. ⟨NNT : 2013ENST0070⟩. ⟨tel-01232632⟩

Share

Metrics

Record views

592

Files downloads

271