CC-TDMA: Coloring-and coding-based multi-channel TDMA scheduling for wireless ad hoc networks

Abstract

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