The relation between delay and Edge-Chromatic number of the network graph in wireless Ad Hoc networks

In the past decade, several efforts have been taken to develop efficient yet low complexity link scheduling algorithms to achieve the entire or a fraction of throughput region in wireless networks. In this paper we study delay property of the throughput optimal maximum weight link scheduling algorithm. Specifically, the impact of Edge-Chromatic number of the network graph on average delay of the packets is derived analytically. The results of this paper show that how bound of average delay is affected by network topology in the order sense. Simulation results confirm our analytical findings.