Backbone colouring and algorithms for TDMA scheduling

MaRDI QIDQ5226846zbMATHFDO

Authors Julien Bensmail, T. Blanc, Nathann Cohen, Frédéric Havet, Leonardo Rocha

Publication date 1 August 2019

Full work available at URL https://dmtcs.episciences.org/5589/pdf

zbMATH Keywords

wireless networksalgorithmic complexitybackbone colouringTDMA scheduling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Network design and communication in computer systems (68M10)

Recommendations

• The backbone packet radio network coloring for time division multiple access link scheduling in wireless multihop networks
• On \(\mathrm{BMRN}^\ast\)-colouring of planar digraphs
• Chromatic scheduling and frequency assignment
• Link scheduling in wireless sensor networks: distributed edge-coloring revisited
• Models and approximation algorithms for channel assignment in radio networks

Cited in

(3)

• On \(\mathrm{BMRN}^\ast\)-colouring of planar digraphs
• Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
• The backbone packet radio network coloring for time division multiple access link scheduling in wireless multihop networks

This page was built for publication: Backbone colouring and algorithms for TDMA scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226846)