# Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time

Abstract : The described multicoloring problem has direct applications in the context of wireless ad hoc and sensor networks. In order to coordinate the access to the shared wireless medium, the nodes of such a network need to employ some medium access control (MAC) protocol. Typical MAC protocols control the access to the shared channel by time (TDMA), frequency (FDMA), or code division multiple access (CDMA) schemes. Many channel access schemes assign a fixed set of time slots, frequencies, or (orthogonal) codes to the nodes of a network such that nodes that interfere with each other receive disjoint sets of time slots, frequencies, or code sets. Finding a valid assignment of time slots, frequencies, or codes hence directly corresponds to computing a multicoloring of a graph $G$. The scarcity of bandwidth, energy, and computing resources in ad hoc and sensor networks, as well as the often highly dynamic nature of these networks require that the multicoloring can be computed based on as little and as local information as possible.
Keywords :
Document type :
Conference papers
Domain :

https://hal.inria.fr/inria-00360237
Contributor : Publications Loria <>
Submitted on : Wednesday, February 11, 2009 - 12:08:19 PM
Last modification on : Wednesday, November 29, 2017 - 10:27:37 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 8:38:33 PM

### Files

stacs210_new.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : inria-00360237, version 1
• ARXIV : 0902.1868

### Citation

Fabian Kuhn. Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.613-624. ⟨inria-00360237⟩

Record views