Optimize Wireless Networks for Energy Saving by Distributed Computation of Čech Complex

Abstract : In this paper, we introduce a distributed algorithm to compute the \v{C}ech complex. This algorithm is aimed at solving the coverage problems in self organized wireless networks. The complexity to compute the minimal \v{C}ech complex that gives information about coverage and connectivity of the network is $\mathcal{O}(n^2)$, where $n$ is the average number of neighbors of each cell. An application based on the distributed computation of the \v{C}ech complex, which is aimed at optimizing the wireless network for energy saving, is also proposed. This application also has polynomial complexity. The performance of the proposed algorithm and its application are evaluated. The simulation results show that the distributed computation of the \v{C}ech complex provides a consistent outcome with the one obtained by the centralized computation that is introduced in [6], while requires a much shorter calculation time. The optimized coverage saves 65\% of the total transmission power, while also keeps the maximal coverage for the network.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01580622
Contributor : Ngoc Khuyen Le <>
Submitted on : Friday, September 1, 2017 - 6:47:57 PM
Last modification on : Thursday, October 17, 2019 - 12:36:55 PM

Files

WiMob2017-final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01580622, version 1

Citation

Ngoc-Khuyen Le, Anais Vergne, Philippe Martins, Laurent Decreusefond. Optimize Wireless Networks for Energy Saving by Distributed Computation of Čech Complex. The 13th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2017, 2017, Roma, Italy. ⟨hal-01580622⟩

Share

Metrics

Record views

157

Files downloads

158