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

Kuhn, Fabian

English

arXiv

We are given a set $V$ of autonomous agents (e.g. the computers of a distributed system) that are connected to each other by a graph $G=(V,E)$ (e.g. by a communication network connecting the agents). Assume that all agents have a unique ID between $1$ and $N$ for a parameter $Nge|V|$ and that each agent knows its ID as well as the IDs of its neighbors in $G$. Based on this limited information, every agent $v$ must autonomously compute a set of colors $S_vsubseteq C$ such that the color sets $S_u$ and $S_v$ of adjacent agents $u$ and $v$ are disjoint. We prove that there is a deterministic algorithm that uses a total of $|C|=ensuremath{mathcal{O}}(Delta^2log(N)/ensuremath{varepsilon}^2)$ colors such that for every node $v$ of $G$ (i.e., for every agent), we have $|S_v|ge |C|cdot(1-ensuremath{varepsilon})/(delta_v+1)$, where $delta_v$ is the degree of $v$ and where $Delta$ is the maximum degree of $G$. For $N=Omega(Delta^2logDelta)$, $Omega(Delta^2+loglog N)$ colors are necessary even to assign at least one color to every node (i.e., to compute a standard vertex coloring). Using randomization, it is possible to assign an $(1-ensuremath{varepsilon})/(delta+1)$-fraction of all colors to every node of degree $delta$ using only $ensuremath{mathcal{O}}(Deltalog|V|/ensuremath{varepsilon}^2)$ colors w.h.p. We show that this is asymptotically almost optimal. For graphs with maximum degree $Delta=Omega(log|V|)$, $Omega(Deltalog|V|/loglog|V|)$ colors are needed in expectation, even to compute a valid coloring.

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

Dagstuhl Research Online Publication Server

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

http://drops.dagstuhl.de/opus/volltexte/2009/1852/pdf/09001.KuhnFabian.1852.pdf

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

Abstract

Similar works

Full text

Available Versions

Dagstuhl Research Online Publication Server