• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

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

Thumbnail
Date
2017
Link to item file
https://hal.archives-ouvertes.fr/hal-01715916
Dewey
Informatique générale
Sujet
Completely Independent Spanning Tree; CIST; Integer Linear Programming; Quasi-Unit Disk Graph
DOI
http://dx.doi.org/10.1109/WiMOB.2017.8115791
Conference name
2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
Conference date
2017
Conference city
Piscataway, NJ
Conference country
ITALY
Book title
2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
Publisher
IEEE - Institute of Electrical and Electronics Engineers
Publisher city
Piscataway, NJ
ISBN
978-1-5386-3839-2
URI
https://basepub.dauphine.fr/handle/123456789/21020
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Moinet, Axel
Darties, Benoit
Gastineau, Nicolas
Baril, Jean-Luc
Togni, Olivier
Type
Communication / Conférence
Abstract (EN)
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.