Julien Bensmail ; Thibaut Blanc ; Nathann Cohen ; Frédéric Havet ; Leonardo Rocha - Backbone colouring and algorithms for TDMA scheduling

dmtcs:5079 - Discrete Mathematics & Theoretical Computer Science, July 13, 2019, Vol. 21 no. 3 - https://doi.org/10.23638/DMTCS-21-3-24
Backbone colouring and algorithms for TDMA schedulingArticle

Authors: Julien Bensmail 1; Thibaut Blanc 2; Nathann Cohen ORCID3; Frédéric Havet ORCID1; Leonardo Rocha ORCID4,5

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.

Volume: Vol. 21 no. 3
Section: Graph Theory
Published on: July 13, 2019
Accepted on: June 19, 2019
Submitted on: January 15, 2019
Keywords: Wireless networks,TDMA scheduling,Backbone colouring,Algorithmic complexity,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 943 times.
This article's PDF has been downloaded 344 times.