CC-TDMA: Coloring- and Coding-Based Multi-Channel TDMA Scheduling for Wireless Ad Hoc Networks

This paper addresses the issue of transmission scheduling in multi-channel wireless ad hoc networks. The authors propose a multi-channel time division multiple access (TDMA) scheduling based on edge coloring and algebraic coding theory, called CC-TDMA. The authors categorized the conflicts suffered by wireless links into two types: explicit conflicts and implicit conflicts, and CC-TDMA utilize two different strategies to deal with them. Explicit conflicts are avoided completely by a simple distributed edge-coloring algorithm mu-M, and implicit conflicts are minimized by using coding theory to assign channels to links. The authors evaluate CC-TDMA analytically and numerically, and find that it exhibits a better performance than previous work in terms of throughput and delay.