Backbone colouring and algorithms for TDMA scheduling - Graphes, Algorithmes et Combinatoire Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2019

Backbone colouring and algorithms for TDMA scheduling

Résumé

We investigate graph colouring models for the purpose of optimizing TDMA link scheduling in Wireless Networks. Inspired by the BPRN-colouring model recently introduced by Rocha and Sasaki, we introduce a new colouring model, namely the BMRN-colouring model, which can be used to model link scheduling problems where particular types of collisions must be avoided during the node transmissions. In this paper, we initiate the study of the BMRN-colouring model by providing several bounds on the minimum number of colours needed to BMRN-colour digraphs, as well as several complexity results establishing the hardness of finding optimal colourings. We also give a special focus on these considerations for planar digraph topologies, for which we provide refined results.
Fichier principal
Vignette du fichier
bmrn-dmtcs.pdf (321.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01851600 , version 1 (30-07-2018)
hal-01851600 , version 2 (14-01-2019)
hal-01851600 , version 3 (18-06-2019)
hal-01851600 , version 4 (20-06-2019)

Identifiants

Citer

Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo Rocha. Backbone colouring and algorithms for TDMA scheduling. Discrete Mathematics and Theoretical Computer Science, 2019, Vol. 21 no. 3 (3), pp.#24. ⟨10.23638/DMTCS-21-3-24⟩. ⟨hal-01851600v4⟩
428 Consultations
830 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More