Skip to Main content Skip to Navigation
Conference papers

Completely independent spanning trees for enhancing the robustness in ad-hoc Networks

Abstract : We investigate the problem of computing Completely Independent Spanning Trees (CIST) under a practical approach. We aim to show that despite CISTs are very challenging to exhibit in some networks, they present a real interest in ad-hoc networks and can be computed to enhance the network robustness. We propose an original ILP formulation for CISTs and we show through simulation results on representative network models that several CISTs can be computed when the network density is sufficiently high. These results tend to reinforce the interest of CISTs for various network operations such as robustness, load-balancing, traffic splitting,. .. As an important point, our results show that both the density and the number of nodes have an impact on the number of CISTs that can be found on ad-hoc networks.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01715916
Contributor : Benoît Darties <>
Submitted on : Friday, February 23, 2018 - 10:39:46 AM
Last modification on : Monday, March 30, 2020 - 8:41:29 AM
Document(s) archivé(s) le : Thursday, May 24, 2018 - 2:53:06 PM

File

PID4972999.pdf
Files produced by the author(s)

Identifiers

Citation

Axel Moinet, Benoit Darties, Nicolas Gastineau, Jean-Luc Baril, Olivier Togni. Completely independent spanning trees for enhancing the robustness in ad-hoc Networks. 2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), Oct 2017, Rome, Italy. ⟨10.1109/WiMOB.2017.8115791⟩. ⟨hal-01715916⟩

Share

Metrics

Record views

319

Files downloads

676