Simplicial homology based energy saving algorithms for wireless networks

Abstract : Energy saving is one of the most investigated problems in wireless networks. In this paper, we introduce two homology based algorithms: a simulated annealing one and a downhill one. These algorithms optimize the energy consumption at network level while maintaining the maximal coverage. By using simplicial homology, the complex geometrical calculation of the coverage is reduced to simple matrix computation. The simulated annealing algorithm gives a solution that approaches the global optimal one. The downhill algorithm gives a local optimal solution. The simulated annealing algorithm and downhill algorithm converge to the solution with polynomial and exponential rate, respectively. Our simulations show that this local optimal solution also approaches the global optimal one. Our algorithms can save at most 65% of system's maximal consumption power in polynomial time. The probability density function of the optimized radii of cells is also analyzed and discussed.
Keywords : Homology
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01120497
Contributor : Ngoc Khuyen Le <>
Submitted on : Wednesday, February 25, 2015 - 6:01:56 PM
Last modification on : Friday, June 7, 2019 - 11:18:37 AM
Long-term archiving on : Tuesday, May 26, 2015 - 1:40:42 PM

Files

energy_saving_conf.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License

Identifiers

  • HAL Id : hal-01120497, version 1

Citation

Ngoc-Khuyen Le, Philippe Martins, Laurent Decreusefond, Anaïs Vergne. Simplicial homology based energy saving algorithms for wireless networks. IEEE ICC, 2015, London, United Kingdom. ⟨hal-01120497⟩

Share

Metrics

Record views

389

Files downloads

204