• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

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

Moinet, Axel; Darties, Benoit; Gastineau, Nicolas; Baril, Jean-Luc; Togni, Olivier (2017), 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), IEEE - Institute of Electrical and Electronics Engineers : Piscataway, NJ. 10.1109/WiMOB.2017.8115791

Type
Communication / Conférence
External document link
https://hal.archives-ouvertes.fr/hal-01715916
Date
2017
Conference title
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
Published in
Piscataway, NJ
ISBN
978-1-5386-3839-2
Publication identifier
10.1109/WiMOB.2017.8115791
Metadata
Show full item record
Author(s)
Moinet, Axel
Darties, Benoit
Gastineau, Nicolas
Baril, Jean-Luc
Togni, Olivier cc
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.
Subjects / Keywords
Completely Independent Spanning Tree; CIST; Integer Linear Programming; Quasi-Unit Disk Graph

Related items

Showing items related by title and author.

  • Thumbnail
    Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees 
    Darties, Benoit; Gastineau, Nicolas; Togni, Olivier (2018) Article accepté pour publication ou publié
  • Thumbnail
    Enhancing Data Security in Ad hoc Networks based Multipath routing 
    Mokdad, Lynda; Ben Othman, Jalel (2010) Article accepté pour publication ou publié
  • Thumbnail
    Exact algorithms for OWA-optimization in multiobjective spanning tree problems 
    Galand, Lucie; Spanjaard, Olivier (2012) Article accepté pour publication ou publié
  • Thumbnail
    Choquet-based optimisation in multiobjective shortest path and spanning tree problems 
    Galand, Lucie; Perny, Patrice; Spanjaard, Olivier (2010) Article accepté pour publication ou publié
  • Thumbnail
    Dissipative boundary conditions for 2 × 2 hyperbolic systems of conservation laws for entropy solutions in BV 
    Coron, Jean-Luc; Ervedoza, Sylvain; Ghoshal, Shyam; Glass, Olivier; Perrollaz, Vincent (2017) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo