Completely Independent Spanning Trees for enhancing the robustness in ad-hoc Networks
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | Completely Independent Spanning Trees for enhancing the robustness in ad-hoc Networks |
| Type de publication | Conference Paper |
| Year of Publication | 2017 |
| Auteurs | Moinet A, Darties B, Gastineau N, Baril J-L, Togni O |
| Conference Name | 2017 IEEE 13TH INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB) |
| Publisher | IEEE |
| Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN Number | 978-1-5386-3839-2 |
| Mots-clés | CIST, Completely independent spanning tree, Integer Linear Programming, Quasi-Unit Disk Graph |
| Résumé | 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. |